As a key problem in viral marketing, influence maximization has been widely studied in the literature. It aims to find a set of k users in a social network, which can maximize the influence spread under a certain propagation model. With the proliferation of geo-social networks, location-aware promotion is becoming more and more necessary in real applications. However, the importance of the distance between users and the promoted locations is underestimated in the existing work. For example, when promoting a local store, the owner may prefer to influence more people that are close to the store instead of people that are far away. In this demonstration, we propose EDMS, a centralized system that efficiently processes the distance-aware influence maximization problem. To meet the online requirements, we combine different pruning strategies and the best first search algorithm to significantly reduce the search space. We present a prototype, which provides users with a web interface to issue queries and visualize the search results in real time.
[1]
Xiaokui Xiao,et al.
Influence Maximization in Near-Linear Time: A Martingale Approach
,
2015,
SIGMOD Conference.
[2]
Wen-Chih Peng,et al.
Modeling User Mobility for Location Promotion in Location-based Social Networks
,
2015,
KDD.
[3]
Xuemin Lin,et al.
Distance-aware influence maximization in geo-social network
,
2016,
2016 IEEE 32nd International Conference on Data Engineering (ICDE).
[4]
Wei Chen,et al.
Efficient influence maximization in social networks
,
2009,
KDD.
[5]
Kian-Lee Tan,et al.
Efficient location-aware influence maximization
,
2014,
SIGMOD Conference.
[6]
Wei Chen,et al.
Scalable influence maximization for prevalent viral marketing in large-scale social networks
,
2010,
KDD.
[7]
Jon Kleinberg,et al.
Maximizing the spread of influence through a social network
,
2003,
KDD '03.