IEDC: An Integrated Approach for Overlapping and Non-overlapping Community Detection
arXiv:1612.04679 · doi:10.1016/j.knosys.2017.02.018
Abstract
Community detection is a task of fundamental importance in social network analysis that can be used in a variety of knowledge-based domains. While there exist many works on community detection based on connectivity structures, they suffer from either considering the overlapping or non-overlapping communities. In this work, we propose a novel approach for general community detection through an integrated framework to extract the overlapping and non-overlapping community structures without assuming prior structural connectivity on networks. Our general framework is based on a primary node based criterion which consists of the internal association degree along with the external association degree. The evaluation of the proposed method is investigated through the extensive simulation experiments and several benchmark real network datasets. The experimental results show that the proposed method outperforms the earlier state-of-the-art algorithms based on the well-known evaluation criteria.
The paper is accepted in Knowledge-Based Systems journal, 12 Figures, 6 Tables
References in corpus (8)
- Fast unfolding of communities in large networks
- Modularity and community structure in networks
- Benchmark graphs for testing community detection algorithms
- Detecting the overlapping and hierarchical community structure of complex networks
- Finding statistically significant communities in networks
- Community detection in networks: Structural communities versus ground truth
- Memory Enriched Big Bang Big Crunch Optimization Algorithm for Data Clustering
- Relevant based structure learning for feature selection