Glossary
- ARI (adjusted rand index):
-
Measures similarity of two clusterings based on pair counts
- Community Structure:
-
Clustering structure underlying a network which models regions of densely connected nodes
- External Evaluation:
-
Compares a clustering against the ground-truth clustering
- Internal Evaluation:
-
Matches a clustering with the structure of data
- Network:
-
A graph of interconnected nodes which models relationships in data
- NMI (normalized mutual information):
-
Measures similarity of two clusterings
- Relative Evaluation:
-
Ranks different clusterings of the same dataset
Definition
Grouping data points is one of the fundamental tasks in data mining, which is commonly known as clustering if data points are described by attributes. When dealing with interrelated data, data represented in the form of nodes and their relationships and...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Calinski T, Harabasz J (1974) A dendrite method for cluster analysis. Commun Stat Theory Methods 3:1–27
Dalrymple-Alford EC (1970) Measurement of clustering in free recall. Psychol Bull 74:32–34
Danon L, Guilera AD, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech Theory Exp 2005(09):09008
Davies DL, Bouldin DW (1979) A cluster separation measure. IEEE Trans Pattern Anal Mach Intell 1(2):224–227
Dunn JC (1974) Well-separated clusters and optimal fuzzy partitions. J Cybern 4(1):95–104
Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174
Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36–41
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826
Hubert L, Arabie P (1985) Comparing partitions. J Classif 2:193–218
Hubert LJ, Levin JR (1976) A general statistical framework for assessing categorical clustering in free recall. Psychol Bull 83:1072–1080
Jaccard P (1901) Étude comparative de la distribution florale dans une portion des alpes et des jura. Bulletin del la Société Vaudoise des Sciences Naturelles 37:547–579
Kenley EC, Cho YR (2011) Entropy-based graph clustering: application to biological and social networks. In: IEEE international conference on data mining, Vancouver
Krebs V (2004) Books about US politics. http://www.orgnet.com/
Kvalseth TO (1987) Entropy and correlation: some comments. IEEE Trans Syst Man Cybern 17(3):517–519. https://doi.org/10.1109/TSMC.1987.4309069
Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80(5):056117
Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110
Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: ACM SIGKDD international conference on knowledge discovery in data mining, Chicago, pp 177–187
Milligan G, Cooper M (1985) An examination of procedures for determining the number of clusters in a data set. Psychometrika 50(2):159–179
Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582
Newman M (2010) Networks: an Introduction. Oxford University Press, New York
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113
Nooy W, Mrvar A, Batagelj V (2004) Exploratory social network analysis with Pajek. Cambridge University Press, Cambridge
Orman GK, Labatut V, Cherifi H (2011) Qualitative comparison of community detection algorithms. In: International conference on digital information and communication technology and its applications, Dijon 167, pp 265–279
Pakhira M, Dutta A (2011) Computing approximate value of the PBM index for counting number of clusters using genetic algorithm. In: International conference on recent trends in information systems, Kolkata, pp 241–245
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
Rabbany R (2016) Modular structure of complex networks. PhD thesis, University of Alberta. http://hdl.handle.net/10402/era.43464
Rabbany R, Zaïane OR (2011) A diffusion of innovation-based closeness measure for network associations. In: IEEE international conference on data mining workshops, Vancouver, pp 381–388
Rabbany R, Zaïane OR (2015) Generalization of clustering agreements and distances for overlapping clusters and network communities. Data Min Knowl Disc 29(5):1458–1485
Rabbany R, Chen J, Zaïane OR (2010) Top leaders community detection approach in information networks. In: SNA-KDD workshop on social network mining and analysis, Washington, DC
Rabbany R, Takaffoli M, Fagnan J, Zaïane OR (2013) Communities validity: methodical evaluation of community mining algorithms. Soc Netw Anal Min 3(4):1039–1062
Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123
Rousseeuw P (1987) Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20(1):53–65
Vendramin L, Campello RJGB, Hruschka ER (2010) Relative clustering validity criteria: a comparative overview. Stat Anal Data Min 3(4):209–235
Vinh NX, Epps J, Bailey J (2010) Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J Mach Learn Res 11:2837–2854
Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473
Acknowledgments
The authors are grateful for the support from Alberta Innovates Centre for Machine Learning and NSERC. Ricardo Campello also acknowledges the financial support of Fapesp and CNPq.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media LLC, part of Springer Nature
About this entry
Cite this entry
Rabbany, R., Takaffoli, M., Fagnan, J., Zaïane, O.R., Campello, R. (2018). Relative Validity Criteria for Community Mining Algorithms. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-7131-2_356
Download citation
DOI: https://doi.org/10.1007/978-1-4939-7131-2_356
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-7130-5
Online ISBN: 978-1-4939-7131-2
eBook Packages: Computer ScienceReference Module Computer Science and Engineering