Skip to main content
Erschienen in: Social Network Analysis and Mining 1/2014

01.12.2014 | Original Article

Matching of communities and frequent conceptual links

A comparative analysis of two network clustering approaches

verfasst von: Erick Stattner, Martine Collard

Erschienen in: Social Network Analysis and Mining | Ausgabe 1/2014

Einloggen

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

search-config
loading …

Abstract

The search for frequent conceptual links (FCL) is a new network clustering approach that exploits both the network structure and the node properties. While recent works have been focused on the optimisation of the FCL extraction, no study has been conducted on the matching or the intersections between the conceptual links and the classical clustering approach which consists in extracting communities. In this paper, we focus on these two approaches. Our objective is to evaluate the possible relationships existing between FCL and communities to understand how the patterns obtained by each kind of methods may match as well as the useful knowledge resulting from the intersections of these two kinds of knowledge. For this purpose, we propose a set of original measures, based on the notion of homogeneity, assessing the level of shared information between these patterns when they are extracted from the same dataset. The measures are applied on three datasets and demonstrate the importance of considering simultaneously various kinds of knowledge and their intersections.

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 "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!

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!

Literatur
Zurück zum Zitat Barabasi AL (2002) Linked: the new science of networks. Perseus Books Barabasi AL (2002) Linked: the new science of networks. Perseus Books
Zurück zum Zitat Barrett CL, Bisset KR, Eubank SG, Feng X, Marathe MV (2008) Episimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks. In: Proceedings of the 2008 ACM/IEEE conference on supercomputing Barrett CL, Bisset KR, Eubank SG, Feng X, Marathe MV (2008) Episimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks. In: Proceedings of the 2008 ACM/IEEE conference on supercomputing
Zurück zum Zitat Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008CrossRef Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008CrossRef
Zurück zum Zitat Borner K, Sanyal S, Vespignani A (2007) Network science. In: Cronin B (ed) Annual Review of Information Science and Technology vol 41, pp 537–607 Borner K, Sanyal S, Vespignani A (2007) Network science. In: Cronin B (ed) Annual Review of Information Science and Technology vol 41, pp 537–607
Zurück zum Zitat Cheng H, Yan X, Han J (2010) Mining graph patterns. Manag Min Graph Data, pp 365–392 Cheng H, Yan X, Han J (2010) Mining graph patterns. Manag Min Graph Data, pp 365–392
Zurück zum Zitat Cruz JD, Bothorel C (2013) Information integration for detecting communities in attributed graphs. In: Computational aspects of social networks (CASoN), IEEE fifth international conference on 2013, pp 62–67 Cruz JD, Bothorel C (2013) Information integration for detecting communities in attributed graphs. In: Computational aspects of social networks (CASoN), IEEE fifth international conference on 2013, pp 62–67
Zurück zum Zitat Ganter B, Stumme G, Wille R (2005) Formal concept analysis, foundations and applications. Lecture notes in computer science, p 3626 Ganter B, Stumme G, Wille R (2005) Formal concept analysis, foundations and applications. Lecture notes in computer science, p 3626
Zurück zum Zitat Getoor L, Diehl CP (2005) Link mining: a survey. SIGKDD Explor Newsl 7:3–12CrossRef Getoor L, Diehl CP (2005) Link mining: a survey. SIGKDD Explor Newsl 7:3–12CrossRef
Zurück zum Zitat Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: 4th European conference on principles of data mining and knowledge discovery, pp 13–23 Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: 4th European conference on principles of data mining and knowledge discovery, pp 13–23
Zurück zum Zitat Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Discov 11:243–271CrossRefMathSciNet Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Discov 11:243–271CrossRefMathSciNet
Zurück zum Zitat Kuznetsov SO, Ignatov DI (2009) Concept stability for constructing taxonomies of web-site users. Arxiv, preprint arXiv:0905.1424 Kuznetsov SO, Ignatov DI (2009) Concept stability for constructing taxonomies of web-site users. Arxiv, preprint arXiv:​0905.​1424
Zurück zum Zitat Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5CrossRef Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5CrossRef
Zurück zum Zitat Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58:1019–1031CrossRef Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58:1019–1031CrossRef
Zurück zum Zitat Michelle G, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826CrossRefMathSciNet Michelle G, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826CrossRefMathSciNet
Zurück zum Zitat Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104CrossRefMathSciNet Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104CrossRefMathSciNet
Zurück zum Zitat Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582CrossRef Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582CrossRef
Zurück zum Zitat Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113CrossRef Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113CrossRef
Zurück zum Zitat Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: Computer and Information Sciences-ISCIS 2005. Springer, Berlin, pp 284–293 Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: Computer and Information Sciences-ISCIS 2005. Springer, Berlin, pp 284–293
Zurück zum Zitat Rattigan MR, Maier M, Jensen D (2007) Graph clustering with network structure indices. In: Proceedings of the 24th international conference on machine learning, ACM, pp 783–790 Rattigan MR, Maier M, Jensen D (2007) Graph clustering with network structure indices. In: Proceedings of the 24th international conference on machine learning, ACM, pp 783–790
Zurück zum Zitat Scott J (2011) Social network analysis: developments, advances, and prospects. Soc Netw Anal Min 1(1):21–26CrossRef Scott J (2011) Social network analysis: developments, advances, and prospects. Soc Netw Anal Min 1(1):21–26CrossRef
Zurück zum Zitat Shen H, Cheng X, Cai K (2009) Detect overlapping and hierarchical community structure in networks. Phys A Stat Mech Appl 388(8):1706–1712CrossRef Shen H, Cheng X, Cai K (2009) Detect overlapping and hierarchical community structure in networks. Phys A Stat Mech Appl 388(8):1706–1712CrossRef
Zurück zum Zitat Stattner E, Collard M (2012) Flmin: an approach for mining frequent links in social networks. In: International conference on networked digital technologies Stattner E, Collard M (2012) Flmin: an approach for mining frequent links in social networks. In: International conference on networked digital technologies
Zurück zum Zitat Stattner E, Collard M (2012) Social-based conceptual links: conceptual analysis applied to social networks. In: International conference on advances in social networks analysis and mining Stattner E, Collard M (2012) Social-based conceptual links: conceptual analysis applied to social networks. In: International conference on advances in social networks analysis and mining
Zurück zum Zitat Stattner E, Collard M (2013) Towards a hybrid algorithm for extracting maximal frequent conceptual links in social networks. In: IEEE international conference on research challenges in information, science, pp 1–8 Stattner E, Collard M (2013) Towards a hybrid algorithm for extracting maximal frequent conceptual links in social networks. In: IEEE international conference on research challenges in information, science, pp 1–8
Zurück zum Zitat Stattner E, Collard M (2013) Dynamiques globales et locales dans un reseau de telecommunications. CoRR, abs/1310.3138 Stattner E, Collard M (2013) Dynamiques globales et locales dans un reseau de telecommunications. CoRR, abs/1310.3138
Zurück zum Zitat Tian Y, Hankins RA, Patel JM (2008) Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, ACM, pp 567–580 Tian Y, Hankins RA, Patel JM (2008) Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, ACM, pp 567–580
Zurück zum Zitat Watts Duncan J (2004) The ’new’ science of networks. Ann Rev Sociol 30:243–270CrossRef Watts Duncan J (2004) The ’new’ science of networks. Ann Rev Sociol 30:243–270CrossRef
Zurück zum Zitat West DB (2000) Introduction to graph theory, 2nd edn. Prentice Hall, Englewood Cliffs West DB (2000) Introduction to graph theory, 2nd edn. Prentice Hall, Englewood Cliffs
Zurück zum Zitat Wu F, Huberman BA (2004) Finding communities in linear time: a physics approach. Eur Phys J B Condens Matter Complex Syst 38(2):331–338CrossRef Wu F, Huberman BA (2004) Finding communities in linear time: a physics approach. Eur Phys J B Condens Matter Complex Syst 38(2):331–338CrossRef
Zurück zum Zitat Yoon SH, Song SS, Kim SW (2011) Efficient link-based clustering in a large scaled blog network. In: Proceedings of the 5th International Conference on ubiquitous information management and communication, ICUIMC ’11, ACM, New York, pp 71:1–71:5 Yoon SH, Song SS, Kim SW (2011) Efficient link-based clustering in a large scaled blog network. In: Proceedings of the 5th International Conference on ubiquitous information management and communication, ICUIMC ’11, ACM, New York, pp 71:1–71:5
Zurück zum Zitat Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural/attribute similarities. VLDB Endow 2(1):718–729CrossRef Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural/attribute similarities. VLDB Endow 2(1):718–729CrossRef
Metadaten
Titel
Matching of communities and frequent conceptual links
A comparative analysis of two network clustering approaches
verfasst von
Erick Stattner
Martine Collard
Publikationsdatum
01.12.2014
Verlag
Springer Vienna
Erschienen in
Social Network Analysis and Mining / Ausgabe 1/2014
Print ISSN: 1869-5450
Elektronische ISSN: 1869-5469
DOI
https://doi.org/10.1007/s13278-014-0197-1

Weitere Artikel der Ausgabe 1/2014

Social Network Analysis and Mining 1/2014 Zur Ausgabe

Premium Partner