TSCDA: A novel greedy approach for community discovery in networks
Ferdowsi, A.; Khanteymoori, A.; Dehghan Chenary, M.
Show abstract
In this paper, we introduce a new approach for detecting community structures in networks. The approach is subject to modifying one of the connectivity-based community quality functions based on considering the impact that each communitys most influential node has on the other vertices. Utilizing the proposed quality measure, we devise an algorithm that aims to detect high-quality communities of a given network based on two stages: finding a promising initial solution using greedy methods and then refining the solutions in a local search manner. The performance of our algorithm has been evaluated on some standard real-world networks as well as on some artificial networks. The experimental results of the algorithm are reported and compared with several state-of-the-art algorithms. The experiments show that our approach is competitive with the other well-known techniques in the literature and even outperforms them. This approach can be used as a new community detection method in network analysis.
Matching journals
The top 7 journals account for 50% of the predicted probability mass.
Similar papers in this journal
- Agent-based simulation for reconstructing social structure by observing collective movements with special reference to single-file movement 95%
- Metrics for Graph Comparison: A Practitioner’s Guide 95%
- Increasing efficacy of contact-tracing applications by user referrals and stricter quarantining 94%
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.