Abstract
In this work, we aim to study the cluster validity problem for graph data. We present a new validity index that evaluates structural characteristics of graphs in order to select the clusters that best represent the communities in a graph. Since the work of defining what constitutes cluster in a graph is rather difficult, we exploit concepts of graph theory in order to evaluate the cohesiveness and separation of nodes. More specifically, we use the concept of degeneracy, and graph density to evaluate the connectivity of nodes in and between clusters. The effectiveness of our approach is experimentally evaluated using real-world data collections.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008, P10008 (2008)
Boutin, F., Hascoet, M.: Cluster validity indices for graph partitioning. In: Proceedings of the International Conference of Information Visualisation (2004)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)
Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1, 27–64 (2007)
Halkidi, M., Batistakis, Y., Vazirgiannis, M.: On clustering validation techniques. J. Intell. Inf. Syst. 17, 107–145 (2001)
Halkidi, M., Vazirgiannis, M.: Quality assessment approaches in data mining. In: The Data Mining and Knowledge Discovery Handbook: A Complete Guide for Practitioners and Researchers. Kluwer Academic Publishers (2005)
Giatsidis, C.: Graph mining and community evaluation with degeneracy. Ph.D. thesis (2013)
Theodoridis, S., Koutroubas, K.: Pattern recognition. Academic Press, Cambridge (1999)
Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. 78, 046110 (2008)
Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2017)
Kannan, R., Vempala, S., Vetta, A.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)
Kannan, R., Vempala, S., Vetta, A.: On clusterings: good, bad and spectral. J. ACM 51(3), 497–515 (2004)
Brandes, U., Gaertler, M., Wagner, D.: Engineering graph clustering: models and experimental evaluation. J. Exp. Algorithmics 12, 1–26 (2008)
van Dongen, S.M.: Graph clustering by flow simulation. Ph.D. thesis, University of Utrecht, The Netherlands (2000)
Acknowledgment
This work has been partly supported by the University of Piraeus Research Center. I. Koutsopoulos acknowledges the support from the AUEB internal project “Original scientific publications”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Halkidi, M., Koutsopoulos, I. (2019). QGraph: A Quality Assessment Index for Graph Clustering. In: Azzopardi, L., Stein, B., Fuhr, N., Mayr, P., Hauff, C., Hiemstra, D. (eds) Advances in Information Retrieval. ECIR 2019. Lecture Notes in Computer Science(), vol 11438. Springer, Cham. https://doi.org/10.1007/978-3-030-15719-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-15719-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-15718-0
Online ISBN: 978-3-030-15719-7
eBook Packages: Computer ScienceComputer Science (R0)