Virtual Community Detection Through the Association between Prime Nodes in Online Social Networks and Its Application to Ranking Algorithms

被引:17
作者
Khan, Muhammad Sadiq [1 ]
Wahab, Ainuddin Wahid Abdul [1 ]
Herawan, Tutut [1 ,4 ]
Mujtaba, Ghulam [1 ,2 ]
Danjuma, Sani [1 ,3 ]
Al-Garadi, Mohammed Ali [1 ]
机构
[1] Univ Malaya, Fac Comp Sci & Informat Technol, Kuala Lumpur 50603, Malaysia
[2] Sukkur Inst Business Adm, Dept Comp Sci, Sukkur 65200, Pakistan
[3] Northwest Univ, Dept Comp Sci, Kano 3099, Nigeria
[4] AMCS Res Ctr, Yogyakarta 55581, Indonesia
关键词
Information diffusion; link prediction; network community; online social network; prime node; ranking algorithm; virtual community; DATA FILLING APPROACH; LINK-PREDICTION; COMPLEX NETWORKS; MISSING DATA; SOFT SETS; INFORMATION;
D O I
10.1109/ACCESS.2016.2639563
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Existing studies have contributed immensely to link prediction by identifying different types of network communities. In this paper, a new type of network community in online social networks (OSNs) is identified using the association between network nodes. This new network community is called "virtual community." Virtual communities are based on either the real/ physical relationships of users that are connected to their constituency, social, and professional activities or their virtual interactions associated with their cognitive levels, choice selection, and ideology. Users belonging to the same virtual community exhibit similar behavior in linking to nodes of common interest. These nodes, which reflect the common interest of a community, are called "prime nodes." Prime nodes are linked to the prediction problem in OSN completion and are generally recommended for OSN growth. Recent studies on ranking algorithms have shown that the incompleteness of OSNs contributes to the low accuracy of ranking algorithms in identifying top spreaders. Thus, in this paper, we propose an OSN completion method based on link prediction through association between prime nodes. An experiment on predicting new links in two real big data sets of two global OSNs, namely, Facebook and Twitter, is conducted. The effectiveness of the proposed method is also validated by applying prominent ranking algorithms to the newly predicted and original networks. Results show that the accuracy rates of the ranking algorithms are improved, thereby validating the importance of the proposed method in predicting vital links.
引用
收藏
页码:9614 / 9624
页数:11
相关论文
共 41 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]  
Ahlqvist T., 2008, Social media roadmaps: Exploring the futures triggered
[3]  
[Anonymous], 2010, P 3 ACM INT C WEB SE, DOI DOI 10.1145/1718487.1718520
[4]  
[Anonymous], 2011, Everyone is an influencer: Quantifying influence on twitter, DOI DOI 10.1145/1935826.1935845
[5]  
[Anonymous], 2013, P 7 WORKSH SOC NETW
[6]  
[Anonymous], 2014, Accelerating community detection by using k-core subgraphs
[7]  
Batagelj V, 2003, OM ALGORITHM CORES D
[8]   Community detection in social networks [J].
Bedi, Punam ;
Sharma, Chhavi .
WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2016, 6 (03) :115-135
[9]  
Ben Jabeur L, 2012, LECT NOTES COMPUT SC, V7608, P111, DOI 10.1007/978-3-642-34109-0_12
[10]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117