Abstract
We propose an approach to quantify the extent to which vertices in a complex network are clusterable on the basis of the similarity of the values with respect to two or more node-level metrics. We use the Hopkins Statistic to assess the clusterability and consider the centrality metrics as the node-level metrics. Our approach is to construct a logical topology of the vertices in the complex network using the normalized values of the centrality metrics as coordinates and determine the Hopkins Statistic for such a logical topology of the vertices. Our hypothesis is that if two or more vertices in a complex network have similar values for the centrality metrics, then the vertices should be clusterable to one or more clusters due to their proximity to each other in the normalized centrality-based coordinate system. The value for the Hopkins Statistic measure (ranges from 0 to 1) for such a logical topology of the vertices should be high, and vice-versa. We evaluate the Hopkins Statistic for 47 real-world complex networks (of diverse degree distributions) with respect to the neighborhood-based and shortest path-based centrality metrics. We observe the neighborhood centrality-based logical topologies of the vertices to incur relatively larger Hopkins Statistic values (i.e., exhibit higher similarity-based clusterability) for a majority of the networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Grando, F., Noble, D., Lamb, L.C.: An analysis of centrality measures for complex and social networks. In: Proceedings of IEEE Global Communications Conference, pp. 1–6, Washington, DC, USA (Dec 2016)
Meghanathan, N.: On the use of centrality measures to determine connected dominating sets for mobile ad hoc networks. Int. J. Ad Hoc Ubiquitous Comput. 26(4), 205–221 (2017)
Ozgur, A., Vu, T., Erkan, G., Radev, D.R.: Identifying gene-disease associations using centrality on a literature mined gene-interaction network. Bioinformatics. 24(13), 277–285 (2008)
Ding, Y.: Scientific collaboration and endorsement: network analysis of coauthorship and citation networks. J. Informet. 5(1), 187–203 (2011)
Eslami, M., Zheng, G., Eramian, H., Levchuk, G.: Anomaly detection on bipartite graphs for cyber situational awareness and threat detection. In: Proceedings of the 2017 IEEE International Conference on Big Data, pp. 4741–4743. Boston, MA, USA (Dec 2017)
Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170–1182 (1987)
Freeman, L.: A set of measures of centrality based on betweenness. Sociometry. 40(1), 35–41 (1977)
Freeman, L.: Centrality in social networks: conceptual clarification. Soc. Networks. 1(3), 215–239 (1979)
Huang, J., Sun, H., Han, J., Deng, H., Sun, Y., Liu, Y.: SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 219–228, Toronto, Canada (Oct 2010)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U. S. A. 99(12), 7821–7826 (June 2002)
Banerjee, A., Dave, R.: Validating clusters using the hopkins statistic. In: Proceedings of the IEEE International Conference on Fuzzy Systems, pp. 149–153, Budapest, Hungary (July 2004)
Szabo, G., Alava, M., Kertesz, J.: Clustering in complex networks. Complex Networks, Lect. Notes Phys. 650(1), 139–162 (2004)
Soler, J., Tence, F., Gaubert, L., Buche, C.: Data clustering and similarity. In: Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference, pp. 492–495, St. Pete Beach, FL, USA (May 2013)
Aalam, P., Siddique, T.: Comparative study of data mining tools used for clustering. In: Proceedings of the 3rd International Conference on Computing for Sustainable Global Development, pp. 3971–3975, New Delhi, India (Mar 2016)
Meghanathan, N.: Randomness index for complex network analysis. Soc. Netw. Anal. Min. 7(25), 1–15 (2017)
Meghanathan, N.: Spectral radius as a measure of variation in node degree for complex network graphs. In: Proceedings of the 3rd International Conference on Digital Contents and Applications, pp. 30–33, Hainan, China (Dec 2014)
Taghva, K., Veni, R.: Effects of similarity metrics on document clustering. In: Proceedings of the 7th International Conference on Information Technology: New Generations, pp. 222–226, Las Vegas, NV (2010)
Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan and Kaufmann Publishers, Burlington, MA (July 2011)
Blooma, M.J., Chua, A.Y.K., Goh, D.H.: Quadripartite graph-based clustering of questions. In: Proceedings of the 8th International Conference on Information Technology: New Generations, pp. 591–596, Las Vegas, NV (2011)
Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538–543, Edmonton, Alberta, Canada (July 2002)
Yu, W., Lin, X., Zhang, W., Chang, L., Pei, J.: More is simpler: effectively and efficiently assessing node-pair similarities based on hyperlinks. Proc. VLDB Endowment. 7(1), 13–24 (Sept 2013)
Acknowledgements
This research was funded by the NASA EPSCoR subaward #: NNX14AN38A from the University of Mississippi; the NSF MRI Grant 13-38192 and NSF CNS Grant 14-56638.
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
Rahman, M.A., Meghanathan, N. (2019). Analyzing the Similarity-Based Clusterability of the Vertices in a Complex Network. In: Latifi, S. (eds) 16th International Conference on Information Technology-New Generations (ITNG 2019). Advances in Intelligent Systems and Computing, vol 800. Springer, Cham. https://doi.org/10.1007/978-3-030-14070-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-030-14070-0_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14069-4
Online ISBN: 978-3-030-14070-0
eBook Packages: EngineeringEngineering (R0)