• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Liu Zitu, Quan Ziwei, Mao Rubai, Liu Yong, Zhu Jinghua. NT-EP: A Non-Topology Method for Predicting the Scope of Social Message Propogation[J]. Journal of Computer Research and Development, 2020, 57(6): 1312-1322. DOI: 10.7544/issn1000-1239.2020.20190584
Citation: Liu Zitu, Quan Ziwei, Mao Rubai, Liu Yong, Zhu Jinghua. NT-EP: A Non-Topology Method for Predicting the Scope of Social Message Propogation[J]. Journal of Computer Research and Development, 2020, 57(6): 1312-1322. DOI: 10.7544/issn1000-1239.2020.20190584

NT-EP: A Non-Topology Method for Predicting the Scope of Social Message Propogation

Funds: This work was supported by the National Natural Science Foundation of China (61972135, 61602159), the Natural Science Foundation of Heilongjiang Province of China (F201430), the Innovation Talents Project of Science and Technology Bureau of Harbin (2017RAQXJ094, 2017RAQXJ131), and the Fundamental Research Funds of Universities in Heilongjiang Province (HDJCCX-201608, KJCX201815, KJCX201816).
More Information
  • Published Date: May 31, 2020
  • Predicting the scope of a message accurately in social networks is an important part of public opinion analysis, which has received extensive attention in the field of data mining. Most of the current research mainly uses social network topology and user action logs to predict the spread of social messages. It is usually easy to obtain action log about users in real applications, but the topology of the social network (for example, the friend relationship between users) is not easy to obtain. Therefore, non-topology social message prediction has good prospects for broader applications. In this paper, we propose a new method called NT-EP for predicting the propagation scope of social messages. NT-EP consists of four parts: 1)We construct a weighted propagation graph for each message based on the characteristics of message propagation decay over time, and then use a random walk strategy to obtain multiple propagation paths on the propagation graph; 2)We put multiple propagation paths of the target message into Bi-GRU, and combine the attention mechanism to obtain the propagation feature representation for the target message; 3)We use the gradient descent method to calculate the influence representation about other messages; 4)Combining the propagation feature representation for the target message with the influence representation about other events, we predict the propagation scope of the target message. The experimental results on Sina microblog and Flixster dataset show that our method is superior to existing social event prediction methods in terms of many indicators such as MSE and F1-score.
  • Related Articles

    [1]Guo Jiang, Wang Miao, Zhang Yujun. Content Type Based Jumping Probability Caching Mechanism in NDN[J]. Journal of Computer Research and Development, 2021, 58(5): 1118-1128. DOI: 10.7544/issn1000-1239.2021.20190871
    [2]Li Li, Liu Huanyu, Lu Laifeng. Probabilistic Caching Content Placement Method Based on Content-Centrality[J]. Journal of Computer Research and Development, 2020, 57(12): 2648-2661. DOI: 10.7544/issn1000-1239.2020.20190704
    [3]Su Wen, Zhang Longbing, Gao Xiang, Su Menghao. A Cache Locking and Direct Cache Access Based Network Processing Optimization Method[J]. Journal of Computer Research and Development, 2014, 51(3): 681-690.
    [4]Zhao Xinjie, Wang Tao, Guo Shize, Liu Huiying. Cache Attacks on Block Ciphers[J]. Journal of Computer Research and Development, 2012, 49(3): 453-468.
    [5]Zhao Xinjie, Wang Tao, Guo Shize, Liu Huiying. Cache Attacks on Block Ciphers[J]. Journal of Computer Research and Development, 2012, 49(3): 453-468.
    [6]Jia Yaocang, Wu Chenggang, Zhang Zhaoqing. Program’s Performance Profiling Optimization for Guiding Static Cache Partitioning[J]. Journal of Computer Research and Development, 2012, 49(1): 93-102.
    [7]Xiao Junhua, Feng Zijun, Zhang Longbing. The Tradeoff Cache Between Latency and Capacity in Chip Multiprocessors[J]. Journal of Computer Research and Development, 2009, 46(1): 167-175.
    [8]Gao Xiang, Zhang Longbing, Hu Weiwu. A CapacityShared Heterogeneous CMP Cache[J]. Journal of Computer Research and Development, 2008, 45(5): 877-885.
    [9]Zhou Qian, Feng Xiaobing, and Zhang Zhaoqing. Software Pipelining with Cache Profiling Information[J]. Journal of Computer Research and Development, 2008, 45(5): 834-840.
    [10]Huan Dandan, Li Zusong, Hu Weiwu, Liu Zhiyong. A Cache Adaptive Write Allocate Policy[J]. Journal of Computer Research and Development, 2007, 44(2): 348-354.
  • Cited by

    Periodical cited type(6)

    1. 赵迪,赵祖高,何克勤,聂磊. 混杂条件下的三维点云目标识别. 组合机床与自动化加工技术. 2023(06): 58-62 .
    2. 赵迪,赵祖高,程煜林,聂磊. 多特征关键点的自适应尺度融合特征点云配准. 电子测量技术. 2023(10): 68-75 .
    3. 孙昊. 基于改进随机森林的海量高维数据最近邻检索. 自动化技术与应用. 2022(11): 73-76 .
    4. 孟祥福,王丹丹,张霄雁,贾江浩. Top-k集合空间关键字近似查询方法. 计算机工程与应用. 2022(23): 104-116 .
    5. 宋涛,曹利波,赵明富,刘帅,罗宇航,杨鑫. 三维点云中关键点的配准与优化算法. 激光与光电子学进展. 2021(04): 375-383 .
    6. 孟祥福,王丹丹,张峰. 空间关键字查询综述. 计算机工程与应用. 2021(20): 13-24 .

    Other cited types(10)

Catalog

    Article views (884) PDF downloads (283) Cited by(16)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return