{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:48:24Z","timestamp":1780472904748,"version":"3.54.1"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003448","name":"General Secretariat for Research and Technology","doi-asserted-by":"publisher","award":["1901"],"award-info":[{"award-number":["1901"]}],"id":[{"id":"10.13039\/501100003448","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1016\/j.patcog.2020.107508","type":"journal-article","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T01:40:13Z","timestamp":1592530813000},"page":"107508","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":38,"special_numbering":"C","title":["Nonlinear dimensionality reduction for clustering"],"prefix":"10.1016","volume":"107","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-9536-4090","authenticated-orcid":false,"given":"Sotiris","family":"Tasoulis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicos G.","family":"Pavlidis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teemu","family":"Roos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2020.107508_bib0001","series-title":"Handbook of Data Visualization","first-page":"315","article-title":"Multidimensional scaling","author":"Cox","year":"2008"},{"issue":"1","key":"10.1016\/j.patcog.2020.107508_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497578","article-title":"Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering","volume":"3","author":"Kriegel","year":"2009","journal-title":"ACM Trans. Knowl. Discov. Data."},{"key":"10.1016\/j.patcog.2020.107508_bib0003","series-title":"Proceedings of the 24th International Conference on Machine Learning","first-page":"521","article-title":"Adaptive dimension reduction using discriminant analysis and k-means clustering","author":"Ding","year":"2007"},{"key":"10.1016\/j.patcog.2020.107508_bib0004","series-title":"IEEE Symposium Series on Computational Intelligence","first-page":"780","article-title":"Maximum clusterability divisive clustering","author":"Hofmeyr","year":"2015"},{"issue":"156","key":"10.1016\/j.patcog.2020.107508_bib0005","first-page":"1","article-title":"Minimum density hyperplanes","volume":"17","author":"Pavlidis","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.patcog.2020.107508_bib0006","series-title":"International Conference on Artificial Intelligence and Statistics","first-page":"552","article-title":"Dimensionality reduction for spectral clustering","author":"Niu","year":"2011"},{"issue":"8","key":"10.1016\/j.patcog.2020.107508_bib0007","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1109\/TPAMI.2016.2609929","article-title":"Clustering by minimum cut hyperplanes","volume":"39","author":"Hofmeyr","year":"2017","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"10.1016\/j.patcog.2020.107508_bib0008","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s11222-018-9814-6","article-title":"Minimum spectral connectivity projection pursuit","volume":"29","author":"Hofmeyr","year":"2019","journal-title":"Stat. Comput."},{"issue":"2","key":"10.1016\/j.patcog.2020.107508_bib0009","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MSP.2010.939739","article-title":"Subspace clustering","volume":"28","author":"Vidal","year":"2011","journal-title":"IEEE Signal Process. Mag."},{"issue":"5500","key":"10.1016\/j.patcog.2020.107508_bib0010","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"Tenenbaum","year":"2000","journal-title":"Science"},{"issue":"5","key":"10.1016\/j.patcog.2020.107508_bib0011","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1162\/089976698300017467","article-title":"Nonlinear component analysis as a kernel eigenvalue problem","volume":"10","author":"Sch\u00f6lkopf","year":"1998","journal-title":"Neural Comput."},{"issue":"5500","key":"10.1016\/j.patcog.2020.107508_bib0012","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear dimensionality reduction by locally linear embedding","volume":"290","author":"Roweis","year":"2000","journal-title":"Science"},{"issue":"6","key":"10.1016\/j.patcog.2020.107508_bib0013","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","article-title":"Laplacian eigenmaps for dimensionality reduction and data representation","volume":"15","author":"Belkin","year":"2003","journal-title":"Neural Comput."},{"issue":"1","key":"10.1016\/j.patcog.2020.107508_bib0014","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.patrec.2011.09.016","article-title":"An effective double-bounded tree-connected isomap algorithm for microarray data classification","volume":"33","author":"Orsenigo","year":"2012","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.patcog.2020.107508_bib0015","series-title":"Proceedings of the 2nd International Conference on Knowledge Discovery and Data mining","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise.","volume":"vol.\u00a096","author":"Ester","year":"1996"},{"issue":"5","key":"10.1016\/j.patcog.2020.107508_bib0016","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s11222-013-9400-x","article-title":"An advancement in clustering via nonparametric density estimation","volume":"24","author":"Menardi","year":"2014","journal-title":"Stat. Comput."},{"issue":"6191","key":"10.1016\/j.patcog.2020.107508_bib0017","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"10.1016\/j.patcog.2020.107508_bib0018","doi-asserted-by":"crossref","first-page":"106948","DOI":"10.1016\/j.patcog.2019.06.014","article-title":"CutESC: cutting edge spatial clustering technique based on proximity graphs","volume":"96","author":"Aksac","year":"2019","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2020.107508_bib0019","doi-asserted-by":"crossref","first-page":"107206","DOI":"10.1016\/j.patcog.2020.107206","article-title":"A novel density-based clustering algorithm using nearest neighbor graph","volume":"102","author":"Li","year":"2020","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2020.107508_bib0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.patcog.2017.09.008","article-title":"A novel clustering method based on hybrid k-nearest-neighbor graph","volume":"74","author":"Qin","year":"2018","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2020.107508_bib0021","series-title":"Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data mining","first-page":"551","article-title":"Kernel k-means: spectral clustering and normalized cuts","author":"Dhillon","year":"2004"},{"key":"10.1016\/j.patcog.2020.107508_bib0022","doi-asserted-by":"crossref","unstructured":"X. Chen, Y. Yang, Diffusion k-means clustering on manifolds: provable exact recovery via semidefinite relaxations, Applied and Computational Harmonic Analysis, (2020), in press. (doi.org\/10.1016\/j.acha.2020.03.002).","DOI":"10.1016\/j.acha.2020.03.002"},{"key":"10.1016\/j.patcog.2020.107508_bib0023","series-title":"Advances in Neural Information Processing Systems","first-page":"849","article-title":"On spectral clustering: analysis and an algorithm","author":"Ng","year":"2001"},{"issue":"4","key":"10.1016\/j.patcog.2020.107508_bib0024","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"von Luxburg","year":"2007","journal-title":"Stat. Comput."},{"key":"10.1016\/j.patcog.2020.107508_bib0025","doi-asserted-by":"crossref","DOI":"10.1007\/s11263-020-01320-3","article-title":"Enhanced balanced min cut","author":"Chen","year":"2020","journal-title":"Int. J. Comput. Vis."},{"key":"10.1016\/j.patcog.2020.107508_bib0026","doi-asserted-by":"crossref","first-page":"105102","DOI":"10.1016\/j.knosys.2019.105102","article-title":"Multi-graph fusion for multi-view spectral clustering","volume":"189","author":"Kang","year":"2020","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.patcog.2020.107508_bib0027","series-title":"Advanced Research in Applied Artificial Intelligence","first-page":"808","article-title":"An extended isomap by enhancing similarity for clustering","volume":"vol.\u00a07345","author":"Yu","year":"2012"},{"issue":"5552","key":"10.1016\/j.patcog.2020.107508_bib0028","doi-asserted-by":"crossref","first-page":"7a","DOI":"10.1126\/science.295.5552.7a","article-title":"The isomap algorithm and topological stability","volume":"295","author":"Balasubramanian","year":"2002","journal-title":"Science"},{"key":"10.1016\/j.patcog.2020.107508_bib0029","doi-asserted-by":"crossref","first-page":"3391","DOI":"10.1016\/j.patcog.2010.05.025","article-title":"Enhancing principal direction divisive clustering","volume":"43","author":"Tasoulis","year":"2010","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2020.107508_bib0030","article-title":"Clustering algorithms","author":"Hartigan","year":"1975"},{"issue":"1","key":"10.1016\/j.patcog.2020.107508_bib0031","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","article-title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","volume":"51","author":"Andoni","year":"2008","journal-title":"Commun. ACM"},{"key":"10.1016\/j.patcog.2020.107508_bib0032","series-title":"Proceedings of the ECCV Workshop on Computation Intensive Methods for Computer Vision (CIMCV)","article-title":"A fast approximation to multidimensional scaling","author":"Yang","year":"2006"},{"key":"10.1016\/j.patcog.2020.107508_bib0033","series-title":"Advances in Neural Information Processing Systems 14","first-page":"849","article-title":"On spectral clustering: analysis and an algorithm","author":"Ng","year":"2002"},{"key":"10.1016\/j.patcog.2020.107508_bib0034","series-title":"IEEE International Conference on Big Data (Big Data)","first-page":"3613","article-title":"Minimum density hyperplanes in the feature space","author":"Yates","year":"2016"},{"issue":"1","key":"10.1016\/j.patcog.2020.107508_bib0035","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/j.csda.2007.02.009","article-title":"High dimensional data clustering","volume":"52","author":"Bouveyron","year":"2007","journal-title":"Comput. Stat. Data Anal."},{"issue":"3","key":"10.1016\/j.patcog.2020.107508_bib0036","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1111\/j.2517-6161.1991.tb01857.x","article-title":"A reliable data-based bandwidth selection method for kernel density estimation","volume":"53","author":"Sheather","year":"1991","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"10.1016\/j.patcog.2020.107508_bib0037","first-page":"583","article-title":"Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions","volume":"3","author":"Strehl","year":"2002","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"10.1016\/j.patcog.2020.107508_bib0038","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions","volume":"2","author":"Hubert","year":"1985","journal-title":"J. Classif."},{"key":"10.1016\/j.patcog.2020.107508_bib0039","series-title":"International Conference on Rough Sets and Current Trends in Computing","first-page":"4","article-title":"Rsctc?2010 discovery challenge: mining dna microarray data for medical diagnosis and treatment","author":"Wojnarski","year":"2010"},{"issue":"10","key":"10.1016\/j.patcog.2020.107508_bib0040","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1038\/ng.2764","article-title":"The cancer genome atlas pan-cancer analysis project","volume":"45","author":"Weinstein","year":"2013","journal-title":"Nat. Genet."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0031320320303113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0031320320303113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T23:48:20Z","timestamp":1723074500000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320320303113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":40,"alternative-id":["S0031320320303113"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.patcog.2020.107508","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2020,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Nonlinear dimensionality reduction for clustering","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.patcog.2020.107508","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"107508"}}