The increasing demand for knowledge from network data poses significant challenges in many tasks. Discovering community structure from a network is one of the classic and significant problems faced in… Click to show full abstract
The increasing demand for knowledge from network data poses significant challenges in many tasks. Discovering community structure from a network is one of the classic and significant problems faced in network analysis. In this paper, we study the network structure from the perspective of the composition of fuzzy relations, and a novel algorithm based on fuzzy relations, i.e., CDFR (Community Detection by Fuzzy Relations), is proposed for non-overlapping community detection. The key idea of CDFR is to find the NGC node (Nearest node with Greater Centrality) for each node and compute the fuzzy relation between them. Then, the community to which a node belongs depends on its NGC node. In addition, the decision graph will be constructed to guide community detection. Experimental results on artificial and real-world networks verify the effectiveness and superiority of our CDFR algorithm.
               
Click one of the above tabs to view related content.