Temporally Evolving Community Detection and Prediction in Content-Centric Networks

被引:11
作者
Appel, Ana Paula [1 ]
Cunha, Renato L. F. [1 ]
Aggarwal, Charu C. [2 ]
Terakado, Marcela Megumi [3 ]
机构
[1] IBM Res, Sao Paulo, Brazil
[2] IBM Res, Yorktown Hts, NY USA
[3] Univ Sao Paulo, Sao Paulo, Brazil
来源
MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2018, PT II | 2019年 / 11052卷
关键词
D O I
10.1007/978-3-030-10928-8_1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this work, we consider the problem of combining link, content and temporal analysis for community detection and prediction in evolving networks. Such temporal and content-rich networks occur in many real-life settings, such as bibliographic networks and question answering forums. Most of the work in the literature (that uses both content and structure) deals with static snapshots of networks, and they do not reflect the dynamic changes occurring over multiple snapshots. Incorporating dynamic changes in the communities into the analysis can also provide useful insights about the changes in the network such as the migration of authors across communities. In this work, we propose Chimera (https://github.com/renatolfc /chimera-stf), a shared factorization model that can simultaneously account for graph links, content, and temporal analysis. This approach works by extracting the latent semantic structure of the network in multidimensional form, but in a way that takes into account the temporal continuity of these embeddings. Such an approach simplifies temporal analysis of the underlying network by using the embedding as a surrogate. A consequence of this simplification is that it is also possible to use this temporal sequence of embeddings to predict future communities. We present experimental results illustrating the effectiveness of the approach.
引用
收藏
页码:3 / 18
页数:16
相关论文
共 35 条
[1]  
[Anonymous], 2013, P 22 INT C WORLD WID, DOI DOI 10.1145/2488388.2488483
[2]  
[Anonymous], 2012, Proceedings of the thirteenth ACM in- ternational symposium on Mobile Ad Hoc Networking and Computing
[3]  
[Anonymous], 2008, Introduction to information retrieval
[4]   AN ALGORITHM FOR PARTITIONING THE NODES OF A GRAPH [J].
BARNES, ER .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (04) :541-550
[5]   COMMUNITY DETECTION IN TEMPORAL MULTILAYER NETWORKS, WITH AN APPLICATION TO CORRELATION NETWORKS [J].
Bazzi, Marya ;
Porter, Mason A. ;
Williams, Stacy ;
McDonald, Mark ;
Fenn, Daniel J. ;
Howison, Sam D. .
MULTISCALE MODELING & SIMULATION, 2016, 14 (01) :1-41
[6]   Consciousness is not a property of states: A reply to Wilberg [J].
Berger, Jacob .
PHILOSOPHICAL PSYCHOLOGY, 2014, 27 (06) :829-842
[7]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[8]  
Cohn D, 2001, ADV NEUR IN, V13, P430
[9]  
Cohn D., 2000, P INT C NEUR INF PRO, P409
[10]   Community detection in graphs [J].
Fortunato, Santo .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2010, 486 (3-5) :75-174