Attractive community detection in academic social network

被引:5
作者
Wang, Yakun [1 ]
Han, Xiaodong [1 ]
机构
[1] China Acad Space Technol, Inst Telecommun & Nav Satellites, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Social network analysis; Community ranking; Attractiveness; HITS; PAGERANK;
D O I
10.1016/j.jocs.2021.101331
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Academic social network analysis has attracted significant attention. For each researcher in such a network, he/ she has several research interests. We regard these researchers sharing common interests as a research community. For each community, it may be attractive or not to researchers from other communities. In this paper, we study a new and interesting problem: which is the most attractive research community in the academic social network? Here, attractive research communities are those potentially valuable and increasingly popular communities, which are different from hot communities. To address this problem, we first extract both of the internal and external features of attractive research communities. The internal feature refers to the novelty of the topic in the research community and the external feature refers to the researchers? transition among the communities. Intuitively, a community with a novel topic attracts the researchers from other research communities can be considered as the attractive community. Based on the extracted features, we design a novel Attractive Research community Ranking (ARTRank) algorithm to rank the research communities. The core idea of this algorithm lies in two measurements for each community: a positiveness score and a negativeness score, which measure the attractiveness of a community from the in-attention aspect and the out-attention aspect, respectively. Similar to HITS, these two scores are calculated in an iterative way until convergence. Through extensive experiments, we show that our proposed algorithm significantly outperforms the state-of-the-art algorithms in terms of the recommendation intensity.
引用
收藏
页数:11
相关论文
共 45 条
[1]   Models of Influence in Online Social Networks [J].
AlFalahi, Kanna ;
Atif, Yacine ;
Abraham, Ajith .
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2014, 29 (02) :161-183
[2]  
[Anonymous], 2012, Social network analysis
[3]  
[Anonymous], 2002, P 11 INT C WORLD WID
[4]  
Backstrom L, 2006, P 12 ACM SIGKDD INT, V12, P44
[5]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[6]   A Fake Online Repository Generation Engine for Cyber Deception [J].
Chakraborty, Tanmoy ;
Jajodia, Sushil ;
Katz, Jonathan ;
Picariello, Antonio ;
Sperli, Giancarlo ;
Subrahmanian, V. S. .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (02) :518-533
[7]   Efficient Influence Maximization in Social Networks [J].
Chen, Wei ;
Wang, Yajun ;
Yang, Siyu .
KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, :199-207
[8]   PageRank for Ranking Authors in Co-citation Networks [J].
Ding, Ying ;
Yan, Erjia ;
Frazho, Arthur ;
Caverlee, James .
JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2009, 60 (11) :2229-2243
[9]  
Eftekhar M, 2013, 19TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'13), P401
[10]  
Gao J, 2010, ACM SIGKDD INT C KNO, P813