Influence Maximization in Distance-Aware Recommendation
Influence Maximization is a key problem in viral marketing.With the popularity of geo-social networks, more and more companies use social networking to promote their products.Location-aware products promotion is becoming more necessary in real applications.For instance, when opening a restaurant in downtown, the owner may attract customers by issuing coupons, free VIP, etc.And the owner hope to find the most influential customers in the first group to promote new restaurant through their social network.In this paper, given a social network G and a positive integer k,it aims to identify a seed set of k nodes in G that can maximize the expected influence spread in a certain propagation model.Combining the distance and other factors, we can find out the nodes that have the maximum influence and the number of nodes that can be influenced by the input node information.Therefore, the experimeutal results verify the main problems in this paper: we can find out the node.It has influence maximization in distance-aware.
Maximization Influence Social network Promote
Zongmin Cui Shuangshuang Wan Zhuolin Mei Bin Wu Guangyong Gao Zhiqiang Zhao
School of Information Science and Technology Jiujiang University,Jiujiang, Jiangxi, China
国际会议
郑州
英文
308-313
2018-09-21（万方平台首次上网日期，不代表论文的发表时间）