Skip to main content

A One-by-One Method for Community Detection in Attributed Networks

  • Conference paper
  • First Online:
Intelligent Data Engineering and Automated Learning – IDEAL 2020 (IDEAL 2020)

Abstract

The problem of community detection in a network with features at its nodes takes into account both the graph structure and node features. The goal is to find relatively dense groups of interconnected entities sharing some features in common. We apply the so-called data recovery approach to the problem by combining the least-squares recovery criteria for both, the graph structure and node features. In this way, we obtain a new clustering criterion and a corresponding algorithm for finding clusters/communities one-by-one. We show that our proposed method is effective on real-world data, as well as on synthetic data involving either only quantitative features or only categorical attributes or both. Our algorithm appears competitive against state-of-the-art algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bojchevski, A., Günnemann, S.: Bayesian robust attributed graph clustering: joint learning of Partial anomalies and group structure. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)

    Google Scholar 

  2. Chiang, M.M.T., Mirkin, B.: Intelligent choice of the number of clusters in k-means clustering: an experimental study with different cluster spreads. J. Classif. 27(1), 3–40 (2010). https://doi.org/10.1007/s00357-010-9049-5

    Article  MathSciNet  MATH  Google Scholar 

  3. Chunaev, P.: Community detection in node-attributed social networks: a survey, arXiv preprint arXiv:1912.09816 (2019)

  4. Cross, R.L., Parker, A.: The Hidden Power of Social Networks: Understanding How Work Really Gets Done in Organizations. Harvard Business Press, Boston (2004)

    Google Scholar 

  5. Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193–218 (1985)

    Article  Google Scholar 

  6. Interdonato, R., Atzmueller, M., Gaito, S., Kanawati, R., Largeron, C., Sala, A.: Feature-rich networks: going beyond complex network topologies. Appl. Netw. Sci. 4, 1–13 (2019)

    Article  Google Scholar 

  7. Larremore, D.B., Clauset, A., Buckee, C.O.: A network approach to analyzing highly recombinant malaria parasite genes. PLoS Comput. Biol. 9(10), e1003268 (2013)

    Article  Google Scholar 

  8. Lazega, E.: The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership. Oxford University Press, Oxford (2001)

    Book  Google Scholar 

  9. Leskovec, J., Sosič, R.: SNAP: a general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol. (TIST) 8(1), 1–20 (2016). CESNA on Github. https://github.com/snap-stanford/snap/tree/master/examples/cesna

    Article  Google Scholar 

  10. Mirkin, B., Nascimento, S.: Additive spectral method for fuzzy cluster analysis of similarity data including community structure and affinity matrices. Inf. Sci. 183(1), 16–34 (2012)

    Article  Google Scholar 

  11. Mirkin, B.: Clustering: A Data Recovery Approach. CRC Press, Boca Raton (1st edn, 2005; 2dn edn, 2012)

    Google Scholar 

  12. Nature Communications. https://www.nature.com/articles/ncomms11863

  13. Newman, M.E.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)

    Article  Google Scholar 

  14. Newman, M.E., Clauset, A.: Structure and inference in annotated networks. Nat. Commun. 7, 11863 (2016)

    Article  Google Scholar 

  15. De Nooy, W., Mrvar, A., Batagelj, V.: Exploratory Social Network Analysis with Pajek (Chapter 2). Cambridge University Press, Cambridge (2004)

    Google Scholar 

  16. Snijders, T.: The Siena webpage. https://www.stats.ox.ac.uk/snijders/siena/Lazega_lawyers_data.htm

  17. Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: 2013 IEEE 13th International Conference on Data Mining, pp. 1151–1156. IEEE (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Soroosh Shalileh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shalileh, S., Mirkin, B. (2020). A One-by-One Method for Community Detection in Attributed Networks. In: Analide, C., Novais, P., Camacho, D., Yin, H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2020. IDEAL 2020. Lecture Notes in Computer Science(), vol 12490. Springer, Cham. https://doi.org/10.1007/978-3-030-62365-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-62365-4_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-62364-7

  • Online ISBN: 978-3-030-62365-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics