scholarly journals Detecting Communities in Social Networks Using Local Information

Author(s):  
Jiyang Chen ◽  
Osmar R. Zaïane ◽  
Randy Goebel
2016 ◽  
Vol 43 (5) ◽  
pp. 615-634 ◽  
Author(s):  
Mohammad Ebrahim Samie ◽  
Ali Hamzeh

Communities in social networks are groups of individuals who are connected with specific goals. Discovering information on the structure, members and types of changes of communities have always been of great interest. Despite the extensive global researches conducted on these, discovery has not been confirmed yet and researchers try to find methods and improve estimated techniques by using Data Mining tools, Graph Mining tools and artificial intelligence techniques. This paper proposes a novel two-phase approach based on global and local information to detect communities in social network. It explores the global information in the first phase and then exploits the local information in the second phase to discover communities more accurately. It also proposes a novel algorithm which exploits the local information and mines deeply for the second phase. Experimental results show that the proposed method has better performance and achieves more accurate results compared with the previous ones.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-5
Author(s):  
Jie Li ◽  
Xiyang Peng ◽  
Jian Wang ◽  
Na Zhao

Link prediction is a key tool for studying the structure and evolution mechanism of complex networks. Recommending new friend relationships through accurate link prediction is one of the important factors in the evolution, development, and popularization of social networks. At present, scholars have proposed many link prediction algorithms based on the similarity of local information and random walks. These algorithms help identify actual missing and false links in various networks. However, the prediction results significantly differ in networks with various structures, and the prediction accuracy is low. This study proposes a method for improving the accuracy of link prediction. Before link prediction, k-shell decomposition method is used to layer the network, and the nodes that are in 1-shell and the nodes that are not linked to the high-shell in the 2-shell are deleted. The experiments on four real network datasets verify the effectiveness of the proposed method.


Author(s):  
Christian Borgs ◽  
Michael Brautbar ◽  
Jennifer Chayes ◽  
Sanjeev Khanna ◽  
Brendan Lucier

Sign in / Sign up

Export Citation Format

Share Document