• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Liu Yong, Xie Shengnan, Zhong Zhiwei, Li Jinbao, Ren Qianqian. Topic-Interest Based Influence Maximization Algorithm in Social Networks[J]. Journal of Computer Research and Development, 2018, 55(11): 2406-2418. DOI: 10.7544/issn1000-1239.2018.20170672
Citation: Liu Yong, Xie Shengnan, Zhong Zhiwei, Li Jinbao, Ren Qianqian. Topic-Interest Based Influence Maximization Algorithm in Social Networks[J]. Journal of Computer Research and Development, 2018, 55(11): 2406-2418. DOI: 10.7544/issn1000-1239.2018.20170672

Topic-Interest Based Influence Maximization Algorithm in Social Networks

More Information
  • Published Date: October 31, 2018
  • Influence maximization is a problem of finding a small set of seed nodes in a social network that maximizes the spread scope of a propagation item. Existing works only take into account the topic distribution on propagation items, but ignore the interest distribution on users. This paper focuses on how to select the most influential seeds when both the topic distribution of propagation items and the interest distribution of users are taken into consideration. A topic-interest independent cascade (TI-IC) propagation model is proposed, and an expectation maximization (EM) algorithm is proposed to learn the parameters of the TI-IC model. Based on the TI-IC model, a topic-interest influence maximization (TIIM) problem is proposed, and a new heuristic algorithm called ACG-TIIM is presented to solve TIIM. ACG-TIIM first takes each user as a root node to construct a reachable path tree, roughly estimate the influence scope of each user, and then sorts all the users according to the estimated influence scope to select a small number of users as candidate seeds, finally uses the greedy algorithm with EFLF optimization to select the most influential seeds from candidate seeds. The experimental results on real datasets show that TI-IC model is superior to classical IC and TIC models in describing propagation law and predicting propagation results. ACG-TIIM can solve the TIIM problem effectively and efficiently.
  • Related Articles

    [1]Yue Guangxue, Chen Guanglu, Lu Min, Yang Xiaohui, Liu Jianhua, Huang Chunlan, Yang Zhongming. A Computation Offloading Algorithm with Path Selection Based on K-shell Influence Maximization[J]. Journal of Computer Research and Development, 2021, 58(9): 2025-2039. DOI: 10.7544/issn1000-1239.2021.20200338
    [2]Cao Jiuxin, Gao Qingqing, Xia Rongqing, Liu Weijia, Zhu Xuelin, Liu Bo. Information Propagation Prediction and Specific Information Suppression in Social Networks[J]. Journal of Computer Research and Development, 2021, 58(7): 1490-1503. DOI: 10.7544/issn1000-1239.2021.20200809
    [3]Zhang Liqing, Guo Dong, Wu Shaoling, Cui Haibo, Wang Wei. An Ultra Lightweight Container that Maximizes Memory Sharing and Minimizes the Runtime Environment[J]. Journal of Computer Research and Development, 2019, 56(7): 1545-1555. DOI: 10.7544/issn1000-1239.2019.20180511
    [4]Yan Xiaoqiang, Ye Yangdong. Cross-Media Clustering by Share and Private Information Maximization[J]. Journal of Computer Research and Development, 2019, 56(7): 1370-1382. DOI: 10.7544/issn1000-1239.2019.20180470
    [5]Zhang Fenxiang, Chen Huahui, Qian Jiangbo, Dong Yihong. HSSM: A Hierarchical Method for Streaming Submodular Maximization[J]. Journal of Computer Research and Development, 2016, 53(8): 1792-1805. DOI: 10.7544/issn1000-1239.2016.20160140
    [6]Li Xiaokang, Zhang Xi, Sun Hao, Sun Guangzhong. Influence Maximization Across Multi-Channels in Social Network[J]. Journal of Computer Research and Development, 2016, 53(8): 1709-1718. DOI: 10.7544/issn1000-1239.2016.20160211
    [7]Guo Jingfeng, Lü Jiaguo. Influence Maximization Based on Information Preference[J]. Journal of Computer Research and Development, 2015, 52(2): 533-541. DOI: 10.7544/issn1000-1239.2015.20131311
    [8]Zhu Xiang, Jia Yan, Nie Yuanping, Qu Ming. Event Propagation Analysis on Microblog[J]. Journal of Computer Research and Development, 2015, 52(2): 437-444. DOI: 10.7544/issn1000-1239.2015.20140187
    [9]Chen Hao and Wang Yitong. Threshold-Based Heuristic Algorithm for Influence Maximization[J]. Journal of Computer Research and Development, 2012, 49(10): 2181-2188.
    [10]Qi Yingjian, Luo Siwei, Huang Yaping, Li Aijun, Liu Yunhui. An Annealing Expectation Maximization Algorithm[J]. Journal of Computer Research and Development, 2006, 43(4): 654-660.
  • Cited by

    Periodical cited type(10)

    1. 徐怡,陶强. 划分序乘积空间约简算法研究. 系统工程理论与实践. 2025(02): 554-570 .
    2. 刘长顺,刘炎,宋晶晶,徐泰华. 基于论域离散度的属性约简算法. 山东大学学报(理学版). 2023(05): 26-35+52 .
    3. 张清华,艾志华,张金镇. 融合密度与邻域覆盖约简的分类方法. 陕西师范大学学报(自然科学版). 2022(03): 33-42 .
    4. 张雨新,孙达明,李飞. 基于粒化单调的不完备混合型数据增量式属性约简算法. 计算机应用与软件. 2021(03): 279-286 .
    5. 邹丽,任思远,杨光,杨鑫华. 基于改进条件邻域熵的接头疲劳寿命影响因素分析. 焊接学报. 2021(11): 43-50+99-100 .
    6. 刘正,陈雪勤,张书锋. 基于最小化邻域互信息的邻域熵属性约简算法. 微电子学与计算机. 2020(03): 26-32 .
    7. 陈帅,张贤勇,唐玲玉,姚岳松. 邻域互补信息度量及其启发式属性约简. 数据采集与处理. 2020(04): 630-641 .
    8. 周艳红,张强. 基于三层粒结构的三支邻域熵. 数学的实践与认识. 2020(14): 83-93 .
    9. 亓慧,史颖. 不同度量下集成属性选择器的对比研究. 山西大学学报(自然科学版). 2019(04): 848-853 .
    10. 周艳红,张迪,张强. 基于单调信息度量的特定类属性约简. 内江师范学院学报. 2019(12): 35-39 .

    Other cited types(11)

Catalog

    Article views (1055) PDF downloads (455) Cited by(21)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return