Abstract
Clustering is a process of finding groups of similar objects in a given dataset. Finding clusters in graphs, especially crisp clusters, which have minimal or no overlapping clusters, is challenging. Further, clustering is an ill-defined problem, resulting in multiple possible solutions for the same dataset. Hence, a challenge here is that the possible number of crisp clusters that can be found for a given graph will not be unique. Finding different crisp clusters is useful for modelling patterns or cluster-based prediction tasks. The visual assessment of the clustering tendency (VAT) algorithm, in particular the SpecieVAT algorithm, has been used in the past to identify the number of clusters, i.e., the cluster tendencies, that exist in a graph. These algorithms generate an image of the reordered dissimilarity matrix, and the dark diagonal blocks in the main diagonal reveal the number of clusters that exist in the data. However, this method often fails to show the possible crisp clusters in the graph. We propose a novel algorithm, called EnSpeciVAT, which significantly enhances the SpecVAT algorithm in the context of crisp cluster generation for graph data. It incorporates a fuzzy c-means mechanism to guide the process of extracting crisp clusters in the graph. Our evaluation of six different graph data demonstrates that the EnSpeciVAT can find clear and crisp clusters in graph data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fahiman, F., Erfani, S.M., Rajasegarar, S., Palaniswami, M., Leckie, C.: Improving load forecasting based on deep learning and K-shape clustering. In: Proceedings of the 2017 International Joint Conference on Neural Networks, pp. 4134–4141. IEEE (2017)
Fischer, B., Zöller, T., Buhmann, J.M.: Path based pairwise data clustering with application to texture segmentation. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, pp. 235–250. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44745-8_16
Havens, T.C., et al.: Clustering and visualization of fuzzy communities in social networks. In: Proceedings of the 2013 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1–7. IEEE (2013)
Janofsky, J.S., McCarthy, R.J., Foistein, M.F.: The Hopkins competency assessment test: a brief method for evaluating patients’ capacity to give informed consent. Psychiatr. Serv. 43(2), 132–136 (1992)
Knuth, D.E.: The Stanford GraphBase: a platform for combinatorial computing. ACM (1993)
Komarasamy, G., Wahi, A.: Finding the number of clusters using visual validation VAT algorithm. Int. J. Eng. Technol. 5(5), 3951–3957 (2013)
Kumar, D., Bezdek, J.C.: Visual approaches for exploratory data analysis: a survey of the visual assessment of clustering tendency (VAT) family of algorithms. IEEE Syst. Man Cybern. Mag. 6(2), 10–48 (2020)
Li, X., Zhang, H., Wang, R., Nie, F.: Multiview clustering: a scalable and parameter-free bipartite graph fusion method. IEEE Trans. Pattern Anal. Mach. Intell. 44(1), 330–344 (2020)
Lin, Z., Kang, Z.: Graph filter-based multi-view attributed graph clustering. In: Proceedings of the 2021 IJCAI, pp. 2723–2729 (2021)
Lin, Z., Kang, Z., Zhang, L., Tian, L.: Multi-view attributed graph clustering. IEEE Trans. Knowl. Data Eng. (2021)
Liu, Q., et al.: Assessing the global tendency of Covid-19 outbreak. MedRxiv, p. 2020-03 (2020)
Meng, L., Tan, A.-H., Wunsch II, D.C.: Adaptive Resonance Theory in Social Media Data Clustering. AIKP, Springer, Cham (2019). https://doi.org/10.1007/978-3-030-02985-2
Nascimento, M.C., De Carvalho, A.C.: Spectral methods for graph clustering-a survey. Eur. J. Oper. Res. 211(2), 221–231 (2011)
Palaniswami, M., Rao, A.S., Kumar, D., Rathore, P., Rajasegarar, S.: The role of visual assessment of clusters for big data analysis: from real-world Internet of Things. IEEE Syst. Man Cybern. Mag. 6(4), 45–53 (2020)
Pan, E., Kang, Z.: Multi-view contrastive graph clustering. Adv. Neural. Inf. Process. Syst. 34, 2148–2159 (2021)
Rachunok, B.A., Bennett, J.B., Nateghi, R.: Twitter and disasters: a social resilience fingerprint. IEEE Access 7, 58495–58506 (2019)
Rajendra Prasad, K., Mohammed, M., Noorullah, R.: Visual topic models for healthcare data clustering. Evol. Intel. 14(2), 545–562 (2021)
Wang, C., Pan, S., Hu, R., Long, G., Jiang, J., Zhang, C.: Attributed graph clustering: a deep attentional embedding approach. arXiv:1906.06532 (2019)
Wang, L., Geng, X., Bezdek, J., Leckie, C., Kotagiri, R.: SpecVAT: enhanced visual cluster analysis. In: Proceedings of the 2008 8th IEEE International Conference on Data Mining, pp. 638–647. IEEE (2008)
Wang, L., Nguyen, U.T.V., Bezdek, J.C., Leckie, C.A., Ramamohanarao, K.: iVAT and aVAT: enhanced visual analysis for cluster tendency assessment. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS (LNAI), vol. 6118, pp. 16–27. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13657-3_5
Watts, D.J.: Networks, dynamics, and the small-world phenomenon. Am. J. Sociol. 105(2), 493–527 (1999)
Yang, S., Luo, S., Li, J.: A novel visual clustering algorithm for finding community in complex network. In: Li, X., Zaïane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 396–403. Springer, Heidelberg (2006). https://doi.org/10.1007/11811305_44
Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452–473 (1977)
Zhu, H., Koniusz, P.: Simple spectral graph convolution. In: Proceedings of the 2021 International Conference on Learning Representations (2021)
Acknowledgements
This research was funded by the Australian Research Council. ARC - Discovery Project, DP200101960.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Xia, S., Rajasegarar, S., Leckie, C., Erfani, S.M., Chan, J., Pan, L. (2023). EnSpeciVAT: Enhanced SpecieVAT for Cluster Tendency Identification in Graphs. In: Yang, X., et al. Advanced Data Mining and Applications. ADMA 2023. Lecture Notes in Computer Science(), vol 14178. Springer, Cham. https://doi.org/10.1007/978-3-031-46671-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-031-46671-7_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-46670-0
Online ISBN: 978-3-031-46671-7
eBook Packages: Computer ScienceComputer Science (R0)