Kernel-based iVAT with adaptive cluster extraction
Authors: 
Baojie Zhang, 
Ye Zhu, Yang Cao, Sutharshan Rajasegarar, Gang Li, Gang LiuAuthors Info & Claims
Pages 7057 - 7076
Abstract
Visual Assessment of cluster Tendency (VAT) is a popular method that visually represents the possible clusters found in a dataset as dark blocks along the diagonal of a reordered dissimilarity image (RDI). Although many variants of the VAT algorithm have been proposed to improve the visualisation quality on different types of datasets, they still suffer from the challenge of extracting clusters with varied densities. In this paper, we focus on overcoming this drawback of VAT algorithms by incorporating kernel methods and also propose a novel adaptive cluster extraction strategy, named CER, to effectively identify the local clusters from the RDI. We examine their effects on an improved VAT method (iVAT) and systematically evaluate the clustering performance on 18 synthetic and real-world datasets. The experimental results reveal that the recently proposed data-dependent dissimilarity measure, namely the Isolation kernel, helps to significantly improve the RDI image for easy cluster identification. Furthermore, the proposed cluster extraction method, CER, outperforms other existing methods on most of the datasets in terms of a series of dissimilarity measures.
References
[1]
Nguyen H-L, Woon Y-K, and Ng W-K A survey on data stream clustering and classification Knowl Inf Syst 2015 45 3 535-569
[2]
Hu J and Pei J Subspace multi-clustering: a review Knowl Inf Syst 2018 56 2 257-284
[3]
Kumar D and Bezdek JC Visual approaches for exploratory data analysis: A survey of the visual assessment of clustering tendency (vat) family of algorithms IEEE Syst Man Cybern Magaz 2020 6 2 10-48
[4]
Bezdek JC, Hathaway RJ (2002) VAT: a tool for visual assessment of (cluster) tendency. In: International joint conference on neural networks
[5]
Wang L, Nguyen UT, Bezdek JC, Leckie CA, Ramamohanarao K (2010) IVAT and AVAT: enhanced visual analysis for cluster tendency assessment. In: Pacific-Asia conference on knowledge discovery and data mining, pp 16–27. Springer
[6]
Rathore P, Kumar D, Bezdek JC, Rajasegarar S, and Palaniswami M Visual structural assessment and anomaly detection for high-velocity data streams IEEE Trans Cybern 2020 99 1-14
[7]
Ting KM, Zhu Y, Carman M, Zhu Y, Washio T, and Zhou Z-H Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms Mach Learn 2019 108 2 331-376
[8]
Schölkopf B, Smola A, and Müller K-R Nonlinear component analysis as a kernel eigenvalue problem Neural Comput 1998 10 5 1299-1319
[9]
Shawe-Taylor J and Cristianini N Kernel methods for pattern analysis 2004 Cambridge Cambridge University Press
[10]
Hinneburg A, Gabriel H-H (2007) Denclue 2.0: fast clustering based on kernel density estimation. In: International symposium on intelligent data analysis, pp 70–80. Springer
[11]
Qin X, Ting KM, Zhu Y, Lee V (2019) Nearest-neighbour-induced isolation similarity and its impact on density-based clustering. In: Proceedings of the 33rd AAAI conference on AI (AAAI 2019). AAAI Press
[12]
Zelnik-Manor L, Perona P (2005) Self-tuning spectral clustering. Adv Neural Inf Process Syst, pp 1601–1608
[13]
Kang Z, Peng C, Cheng Q, Xu Z (2018) Unified spectral clustering with optimal graph. In Proceedings of the AAAI conference on artificial intelligence, vol 32, no 1
[14]
Qin X, Ting KM, Zhu Y, and Lee VC Nearest-neighbour-induced isolation similarity and its impact on density-based clustering Proc AAAI Conf Artific Intell 2019 33 4755-4762
[15]
Ting KM, Zhu Y, Zhou Z-H (2018) Isolation kernel and its effect on SVM. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining, pp 2329–2337. ACM
[16]
Ting KM, Xu B-C, Washio T, Zhou Z-H (2020) Isolation distributional kernel: a new tool for kernel based anomaly detection. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 198–206
[17]
Kumar D, Bezdek JC, Rajasegarar S, Leckie C, and Palaniswami M A visual-numeric approach to clustering and anomaly detection for trajectory data Vis Comput 2017 33 3 265-281
[18]
Dhillon IS, Guan Y, Kulis B (2004) Kernel k-means: spectral clustering and normalized cuts. In: Proceedings of the Tenth ACM SIGKDD international conference on knowledge discovery and data mining, pp 551–556
[19]
Dua D, Graff C (2017) UCI Machine Learning Repository. http://archive.ics.uci.edu/ml
[20]
Vinh NX, Epps J, and Bailey J Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance J Mach Learn Res 2010 11 95 2837-2854
[21]
Lvd Maaten and Hinton G Visualizing data using t-SNE J Mach Learn Res 2008 9 2579-2605
[22]
Liu H, Wu J, Liu T, Tao D, and Fu Y Spectral ensemble clustering via weighted k-means: theoretical and practical evidence IEEE Trans Knowl Data Eng 2017 29 5 1129-1143
[23]
Li R, Yang X, Qin X, and Zhu W Local gap density for clustering high-dimensional data with varying densities Knowl-Based Syst 2019 184
[24]
Kang Z, Zhiping Lin XZ, Xu W (2021) Structured graph learning for scalable subspace clustering: from single view to multiview. IEEE Trans Cybern
[25]
Yang Y, Deng S, Lu J, Li Y, Gong Z, and Hao Z Graphlshc: towards large scale spectral hypergraph clustering Inf Sci 2021 544 117-134
[26]
Qiu T and Li Y Enhancing in-tree-based clustering via distance ensemble and kernelization Pattern Recogn 2021 112
[27]
Demšar J Statistical comparisons of classifiers over multiple data sets J Mach Learn Res 2006 7 1-30
[28]
Gönen M and Alpaydın E Multiple kernel learning algorithms J Mach Learn Res 2011 12 2211-2268
[29]
Bucak SS, Jin R, and Jain AK Multiple kernel learning for visual object recognition: a review IEEE Trans Pattern Anal Mach Intell 2013 36 7 1354-1369
[30]
Wang T, Lu J, and Zhang G Two-stage fuzzy multiple kernel learning based on Hilbert–Schmidt independence criterion IEEE Trans Fuzzy Syst 2018 26 6 3703-3714
[31]
Wang T, Zhang L, and Hu W Bridging deep and multiple kernel learning: a review Inf Fusion 2021 67 3-13
Index Terms
- Kernel-based iVAT with adaptive cluster extraction
Index terms have been assigned to the content through auto-classification.
Recommendations
iVAT and aVAT: enhanced visual analysis for cluster tendency assessment
PAKDD'10: Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part IGiven a pairwise dissimilarity matrix D of a set of n objects, visual methods (such as VAT) for cluster tendency assessment generally represent D as an n×n image $\mathrm{I}(\tilde{\bf D})$ where the objects are reordered to reveal hidden cluster ...
An Improved Visual Assessment with Data-Dependent Kernel for Stream Clustering
Advances in Knowledge Discovery and Data MiningAbstractThe advances of 5G and the Internet of Things enable more devices and sensors to be interconnected. Unlike traditional data, the large amount of data generated from various sensors and devices requires real-time analysis. The data objects in a ...
An Efficient Formulation of the Improved Visual Assessment of Cluster Tendency (iVAT) Algorithm
The VAT algorithm is a visual method for determining the possible number of clusters in, or the cluster tendency of a set of objects. The improved VAT (iVAT) algorithm uses a graph-theoretic distance transform to improve the effectiveness of the VAT ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
© The Author(s) 2024.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 06 September 2024
Accepted: 18 July 2024
Revision received: 21 July 2023
Received: 23 March 2022
Author Tags
Qualifiers
- Research-article
Funding Sources
- Deakin University
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Dec 2024