Incremental graph computation: Anchored Vertex Tracking in Dynamic Social Networks
Article
Cai, Taotao, Yang, Shuiqiao, Li, Jianxin, Sheng, Quan Z., Yang, Jian, Wang, Xin, Zhang, Wei Emma and Gao, Longxiang. 2023. "Incremental graph computation: Anchored Vertex Tracking in Dynamic Social Networks." IEEE Transactions on Knowledge and Data Engineering. 35 (7), pp. 7030-7044. https://doi.org/10.1109/TKDE.2022.3199494
Article Title | Incremental graph computation: Anchored Vertex Tracking in Dynamic Social Networks |
---|---|
ERA Journal ID | 17876 |
Article Category | Article |
Authors | Cai, Taotao, Yang, Shuiqiao, Li, Jianxin, Sheng, Quan Z., Yang, Jian, Wang, Xin, Zhang, Wei Emma and Gao, Longxiang |
Journal Title | IEEE Transactions on Knowledge and Data Engineering |
Journal Citation | 35 (7), pp. 7030-7044 |
Number of Pages | 15 |
Year | 2023 |
Publisher | IEEE (Institute of Electrical and Electronics Engineers) |
Place of Publication | United States |
ISSN | 1041-4347 |
1558-2191 | |
Digital Object Identifier (DOI) | https://doi.org/10.1109/TKDE.2022.3199494 |
Web Address (URL) | https://ieeexplore.ieee.org/document/9860051 |
Abstract | User engagement has recently received significant attention in understanding the decay and expansion of communities in many online social networking platforms. When a user chooses to leave a social networking platform, it may cause a cascading dropping out among her friends. In many scenarios, it would be a good idea to persuade critical users to stay active in the network and prevent such a cascade because critical users can have significant influence on user engagement of the whole network. Many user engagement studies have been conducted to find a set of critical (anchored) users in the static social network. However, social networks are highly dynamic and their structures are continuously evolving. In order to fully utilize the power of anchored users in evolving networks, existing studies have to mine multiple sets of anchored users at different times, which incurs an expensive computational cost. To better understand user engagement in evolving network, we target a new research problem called Anchored Vertex Tracking (AVT) in this article, aiming to track the anchored users at each timestamp of evolving networks. Nonetheless, it is nontrivial to handle the AVT problem which we have proved to be NP-hard. To address the challenge, we develop a greedy algorithm inspired by the previous anchored k-core study in the static networks. Furthermore, we design an incremental algorithm to efficiently solve the AVT problem by utilizing the smoothness of the network structure’s evolution. The extensive experiments conducted on real and synthetic datasets demonstrate the performance of our proposed algorithms and the effectiveness in solving the AVT problem. |
Keywords | Anchored vertex tracking; user engagement; dynamic social networks; k-core computation |
Related Output | |
Is supplemented by | https://dataportal.arc.gov.au/NCGP/Web/Grant/Grant/DP200102298 |
Is supplemented by | https://dataportal.arc.gov.au/NCGP/Web/Grant/Grant/LP180100750 |
Contains Sensitive Content | Does not contain sensitive content |
ANZSRC Field of Research 2020 | 460501. Data engineering and data science |
Public Notes | Files associated with this item cannot be displayed due to copyright restrictions. |
Byline Affiliations | Macquarie University |
University of New South Wales | |
Deakin University | |
Tianjin University, China | |
University of Adelaide | |
Qilu University of Technology, China |
Permalink -
https://research.usq.edu.au/item/z6030/incremental-graph-computation-anchored-vertex-tracking-in-dynamic-social-networks
58
total views0
total downloads3
views this month0
downloads this month