Summarizing RDF graphs using Node Importance and Query History

Author(s):  
Jimao Guo ◽  
Yi Wang
Keyword(s):  
Author(s):  
Elisa S. Menendez ◽  
Marco A. Casanova ◽  
Luiz A. P. Paes Leme ◽  
Mohand Boughanem

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 497
Author(s):  
Huan Li ◽  
Ruisheng Zhang ◽  
Zhili Zhao ◽  
Xin Liu

Community detection is of great significance in understanding the structure of the network. Label propagation algorithm (LPA) is a classical and effective method, but it has the problems of randomness and instability. An improved label propagation algorithm named LPA-MNI is proposed in this study by combining the modularity function and node importance with the original LPA. LPA-MNI first identify the initial communities according to the value of modularity. Subsequently, the label propagation is used to cluster the remaining nodes that have not been assigned to initial communities. Meanwhile, node importance is used to improve the node order of label updating and the mechanism of label selecting when multiple labels are contained by the maximum number of nodes. Extensive experiments are performed on twelve real-world networks and eight groups of synthetic networks, and the results show that LPA-MNI has better accuracy, higher modularity, and more reasonable community numbers when compared with other six algorithms. In addition, LPA-MNI is shown to be more robust than the traditional LPA algorithm.


2014 ◽  
Vol 33 (4) ◽  
pp. 555-581 ◽  
Author(s):  
Roberto De Virgilio ◽  
Antonio Maccioni ◽  
Riccardo Torlone

Author(s):  
Mikhail Galkin ◽  
Diego Collarana ◽  
Ignacio Traverso-Ribón ◽  
Maria-Esther Vidal ◽  
Sören Auer
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document