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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barabasi AL (2002) Linked: the new science of networks. Perseus Books
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
Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008
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
Cheng H, Yan X, Han J (2010) Mining graph patterns. Manag Min Graph Data, pp 365–392
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
Fortunato S (2009) Community detection in graphs. Phys Rep 486:75–174
Ganter B, Stumme G, Wille R (2005) Formal concept analysis, foundations and applications. Lecture notes in computer science, p 3626
Getoor L, Diehl CP (2005) Link mining: a survey. SIGKDD Explor Newsl 7:3–12
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
Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Discov 11:243–271
Kuznetsov SO, Ignatov DI (2009) Concept stability for constructing taxonomies of web-site users. Arxiv, preprint arXiv:0905.1424
Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5
Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58:1019–1031
Michelle G, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826
Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104
Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113
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
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
Scott J (2011) Social network analysis: developments, advances, and prospects. Soc Netw Anal Min 1(1):21–26
Shen H, Cheng X, Cai K (2009) Detect overlapping and hierarchical community structure in networks. Phys A Stat Mech Appl 388(8):1706–1712
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) 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 (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) Dynamiques globales et locales dans un reseau de telecommunications. CoRR, abs/1310.3138
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
Watts Duncan J (2004) The ’new’ science of networks. Ann Rev Sociol 30:243–270
West DB (2000) Introduction to graph theory, 2nd edn. Prentice Hall, Englewood Cliffs
Wu F, Huberman BA (2004) Finding communities in linear time: a physics approach. Eur Phys J B Condens Matter Complex Syst 38(2):331–338
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
Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural/attribute similarities. VLDB Endow 2(1):718–729
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Stattner, E., Collard, M. Matching of communities and frequent conceptual links. Soc. Netw. Anal. Min. 4, 197 (2014). https://doi.org/10.1007/s13278-014-0197-1
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-014-0197-1