• 中国精品科技期刊
  • 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]Qin Zheyun, Lu Xiankai, Xi Xiaoming, Ren Chunxiao, Nie Xiushan, Yin Yilong. Self-Supervised Graph Topology-Imbalance Learning Based on Random Walk Paths[J]. Journal of Computer Research and Development, 2025, 62(4): 863-875. DOI: 10.7544/issn1000-1239.202330813
    [2]Shu Chang, Li Qingshan, Wang Lu, Wang Ziqi, Ji Yajiang. A Networked Software Optimization Mechanism Based on Gradient-Play[J]. Journal of Computer Research and Development, 2022, 59(9): 1902-1913. DOI: 10.7544/issn1000-1239.20220016
    [3]Guo Jiawen, Bai Qijie, Lin Zhutian, Song Chunyao, Yuan Xiaojie. Dynamic Heterogeneous Network Embedding Based on Non-Decreasing Temporal Random Walk[J]. Journal of Computer Research and Development, 2021, 58(8): 1624-1641. DOI: 10.7544/issn1000-1239.2021.20210317
    [4]Li Shengdong, Lü Xueqiang. Static Restart Stochastic Gradient Descent Algorithm Based on Image Question Answering[J]. Journal of Computer Research and Development, 2019, 56(5): 1092-1100. DOI: 10.7544/issn1000-1239.2019.20180472
    [5]Zhao Zeya, Jia Yantao, Wang Yuanzhuo, Jin Xiaolong, Cheng Xueqi. Temporal Link Prediction Based on Dynamic Heterogeneous Information Network[J]. Journal of Computer Research and Development, 2015, 52(8): 1735-1741. DOI: 10.7544/issn1000-1239.2015.20150183
    [6]Xin Yu, Yang Jing, Xie Zhiqiang. A Semantic Overlapping Community Detecting Algorithm in Social Networks Based on Random Walk[J]. Journal of Computer Research and Development, 2015, 52(2): 499-511. DOI: 10.7544/issn1000-1239.2015.20131246
    [7]Wang Yujun, Gao Qiankun, Zhang Xian, and Tao Qing. A Coordinate Descent Algorithm for Solving Capped-L1 Regularization Problems[J]. Journal of Computer Research and Development, 2014, 51(6): 1304-1312.
    [8]Zhu Yelei, Wang Yujun, Luo Qiang, and Tao Qing. A Soft-Thresholding Coordinate Descent Algorithm for Solving Truncated Hinge Loss[J]. Journal of Computer Research and Development, 2013, 50(11): 2295-2303.
    [9]Wu Qiong, Tan Songbo, Xu Hongbo, Duan Miyi, Cheng Xueqi. CrossDomain Opinion Analysis Based on RandomWalk Model[J]. Journal of Computer Research and Development, 2010, 47(12).
    [10]Mei Yuan, Sun Huaijiang, and Xia Deshen. A Gradient-Based Robust Method for Estimation of Fingerprint Orientation Field[J]. Journal of Computer Research and Development, 2007, 44(6): 1022-1031.
  • Cited by

    Periodical cited type(1)

    1. 张春祥,唐利波,高雪瑶. 半监督卷积神经网络的词义消歧. 西南交通大学学报. 2022(01): 11-17+27 .

    Other cited types(0)

Catalog

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

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return