A Scheme to Design Community Detection Algorithms in Various Networks
Lists
Only you see this
Abstract
Network structures, consisting of nodes and edges, have applications in almost all subjects. A set of nodes is called a community if the nodes have strong interrelations. Industries (including cell phone carriers and online social media companies) need community structures to allocate network resources and provide proper and accurate services. However, most detection algorithms are derived independently, which is arduous and even unnecessary. Although recent research shows that a general detection method that serves all purposes does not exist, we believe that there is some general procedure of deriving detection algorithms. In this paper, we represent such a general scheme. We mainly focus on two types of networks: transmission networks and similarity networks. We reduce them to a unified graph model, based on which we propose a method to define and detect community structures. Finally, we also give a demonstration to show how our design scheme works.
BibTeX
@article{lu2019scheme,
author = {Haoye Lu and Amiya Nayak},
title = {{A Scheme to Design Community Detection Algorithms in Various Networks}},
journal = {Future Internet},
year = {2019},
doi = {10.3390/fi11020041},
}| Community Structures Are Definable in Networks, and Universal in Real World | arXiv · 2013 |
| The stability of a graph partition: A dynamics-based framework for community detection | arXiv · 2013 |
| GenPerm: A Unified Method for Detecting Non-overlapping and Overlapping Communities | arXiv · 2016 |
| Quantifying and identifying the overlapping community structure in networks | Journal of Statistical Mechanics Theory and Experiment · 2009 |
| A classification for community discovery methods in complex networks | arXiv · 2012 |
| Community Detection in Networks: The Leader-Follower Algorithm | arXiv · 2010 |