Skip to main content

2012 | OriginalPaper | Buchkapitel

Analysis of Network Data Based on Probability Neighborhood Cliques

verfasst von : Andreas Baumgart, Ulrich Müller-Funk

Erschienen in: Challenges at the Interface of Data Analysis, Computer Science, and Optimization

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The authors present the concept of a “probability neighborhood clique” intended to substantiate the idea of a “community”, i.e. of a dense subregion within a (simple) network. For that purpose the notion of a clique is generalized in a probabilistic way. The probability neighborhoods employed for that purpose are indexed by one or two tuning parameters to bring out the “degree of denseness” respectively a hierarchy within that community. The paper, moreover, reviews other degree based concepts of communities and addresses algorithmic aspects.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: LATIN ’02: Proceedings of the 5th Latin American Symposium on Theoretical Informatics, Springer, London, UK, pp 598–612 Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: LATIN ’02: Proceedings of the 5th Latin American Symposium on Theoretical Informatics, Springer, London, UK, pp 598–612
Zurück zum Zitat Dhillon I, Guan Y, Kulis B (2005) A unified view of kernel k-means, spectral clustering and graph cuts. Tech. rep., UTCS Technical Report No. TR-04-25 Dhillon I, Guan Y, Kulis B (2005) A unified view of kernel k-means, spectral clustering and graph cuts. Tech. rep., UTCS Technical Report No. TR-04-25
Zurück zum Zitat Haraguchi M, Okubo Y (2006) A method for pinpoint clustering of web pages with pseudo-clique search. In: Jantke K, Lunzer A, Spyratos N, Tanaka Y (eds) Federation over the Web, Lecture Notes in Computer Science, vol 3847. Springer, Berlin/Heidelberg, pp 59–78, DOI10.1007/11605126_4, http://dx.doi.org/10.1007/11605126\_4 Haraguchi M, Okubo Y (2006) A method for pinpoint clustering of web pages with pseudo-clique search. In: Jantke K, Lunzer A, Spyratos N, Tanaka Y (eds) Federation over the Web, Lecture Notes in Computer Science, vol 3847. Springer, Berlin/Heidelberg, pp 59–78, DOI10.1007/11605126_4, http://​dx.​doi.​org/​10.​1007/​11605126\_​4
Zurück zum Zitat Kolaczyk ED (2009) Statistical analysis of network data: methods and models, 1st edn. Springer, New York, DOI10.1007/978-0-387-88146-1 Kolaczyk ED (2009) Statistical analysis of network data: methods and models, 1st edn. Springer, New York, DOI10.1007/978-0-387-88146-1
Zurück zum Zitat Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066,133, DOI10.1103/PhysRevE.69.066133, arXiv:cond-mat/0309508 Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066,133, DOI10.1103/PhysRevE.69.066133, arXiv:cond-mat/0309508
Zurück zum Zitat Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103(23):8577–8582, DOI10.1073/pnas.0601602103 Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103(23):8577–8582, DOI10.1073/pnas.0601602103
Zurück zum Zitat Newman MEJ (2010) Networks: An introduction, 1st edn. Oxford University Press, USAMATH Newman MEJ (2010) Networks: An introduction, 1st edn. Oxford University Press, USAMATH
Zurück zum Zitat Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026,113, DOI10.1103/PhysRevE.69.026113 Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026,113, DOI10.1103/PhysRevE.69.026113
Zurück zum Zitat Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814–818, DOI10.1038/nature03607 Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814–818, DOI10.1038/nature03607
Zurück zum Zitat Pavan M, Pelillo M (2003) A new graph-theoretic approach to clustering and segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol 1, pp 145–152 Pavan M, Pelillo M (2003) A new graph-theoretic approach to clustering and segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol 1, pp 145–152
Zurück zum Zitat Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473 Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473
Zurück zum Zitat Zeng Z, Wang J, Zhou L, Karypis G (2006) Coherent closed quasi-clique discovery from large dense graph databases. In: KDD ’06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, New York, NY, USA, pp 797–802, DOI10.1145/1150402.1150506, http://doi.acm.org/10.1145/1150402.1150506 Zeng Z, Wang J, Zhou L, Karypis G (2006) Coherent closed quasi-clique discovery from large dense graph databases. In: KDD ’06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, New York, NY, USA, pp 797–802, DOI10.1145/1150402.1150506, http://​doi.​acm.​org/​10.​1145/​1150402.​1150506
Metadaten
Titel
Analysis of Network Data Based on Probability Neighborhood Cliques
verfasst von
Andreas Baumgart
Ulrich Müller-Funk
Copyright-Jahr
2012
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-24466-7_22