Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its applications in many fields such as biology, social networks or network traffic analysis. Although the existing metrics used to quantify the quality of a community work well in general, under some circumstances they fail at correctly capturing such notion. The main reason is that these metrics consider the internal community edges as a set, but ignore how these actually connect the vertices of the community. We propose the Weighted Community Clustering (W CC), which is a new community metric that takes the triangle instead of the edge as the minimal structural motif indicating the presence of a strong relation in a graph. We theoretically analyse W CC in depth and formally prove, by means of a set of properties, that the maximization of W CC guarantees communities with cohesion and structure. In addition, we propose Scalable Community Detection (SCD), a community detection algorithm based on W CC, which is designed to be fast and scalable on SMP machines, showing experimentally that W CC correctly captures the concept of community in social networks using real datasets. Finally, using ground truth data, we show that SCD provides better quality than the best disjoint community detection algorithms of the state of the art while performing faster.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.