Skip to main content
SpringerLink
Log in

Overlapping Attributed Graph Clustering using Mixed strategy games

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Unlike a simple network with just nodes and edges in between them, the real-world networks can contain much more, such as a set of attributes associated with every node in the network. These networks opened up a new avenue in community detection called attributed graph clustering (AGC). Furthermore, the clusters in real-world are not usually disjoint, as compared to most of the work that has been carried out in the field of AGC. This raises a need for AGC with fuzzy clusters. In this work, we try to comprehend the problem of attributed graph clustering with the help of a game-theoretic approach called dynamic cluster formation game (DCFG). To address the possibility of fuzzy clusters in a network, we model the problem of AGC as a series of coupled games involving mixed strategies, in contrast to the previous work that was primarily focused on pure strategy equilibrium. We discuss the convergence of the proposed game and the existence of Nash equilibrium at convergence. We also propose a clustering algorithm which uses a game-theoretic approach to partition a network into fuzzy clusters, giving a solution balanced in terms of topology and node attributes. We compare the the results of our work to the state-of-the-art clustering methods available in the literature.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. http://snap.stanford.edu/data/

References

  1. Bu Z, Li H, Cao J, Wang Z, Gao G (2019) Dynamic cluster formation game for attributed graph clustering. IEEE Trans Cybern 49(1):328–341

    Article  Google Scholar 

  2. Zhou Y, Cheng H, Yu J X (August 2009) Graph clustering based on structural/attribute similarities. Proc VLDB Endow 2(1):718–729. https://doi.org/10.14778/1687627.1687709

    Article  Google Scholar 

  3. Pfeiffer J J, Moreno S, La Fond T, Neville J, Gallagher B (2014) Attributed graph models: Modeling network structure with correlated attributes. In: Proceedings of the 23rd International Conference on World Wide Web. WWW ’14 . https://doi.org/10.1145/2566486.2567993. Association for Computing Machinery, New York, pp 831–842

  4. Zanghi H, Volant S, Ambroise C (2009) Clustering based on random graph model embedding vertex features. Pattern Recognit Lett 31:830–836

    Article  Google Scholar 

  5. Alvari H, Hashemi S, Hamzeh A (2011) Detecting overlapping communities in social networks by game theory and structural equivalence concept. In: Proceedings of the Third International Conference on Artificial Intelligence and Computational Intelligence - Volume Part II. AICI’11. Springer, Berlin , pp 620–630

  6. Mandala S, Kumara S, Chatterjee K (August 2014) A game-theoretic approach to graph clustering. INFORMS J Comput 26(3):629–643

    Article  MathSciNet  Google Scholar 

  7. Cheng H, Zhou Y, Yu J X (2011) Clustering large attributed graphs: A balance between structural and attribute similarities. ACM Trans Knowl Discov Data 5:12:1–12:33

    Article  Google Scholar 

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

  9. Bu Z, Cao J, Li H-J, Gao G, Tao H (June 2018) Gleam: A graph clustering framework based on potential game optimization for large-scale social networks. Knowl Inf Syst 55(3):741–770. https://doi.org/10.1007/s10115-017-1105-6

    Article  Google Scholar 

  10. Chen W, Liu Z, Sun X, Wang Y (2010) A game-theoretic framework to identify overlapping communities in social networks. Data Min Knowl Disc 21:224–240

    Article  MathSciNet  Google Scholar 

  11. Abualigah L M, Khader A T, Al-Betar M A, Hanandeh E S (2017) Unsupervised text feature selection technique based on particle swarm optimization algorithm for improving the text clustering

  12. Abualigah L M, Khader A T, Hanandeh E S (November 2018) Hybrid clustering analysis using improved krill herd algorithm. Appl Intell 48(11):4047–4071

    Article  Google Scholar 

  13. Abualigah L M, Khader A T, Hanandeh E S, Gandomi A H (November 2017) A novel hybridization strategy for krill herd algorithm applied to clustering techniques. Appl Soft Comput 60(C):423–435. https://doi.org/10.1016/j.asoc.2017.06.059

    Article  Google Scholar 

  14. Abualigah L M, Khader A T A, Hanandeh E S (2018) A combination of objective functions and hybrid krill herd algorithm for text document clustering analysis. Eng Appl Artif Intell 73: 111–125

    Article  Google Scholar 

  15. Abualigah L M, Khader A T A, Hanandeh E S (2018) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. J Comput Sci 25:456–466

    Article  Google Scholar 

  16. Li F, Qiao H, Zhang B, Xi X (2018) Discriminatively boosted image clustering with fully convolutional auto-encoders. ArXiv:1703.07980

  17. Omran M G H, Engelbrecht A, Salman A (2005) Particle swarm optimization method for image clustering. Int J Pattern Recognit Artif Intell 19:297–321

    Article  Google Scholar 

  18. Ahmadian S, Joorabloo N, Jalili M, Meghdadi M, Afsharchi M, Ren Y (2018) A temporal clustering approach for social recommender systems. In: 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp 1139–1144

  19. Ahmadian S, Afsharchi M, Meghdadi M (2019) An effective social recommendation method based on user reputation model and rating profile enhancement. J Inf Sci 45:607–642

    Article  Google Scholar 

  20. Ahmadian S, Joorabloo N, Jalili M, Ren Y, Meghdadi M, Afsharchi M (2020) A social recommender system based on reliable implicit relationships. Knowl-Based Syst 192:105371. https://doi.org/10.1016/j.knosys.2019.105371, http://www.sciencedirect.com/science/article/pii/S0950705119306239

    Article  Google Scholar 

  21. Ahmadian S, Meghdadi M, Afsharchi M (July 2018) A social recommendation method based on an adaptive neighbor selection mechanism. Inf Process Manage 54(4):707–725. https://doi.org/10.1016/j.ipm.2017.03.002

    Article  Google Scholar 

  22. Moradi P, Rezaimehr F, Ahmadian S, Jalili M (2016) A trust-aware recommender algorithm based on users overlapping community structure. In: 2016 Sixteenth International Conference on Advances in ICT for Emerging Regions (ICTer), pp 162–167

  23. Moradi P, Ahmadian S, Akhlaghian F (2015) An effective trust-based recommendation method using a novel graph clustering algorithm. Physica A: Stat Mech Appl 436:462–481. https://doi.org/10.1016/j.physa.2015.05.008, http://www.sciencedirect.com/science/article/pii/S0378437115004239

    Article  Google Scholar 

  24. Dunn J C (1973) A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. J Cybern 3(3):32–57. https://doi.org/10.1080/01969727308546046

    Article  MathSciNet  Google Scholar 

  25. Günnemann S, Boden B, Färber I, Seidl T (2013) Efficient mining of combined subspace and subgraph clusters in graphs with feature vectors. In: Pei J, Tseng V S, Cao L, Motoda H, Xu G (eds) Advances in Knowledge Discovery and Data Mining. Springer, Berlin, pp 261–275

  26. Günnemann S, Färber I, Boden B, Seidl T (2010) Subspace clustering meets dense subgraph mining: A synthesis of two paradigms. In: 2010 IEEE International Conference on Data Mining, pp 845–850

  27. Abualigah L (2018) Feature Selection and Enhanced Krill Herd Algorithm for Text. Document Clustering 12

  28. Abualigah L (2020) Multi-verse optimizer algorithm: a comprehensive survey of its results, variants, and applications. Neural Computing and Applications 03

  29. Combe D, Largeron C, Géry M, Egyed-Zsigmond E (2015) I-louvain: An attributed graph clustering method. In: IDA

  30. Zhang X, Liu H, Li Q, Wu X-M (2019) Attributed graph clustering via adaptive graph convolution, pp 4327–4333, 08

  31. He C, Liu S, Zhang L , Zheng J (2019) A fuzzy clustering based method for attributed graph partitioning. Journal of Ambient Intelligence and Humanized Computing:1–9

  32. Li Y, Sha C, Huang X, Zhang Y (2018) Community detection in attributed graphs: An embedding approach. In: AAAI

  33. Xu Z, Ke Y, Wang Y, Cheng H, Cheng J (2012) A model-based approach to attributed graph clustering. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, SIGMOD ’12. Association for Computing Machinery, , New York, pp 505–516

  34. Mukhoty B, Gupta R, Lakshmanan K, Kumar M (2020) A parameter-free affinity based clustering. Appl Intell:07

  35. Torsello A, Bulò S R, Pelillo M (2006) Grouping with asymmetric affinities: A game-theoretic perspective. 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’06), vol 1, pp 292–299

  36. Abualigah L, Diabat A (2020) A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Cluster Comput:03

  37. Abualigah LM, Hanandeh ES (2015) Applying genetic algorithms to information retrieval using vector space model. Int J Comput Sci Eng Appl 5:19–28

  38. Narayanam R, Narahari Y (2012) A game theory inspired, decentralized, local information based algorithm for community detection in social graphs. Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012), pp 1072–1075

  39. Feldman M, Lewin-Eytan L, Naor J S (May 2015) Hedonic clustering games. ACM Trans Parallel Comput 2(1). https://doi.org/10.1145/2742345

  40. McSweeney P J, Mehrotra K, Oh J C (2018) Game-theoretic framework for community detection. In: Alhajj R, Rokne J (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, pp 891–907. https://doi.org/10.1007/978-1-4939-7131-2_350

  41. Basu S, Maulik U (2015) Community detection based on strong nash stable graph partition. Soc Netw Anal Min 5:1–15

    Article  Google Scholar 

  42. Zhou L, Lü K, Yang P, Wang L, Kong B (2015) An approach for overlapping and hierarchical community detection in social networks based on coalition formation game theory. Expert Syst Appl 42:9634–9646

    Article  Google Scholar 

  43. Runkler T A, Ravindra V (2015) Fuzzy graph clustering based on non-euclidean relational fuzzy c-means. In: IFSA-EUSFLAT

  44. Banerjee A, Krumpelman C, Ghosh J, Basu S, Mooney R J (2005) Model-based overlapping clustering. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD ’05. Association for Computing Machinery, New York, pp 532–537. https://doi.org/10.1145/1081870.1081932

  45. Li H, Bu Z, Li A, Liu Z, Shi Y (2016) Fast and accurate mining the community structure: Integrating center locating and membership optimization. IEEE Trans Knowl Data Eng 28:2349–2362

    Article  Google Scholar 

  46. Reichardt J, Bornholdt S (2006) Statistical mechanics of community detection. Phys Rev E Stat Nonlinear Matter Phys 74 1 Pt 2:016110

    Article  MathSciNet  Google Scholar 

  47. Marden J R, Arslan G, Shamma J S (2005) Joint strategy fictitious play with inertia for potential games. In: Proceedings of the 44th IEEE Conference on Decision and Control, pp 6692–6697

  48. Hofbauer J, Sandholm WH (2002) On the global convergence of stochastic fictitious play. Econometrica 70(6):2265–2294

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology (BHU), Varanasi, 221005, India

    Mayank Kumar & Ruchir Gupta

Authors
  1. Mayank Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruchir Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ruchir Gupta.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, M., Gupta, R. Overlapping Attributed Graph Clustering using Mixed strategy games. Appl Intell 51, 5299–5313 (2021). https://doi.org/10.1007/s10489-020-02030-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-020-02030-6

Keywords

Search

Navigation