{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:24:46Z","timestamp":1772119486973,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:00:00Z","timestamp":1725580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:00:00Z","timestamp":1725580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001778","name":"Deakin University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001778","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    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\n                    <jats:italic>reordered dissimilarity image<\/jats:italic>\n                    (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.\n                  <\/jats:p>","DOI":"10.1007\/s10115-024-02189-1","type":"journal-article","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T02:02:05Z","timestamp":1725588125000},"page":"7057-7076","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Kernel-based iVAT with adaptive cluster extraction"],"prefix":"10.1007","volume":"66","author":[{"given":"Baojie","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ye","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Sutharshan","family":"Rajasegarar","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,6]]},"reference":[{"issue":"3","key":"2189_CR1","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10115-014-0808-1","volume":"45","author":"H-L Nguyen","year":"2015","unstructured":"Nguyen H-L, Woon Y-K, Ng W-K (2015) A survey on data stream clustering and classification. Knowl Inf Syst 45(3):535\u2013569","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"2189_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10115-017-1110-9","volume":"56","author":"J Hu","year":"2018","unstructured":"Hu J, Pei J (2018) Subspace multi-clustering: a review. Knowl Inf Syst 56(2):257\u2013284","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"2189_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MSMC.2019.2961163","volume":"6","author":"D Kumar","year":"2020","unstructured":"Kumar D, Bezdek JC (2020) Visual approaches for exploratory data analysis: A survey of the visual assessment of clustering tendency (vat) family of algorithms. IEEE Syst Man Cybern Magaz 6(2):10\u201348","journal-title":"IEEE Syst Man Cybern Magaz"},{"key":"2189_CR4","unstructured":"Bezdek JC, Hathaway RJ (2002) VAT: a tool for visual assessment of (cluster) tendency. In: International joint conference on neural networks"},{"key":"2189_CR5","doi-asserted-by":"crossref","unstructured":"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\u201327. Springer","DOI":"10.1007\/978-3-642-13657-3_5"},{"key":"2189_CR6","first-page":"1","volume":"99","author":"P Rathore","year":"2020","unstructured":"Rathore P, Kumar D, Bezdek JC, Rajasegarar S, Palaniswami M (2020) Visual structural assessment and anomaly detection for high-velocity data streams. IEEE Trans Cybern 99:1\u201314","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"2189_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10994-018-5737-x","volume":"108","author":"KM Ting","year":"2019","unstructured":"Ting KM, Zhu Y, Carman M, Zhu Y, Washio T, Zhou Z-H (2019) Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms. Mach Learn 108(2):331\u2013376","journal-title":"Mach Learn"},{"issue":"5","key":"2189_CR8","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf B, Smola A, M\u00fcller K-R (1998) Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput 10(5):1299\u20131319","journal-title":"Neural Comput"},{"key":"2189_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel methods for pattern analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor J, Cristianini N (2004) Kernel methods for pattern analysis. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/CBO9780511809682"},{"key":"2189_CR10","doi-asserted-by":"crossref","unstructured":"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\u201380. Springer","DOI":"10.1007\/978-3-540-74825-0_7"},{"key":"2189_CR11","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1609\/aaai.v33i01.33014755"},{"key":"2189_CR12","unstructured":"Zelnik-Manor L, Perona P (2005) Self-tuning spectral clustering. Adv Neural Inf Process Syst, pp 1601\u20131608"},{"key":"2189_CR13","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1609\/aaai.v32i1.11613"},{"key":"2189_CR14","first-page":"4755","volume":"33","author":"X Qin","year":"2019","unstructured":"Qin X, Ting KM, Zhu Y, Lee VC (2019) Nearest-neighbour-induced isolation similarity and its impact on density-based clustering. Proc AAAI Conf Artific Intell 33:4755\u20134762","journal-title":"Proc AAAI Conf Artific Intell"},{"key":"2189_CR15","doi-asserted-by":"crossref","unstructured":"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\u20132337. ACM","DOI":"10.1145\/3219819.3219990"},{"key":"2189_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013206","DOI":"10.1145\/3394486.3403062"},{"issue":"3","key":"2189_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00371-015-1192-x","volume":"33","author":"D Kumar","year":"2017","unstructured":"Kumar D, Bezdek JC, Rajasegarar S, Leckie C, Palaniswami M (2017) A visual-numeric approach to clustering and anomaly detection for trajectory data. Vis Comput 33(3):265\u2013281","journal-title":"Vis Comput"},{"key":"2189_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013556","DOI":"10.1145\/1014052.1014118"},{"key":"2189_CR19","unstructured":"Dua D, Graff C (2017) UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"95","key":"2189_CR20","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"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(95):2837\u20132854","journal-title":"J Mach Learn Res"},{"key":"2189_CR21","first-page":"2579","volume":"9","author":"Maaten Lvd","year":"2008","unstructured":"Lvd Maaten, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579\u20132605","journal-title":"J Mach Learn Res"},{"issue":"5","key":"2189_CR22","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1109\/TKDE.2017.2650229","volume":"29","author":"H Liu","year":"2017","unstructured":"Liu H, Wu J, Liu T, Tao D, Fu Y (2017) Spectral ensemble clustering via weighted k-means: theoretical and practical evidence. IEEE Trans Knowl Data Eng 29(5):1129\u20131143","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2189_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.104905","volume":"184","author":"R Li","year":"2019","unstructured":"Li R, Yang X, Qin X, Zhu W (2019) Local gap density for clustering high-dimensional data with varying densities. Knowl-Based Syst 184:104905","journal-title":"Knowl-Based Syst"},{"key":"2189_CR24","doi-asserted-by":"crossref","unstructured":"Kang Z, Zhiping\u00a0Lin XZ, Xu W (2021) Structured graph learning for scalable subspace clustering: from single view to multiview. IEEE Trans Cybern","DOI":"10.1109\/TCYB.2021.3061660"},{"key":"2189_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ins.2020.07.018","volume":"544","author":"Y Yang","year":"2021","unstructured":"Yang Y, Deng S, Lu J, Li Y, Gong Z, Hao Z (2021) Graphlshc: towards large scale spectral hypergraph clustering. Inf Sci 544:117\u2013134. https:\/\/doi.org\/10.1016\/j.ins.2020.07.018","journal-title":"Inf Sci"},{"key":"2189_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107731","volume":"112","author":"T Qiu","year":"2021","unstructured":"Qiu T, Li Y (2021) Enhancing in-tree-based clustering via distance ensemble and kernelization. Pattern Recogn 112:107731","journal-title":"Pattern Recogn"},{"key":"2189_CR27","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"2189_CR28","first-page":"2211","volume":"12","author":"M G\u00f6nen","year":"2011","unstructured":"G\u00f6nen M, Alpayd\u0131n E (2011) Multiple kernel learning algorithms. J Mach Learn Res 12:2211\u20132268","journal-title":"J Mach Learn Res"},{"issue":"7","key":"2189_CR29","first-page":"1354","volume":"36","author":"SS Bucak","year":"2013","unstructured":"Bucak SS, Jin R, Jain AK (2013) Multiple kernel learning for visual object recognition: a review. IEEE Trans Pattern Anal Mach Intell 36(7):1354\u20131369","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"2189_CR30","doi-asserted-by":"publisher","first-page":"3703","DOI":"10.1109\/TFUZZ.2018.2848224","volume":"26","author":"T Wang","year":"2018","unstructured":"Wang T, Lu J, Zhang G (2018) Two-stage fuzzy multiple kernel learning based on Hilbert\u2013Schmidt independence criterion. IEEE Trans Fuzzy Syst 26(6):3703\u20133714","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"2189_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.inffus.2020.10.002","volume":"67","author":"T Wang","year":"2021","unstructured":"Wang T, Zhang L, Hu W (2021) Bridging deep and multiple kernel learning: a review. Inf Fusion 67:3\u201313","journal-title":"Inf Fusion"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02189-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02189-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02189-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T05:09:05Z","timestamp":1727500145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02189-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,6]]},"references-count":31,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2189"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02189-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1483344\/v1","asserted-by":"object"}]},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,6]]},"assertion":[{"value":"23 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}