Sorn Jarukasemratana
ABSTRACT
In this paper, we proposed edge-weight based method to perform a community detection in scale-free networks. Our main idea is that communities are formed from edges. We believe that in scale-free networks, each edge is not equal. Edges that connect to hub nodes are more important and should be weighted more than edges that connect to fewer nodes. Therefore, our proposed method begins with edge weight calculation based on centrality value of each edge. Then, two steps community detection algorithm performs iteratively until the community detection result is balanced. The first step of our algorithm is aimed to extract communities that node degree follows power law (scale-free). While the second step is aimed to extract communities that node degree follows normal degree distribution. The benefit is that our method can work on both scale-free and non scale-free networks. Moreover, in scale-free networks, not all communities contain hub nodes nor node degree distribution follows the power law. For scale-free approaches, this can cause errors in community detection. On the other hand, our method can handle this case correctly because our algorithm contains both scale-free and non scale-free approaches. To evaluate our method, we use NMI - Normalized Mutual Information - to measure our results on both synthetic and real-world datasets comparing with both scale-free and non scale-free community detection methods. The results show that, our method can perform almost equal or better on both scale-free and non scale-free networks.
- A.-L. L. Barabási and E. Bonabeau. Scale-free networks. Scientific American, 288(5):60--69, May 2003.Google Scholar
Cross Ref
- M. Bastian, S. Heymann, and M. Jacomy. Gephi: An open source software for exploring and manipulating networks, 2009.Google Scholar
- V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10), July 2008.Google ScholarCross Ref
- M. Boguña, R. Pastor-Satorras, A. Díaz-Guilera, and A. Arenas. Models of social networks based on social distance attachment. Phys. Rev. E, 70:056122, Nov 2004.Google ScholarCross Ref
- C. Dorso and J. Randrup. Early recognition of clusters in molecular dynamics. Physics Letters B, 301(4):328--333, 1993.Google ScholarCross Ref
- S. Fortunato. Community detection in graphs. Physics Reports 486, pages 75--174, Jan. 2010.Google Scholar
- K. Foster, S. Muth, J. Potterat, and R. Rothenberg. A Faster Katz Status Score Algorithm. Computational & Mathematical Organization Theory, 7(4):275--285, Dec. 2001. Google ScholarDigital Library
- M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America, 99(12):7821--7826, June 2002.Google ScholarCross Ref
- S. Jarukasemratana, T. Murata, and X. Liu. Community detection algorithm based on centrality and node distance in scale-free networks. In Proceedings of the 24th ACM Conference on Hypertext and Social Media, HT '13, pages 258--262, New York, NY, USA, 2013. ACM. Google ScholarDigital Library
- A. Lancichinetti and S. Fortunato. Community detection algorithms: A comparative analysis. Phys. Rev. E, 80:056117, Nov 2009.Google ScholarCross Ref
- A. Lancichinetti, S. Fortunato, and J. Kertész. Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics, 11(3), Mar. 2009.Google ScholarCross Ref
- A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 78(4), 2008.Google Scholar
- J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD '05, pages 177--187, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data, 1(1), Mar. 2007. Google ScholarDigital Library
- D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson. The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology, 54(4):396--405, 2003.Google ScholarCross Ref
- J. McAuley and J. Leskovec. Discovering Social Circles in Ego Networks, Oct. 2012.Google Scholar
- M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(2):026113+, Aug. 2003.Google Scholar
- R. Qian, W. Zhang, and B. Yang. Community detection in scale-free networks based on hypergraph model. In Proceedings of the 2007 Pacific Asia conference on Intelligence and security informatics, PAISI'07, pages 226--231, Berlin, Heidelberg, 2007. Springer-Verlag. Google ScholarDigital Library
- M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal, 6:2002, 2002. Google ScholarDigital Library
- H.-W. Shen and X.-Q. Cheng. Spectral methods for the detection of network community structure: a comparative analysis. Journal of Statistical Mechanics: Theory and Experiment, 2010(10):P10020, 2010.Google ScholarCross Ref
- X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger. Scan: a structural clustering algorithm for networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '07, pages 824--833, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. CoRR, abs/1205.6233, 2012. Google ScholarDigital Library
- W. W. Zachary. An Information Flow Model for Conict and Fission in Small Groups. Journal of Anthropological Research, 33(4):452--473, 1977.Google ScholarCross Ref
Index Terms
- Edge Weight Method for Community Detection in Scale-Free Networks
Recommendations
Community detection algorithm based on centrality and node distance in scale-free networks
HT '13: Proceedings of the 24th ACM Conference on Hypertext and Social MediaIn this paper, we present a method for detecting community structures based on centrality value and node distance. Many real world networks possess a scale-free property and this property makes community detection difficult especially on algorithms that ...
Invulnerability analysis of scale-free network and small-world network
AI2A '23: Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and AlgorithmsThis paper analyzes the invulnerability of two kinds of networks with different degrees of distribution. According to their topology, four attack strategies and two metrics were selected. The most effective attack strategy and the most appropriate ...
Software engineering and scale-free networks
Complex-network theory is a new approach in studying different types of large systems in both the physical and the abstract worlds. In this paper, we have studied two kinds of network from software engineering: the component dependence network and the ...
Comments