Overlapping communities structures could effectively reveal the internal relationships in real networks, especially on the ownership problems on the nodes in overlapping areas between communities. Hence, the overlapping community detection research becomes a hotspot topic on graph mining in the decade, while the local expansion methods based on structural fitness function could simultaneously discover overlapped and hierarchical structures. Aimed at community drift and redundant calculation problems on general local expansion methods, the paper presents a novel local expansion method based on rough neighborhood that carries out the heuristic technology by the community seed inspiration and the triangle optimization on the boundary domain. The method could directly generate natural overlaps between communities, reduce the computational complexity and improve the detection on the overlapped boundary area. Finally, the experimental results on some real networks also show that the rough expansion method based on triangle optimization could be more effective in detecting the overlapping structures.
CITATION STYLE
Zhang, Z., Zhang, N., Zhong, C., & Duan, L. (2015). Detecting overlapping communities with triangle-based rough local expansion method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9436, pp. 446–456). Springer Verlag. https://doi.org/10.1007/978-3-319-25754-9_39
Mendeley helps you to discover research relevant for your work.