Advertisement

Particle Competition and Cooperation for Uncovering Network Overlap Community Structure

  • Fabricio Breve
  • Liang Zhao
  • Marcos Quiles
  • Witold Pedrycz
  • Jiming Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6677)

Abstract

Identification and classification of overlap nodes in communities is an important topic in data mining. In this paper, a new graph-based (network-based) semi-supervised learning method is proposed. It is based on competition and cooperation among walking particles in the network to uncover overlap nodes, i.e., the algorithm can output continuous-valued output (soft labels), which corresponds to the levels of membership from the nodes to each of the communities. Computer simulations carried out for synthetic and real-world data sets provide a numeric quantification of the performance of the method.

Keywords

Graph-based method community detection particle competition and cooperation overlap nodes 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69, 026113 (2004)CrossRefGoogle Scholar
  2. 2.
    Newman, M.: Modularity and community structure in networks. Proceedings of the National Academy of Science of the United States of America 103, 8577–8582 (2006)CrossRefGoogle Scholar
  3. 3.
    Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Physical Review E 72, 027104 (2005)CrossRefGoogle Scholar
  4. 4.
    Reichardt, J., Bornholdt, S.: Detecting fuzzy community structures in complex networks with a potts model. Physical Review Letters 93(21), 218701 (2004)CrossRefGoogle Scholar
  5. 5.
    Danon, L., Díaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. Journal of Statistical Mechanics: Theory and Experiment 9, P09008 (2005)Google Scholar
  6. 6.
    Community detection in graphs. Physics Reports 486(3-5), 75–174 (2010)Google Scholar
  7. 7.
    Zhang, S., Wang, R.S., Zhang, X.S.: Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Physica A Statistical Mechanics and its Applications (2007)Google Scholar
  8. 8.
    Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature (7043), 814–818 (2005)CrossRefGoogle Scholar
  9. 9.
    Zhang, S., Wang, R.S., Zhang, X.S.: Uncovering fuzzy community structure in complex networks. Physical Review E 76(4), 046103 (2007)CrossRefGoogle Scholar
  10. 10.
    Quiles, M.G., Zhao, L., Alonso, R.L., Romero, R.A.F.: Particle competition for complex network community detection. Chaos 18(3), 033107 (2008)CrossRefzbMATHGoogle Scholar
  11. 11.
    Duin, R., Juszczak, P., Paclik, P., Pekalska, E., de Ridder, D., Tax, D., Verzakov, S.: Prtools4.1, a matlab toolbox for pattern recognitionGoogle Scholar
  12. 12.
    Zachary, W.W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Fabricio Breve
    • 1
  • Liang Zhao
    • 1
  • Marcos Quiles
    • 2
  • Witold Pedrycz
    • 3
    • 4
  • Jiming Liu
    • 5
  1. 1.Department of Computation, Institute of Mathematics and Computer ScienceUniversity of São PauloSão CarlosBrazil
  2. 2.Department of Science and TechnologyFederal University of São PauloSão José dos CamposBrazil
  3. 3.Department of Electrical and Computer EngineeringUniversity of AlbertaEdmontonCanada
  4. 4.Systems Research InstitutePolish Academy of SciencesWarsawPoland
  5. 5.Computer Science DepartmentHong Kong Baptist UniversityKowloonHong Kong

Personalised recommendations