An Optimized Credit Distribution Model in Social Networks with Time-Delay Constraint

被引：0
|
作者：
Deng X. [1 ]
Cao D. [1 ]
Pan Y. [1 ]
Shen H. [1 ]
Chen Z. [2 ]
机构：
[1] School of Information Science and Engineering, Central South University, Changsha
[2] School of Software, Central South University, Changsha
来源：
| 1600年 / Science Press卷 / 54期
基金：
中国国家自然科学基金;
关键词：
Credit distribution; Greedy algorithm; Influence maximization; Social networks; Time-delay constraint;
D O I：
10.7544/issn1000-1239.2017.20151118
中图分类号：
学科分类号：
摘要：
The research of influence maximization in social networks is emerging as a promising opportunity for successful viral marketing. Influence maximization with time-delay constraint (IMTC) is to identify a set of initial individuals who will influence others and lead to a maximum value of influence spread consequence under time-delay constraint. Most of the existing models focus on optimizing the simulation consequence of influence spread, and time-delay factors and time-delay constraint are always ignored. The credit distribution with time-delay constraint model (CDTC) incorporates the meeting and activation probabilities to optimize the distribution of credit considering time-delay constraint, and utilizes the optimized relationships of meeting and activation probabilities to evaluate the ability to influence on adjacent individuals. Furthermore, the obstructive effect due to repeated attempts of meeting and activation is reflected by the length of increased propagation paths. After assigning the credit along with the increased propagation paths learned from users' action-logs, the nodes which obtain maximal marginal gain are selected to form the seed set by the greedy algorithm with time-delay constraint (GA-TC). The experimental results based on real datasets show that the proposed approach is more accurate and efficient compared with other related methods. © 2017, Science Press. All right reserved.
引用
收藏
页码：382 / 393
页数：11
相关论文
共 19 条
  • [1] Wu X., Li Y., Li L., Influence analysis in online social networks, Chinese Journal of Computers, 37, 4, pp. 735-752, (2014)
  • [2] Xu G., Zhang S., Chen H., Et al., Measurement and analysis in online social networks, Chinese Journal of Computers, 36, 1, pp. 165-188, (2014)
  • [3] Xiao T., Chen Y., Zhang W., Et al., Review of influence in social networks, Journal of Computer Applications, 34, 4, pp. 980-985, (2014)
  • [4] Domingos P., Richardson M., Mining the network value of customers, Proc of the 7th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining, pp. 57-66, (2001)
  • [5] Richardson M., Domingos P., Mining knowledge-sharing sites for viral marketing, Proc of the 8th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining, pp. 61-70, (2002)
  • [6] Kempe D., Kleinberg J., Tardos E., Maximizing the spread of influence through a social network, Proc of the 9th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining, pp. 137-146, (2003)
  • [7] Rahimkhani K., Aleahmad A., Rahgozar M., Et al., A fast algorithm for finding most influential people based on the linear threshold model, Expert Systems with Applications, 42, 3, pp. 1353-1361, (2015)
  • [8] Chen W., Yuan Y., Zhang L., Scalable influence maximization in social networks under the linear threshold model, Proc of 2010 IEEE Int Conf on Data Mining, pp. 88-97, (2010)
  • [9] Chen W., Wang Y., Yang S., Efficient influence maximization in social networks, Proc of the 15th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining, pp. 199-207, (2009)
  • [10] Chen W., Wang C., Wang Y., Scalable influence maximization for prevalent viral marketing in large-scale social networks, Proc of the 16th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining, pp. 1029-1038, (2010)
12