A Game-Theoretic Approach to Graph Clustering

Published Online:https://doi.org/10.1287/ijoc.2013.0588

References

  • Brown GW (1951) Iterative solution of games by fictitious play. Activity Anal. Production Allocation 13(1):374–376.Google Scholar
  • Bulò SR, Pelillo M (2009) A generalization of the Motzkin-Straus theorem to hypergraphs. Optim. Lett. 3(2):287–295.CrossrefGoogle Scholar
  • Carlos A-F, Netzer N (2010) The logit-response dynamics. Games Econom. Behav. 68(2):413–427.CrossrefGoogle Scholar
  • Chakraborty A, Duncan JS (1999) Game-theoretic integration for image segmentation. IEEE Trans. Pattern Anal. Machine Intelligence 21(1):12–30.CrossrefGoogle Scholar
  • Chen W, Liu Z, Sun X, Wang Y (2010a) A game-theoretic framework to identify overlapping communities in social networks. Data Mining Knowledge Discovery 21(2):224–240.CrossrefGoogle Scholar
  • Chen D, Shang M, Lv Z, Fu Y (2010b) Detecting overlapping communities of weighted networks via a local algorithm. Physica A: Statist. Mech. Its Appl. 389(19):4177–4187.CrossrefGoogle Scholar
  • Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41.CrossrefGoogle Scholar
  • Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12):7821–7826.CrossrefGoogle Scholar
  • Gregory S (2007) An algorithm to find overlapping community structure in networks. Kok JN, Koronacki J, Lopez de Mantaras R, Matwin S, Mladenič D, Skowron A, eds. Knowledge Discovery Databases (PKDD 2007), Lecture Notes in Computer Science, Vol. 4702 (Springer-Verlag, Berlin), 91–102.CrossrefGoogle Scholar
  • Gregory S (2008) A fast algorithm to find overlapping communities in networks. Daelemans W, Goethals B, Morik K, eds. Machine Learn. Knowledge Discovery Databases, Lecture Notes in Computer Science, Vol. 5211 (Springer-Verlag, Berlin), 408–423.CrossrefGoogle Scholar
  • Gregory S (2010) Finding overlapping communities in networks by label propagation. New J. Phys 12(10):103018.CrossrefGoogle Scholar
  • Kurucz M, Benczúr A, Csalogány K, Lukács L (2007) Spectral clustering in telephone call graphs. Joint 9th WebKDD and 1st SNA-KDD Workshop '07 (ACM, New York), 82–91.CrossrefGoogle Scholar
  • Lancichinetti A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1):016118.CrossrefGoogle Scholar
  • Lancichinetti A, Fortunato S, Kertész J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3):033015.CrossrefGoogle Scholar
  • Lancichinetti A, Kivelä M, Saramäki J, Fortunato S (2010) Characterizing the community structure of complex networks. PLoS ONE 5(8):e11976.CrossrefGoogle Scholar
  • Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S (2011) Finding statistically significant communities in networks. PLoS ONE 6(4):e18961.CrossrefGoogle Scholar
  • Li X, Liu B, Yu P (2006) Discovering overlapping communities of named entities. Fürnkranz J, Scheffer T, Spiliopoulou M, eds. Knowledge Discovery Databases (PKDD 2006), Lecture Notes in Computer Science, Vol. 4213 (Springer-Verlag, Berlin),593–600.CrossrefGoogle Scholar
  • Matsuda H, Ishihara T, Hashimoto A (1999) Classifying molecular sequences using a linkage graph with their pairwise similarities. Theoret. Comput. Sci. 210(2):305–325.CrossrefGoogle Scholar
  • Monderer D, Shapley LS (1996) Potential games. Games Econom. Behav. 14(1):124–143.CrossrefGoogle Scholar
  • Nelson DL, McEvoy CL, Schreiber TA (1998) The University of South Florida word association, rhyme, and word fragment norms. Accessed August 1, 2011, http://www.usf.edu/FreeAssociation.Google Scholar
  • Nepusz T, Petroczi A, Negyessy L, Bazso F (2008) Fuzzy communities and the concept of bridgeness in complex networks. Phys. Rev. E 77(1):016107.CrossrefGoogle Scholar
  • Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys. Rev. E 69(2):16.CrossrefGoogle Scholar
  • Nisan N, Roughgarden T, Tardos E (2007) Algorithmic Game Theory (Cambridge University Press, New York).CrossrefGoogle Scholar
  • Onnela JP, Kaski K, Kertesz J (2004) Clustering and information in correlation-based financial networks. Eur. Phys. J. B 38(2):353–362.CrossrefGoogle Scholar
  • Palla G, Derenyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814–818.CrossrefGoogle Scholar
  • Palla G, Farkas IJ, Pollner P, Derényi I, Vicsek T (2007) Directed network modules. New J. Phys. 9(6):186–206.CrossrefGoogle Scholar
  • Pelillo M (2009) What is a cluster? Perspectives from game theory. Neural Inform. Processing Systems Conf. Workshop (NIPS 2009), (Curran Associates, Red Hook, NY), 1–4.Google Scholar
  • Pinney DR, Westhead JW (2006) Betweenness-based decomposition methods for social and biological networks. Baxter PD, Mardia KV, Walls RE, Barber S, eds. Interdisciplinary Statist. Bioinformatics: Proc. (Leeds University Press, Leeds, UK), 87–90.Google Scholar
  • Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3):036106.CrossrefGoogle Scholar
  • Rosenthal RW (1973) A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2(1):65–67.CrossrefGoogle Scholar
  • Santo F (2010) Community detection in graphs. Phys. Rep. 486(3): 75–174.Google Scholar
  • Sastry PS, Phansalkar VV, Thathachar MAL (1994) Decentralized learning of Nash equilibria in multi-person stochastic games with incomplete information. IEEE Trans. Systems Man Cybernetics 24(5):769–777.CrossrefGoogle Scholar
  • Shen H-W, Cheng X-Q, Guo J-F (2009a) Quantifying and identifying the overlapping community structure in networks. J. Statist. Mech. 2009(7):P07042.CrossrefGoogle Scholar
  • Shen H, Cheng X, Cai K, Hu M-B (2009b) Detect overlapping and hierarchical community structure. Physica A: Statist. Mech. Its Appl. 388(8):1706–1712.CrossrefGoogle Scholar
  • Torsello A, Bulo SR, Pelillo M (2006) Grouping with asymmetric affinities: A game theoretic perspective. CVPR '06 Proc. IEEE Comput. Soc. Conf. Comput. Vision Pattern Recognition, Vol. 1 (IEEE Computer Society, Washington, DC), 292–299.CrossrefGoogle Scholar
  • Torsello A, Bulò SR, Pelillo M (2008) Beyond partitions: Allowing overlapping groups in pairwise clustering. Borgefors G, Flynn P, eds. Proc. 19th Internat. Conf. Pattern Recognition (IEEE Computer Society, Washington, DC), 1–4.CrossrefGoogle Scholar
  • Wei F, Ma L, Zhou A (2008) Detecting overlapping community structures in networks with global partition and local expansion. Zhang Y, Yu G, Bertino E, Xu G, eds. Progress WWW Res. Development (APWeb 2008), Lecture Notes in Computer Science, Vol. 4976 (Springer-Verlag, Berlin), 43–55.CrossrefGoogle Scholar
  • Xie J, Szymanski BK (2011) Community detection using a neighborhood strength driven label propagation algorithm. CoRR (May). http://dblp.uni-trier.de/db/journals/corr/corr1105.html#abs-1105-3264.Google Scholar
  • Xie J, Szymanski BK, Liu X (2011) Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. Spiliopoulou M, Wang H, Cook DJ, Pei J, Wang W, Zaiane OR, Wu X, eds. Proc. 2011 IEEE 11th Internat. Conf. Data Mining Workshops (ICDMW '11) (IEEE Computer Society, Washington, DC), 344–349.CrossrefGoogle Scholar
  • Zhang S, Wang RS, Zhang XS (2007) Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Physica A: Statist. Mech. Its Appl. 374(1):483–490.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.