{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:06:03Z","timestamp":1778645163507,"version":"3.51.4"},"reference-count":105,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008967","name":"Philipps-Universit\u00e4t Marburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008967","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Classif"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For high-dimensional datasets in which clusters are formed by both distance and density structures (DDS), many clustering algorithms fail to identify these clusters correctly. This is demonstrated for 32 clustering algorithms using a suite of datasets which deliberately pose complex DDS challenges for clustering. In order to improve the structure finding and clustering in high-dimensional DDS datasets, projection-based clustering (PBC) is introduced. The coexistence of projection and clustering allows to explore DDS through a topographic map. This enables to estimate, first, if any cluster tendency exists and, second, the estimation of the number of clusters. A comparison showed that PBC is always able to find the correct cluster structure, while the performance of the best of the 32 clustering algorithms varies depending on the dataset.<\/jats:p>","DOI":"10.1007\/s00357-020-09373-2","type":"journal-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T04:44:51Z","timestamp":1597898691000},"page":"280-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["Using Projection-Based Clustering to Find Distance- and Density-Based Clusters in High-Dimensional Data"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9542-5543","authenticated-orcid":false,"given":"Michael C.","family":"Thrun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred","family":"Ultsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"9373_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.patcog.2018.10.026","volume":"88","author":"A Adolfsson","year":"2019","unstructured":"Adolfsson, A., Ackerman, M., & Brownstein, N. C. (2019). To cluster, or not to cluster: an analysis of clusterability methods. Pattern Recognition, 88, 13\u201326.","journal-title":"Pattern Recognition"},{"key":"9373_CR2","volume-title":"Comparison of classifiers in high dimensional settings, technical report 92\u201302","author":"S Aeberhard","year":"1992","unstructured":"Aeberhard, S., Coomans, D., & De Vel, O. (1992). Comparison of classifiers in high dimensional settings, technical report 92\u201302. North Queensland: James Cook University of North Queensland, Department of Computer Science and Department of Mathematics and Statistics."},{"key":"9373_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., & Park, J.S. (1999). Fast algorithms for projected clustering. Proc. ACM SIGMOD International Conference on Management of Data (Vol. 28, pp. 61\u201372) Philadelphia, Pennsylvania: Association for Computing Machinery.","DOI":"10.1145\/304182.304188"},{"key":"9373_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/342009.335383","volume-title":"Proceedings of the ACM SIGMOD international conference on management of data","author":"CC Aggarwal","year":"2000","unstructured":"Aggarwal, C. C., & Yu, P. S. (2000). Finding generalized projected clusters in high dimensional spaces. In Proceedings of the ACM SIGMOD international conference on management of data (pp. 70\u201381). New York: ACM."},{"key":"9373_CR5","first-page":"94","volume-title":"Proceedings of the ACM SIGMOD international conference on management of data","author":"R Agrawal","year":"1998","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998). Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the ACM SIGMOD international conference on management of data (pp. 94\u2013105). Seattle: ACM."},{"key":"9373_CR6","first-page":"2","volume":"59","author":"E Anderson","year":"1935","unstructured":"Anderson, E. (1935). The Irises of the Gasp\u00e9 Peninsula. Bulletin of the American Iris Society, 59, 2\u20135.","journal-title":"Bulletin of the American Iris Society"},{"key":"9373_CR7","first-page":"160","volume-title":"Advanced methods of marketing research","author":"P Arabie","year":"1994","unstructured":"Arabie, P., & Hubert, L. (1994). Cluster analysis in marketing research. In R. P. Bagozzi (Ed.), Advanced methods of marketing research (pp. 160\u2013189). Oxford, England: Blackwell Business."},{"key":"9373_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/1930","volume-title":"Clustering and classification","author":"P Arabie","year":"1996","unstructured":"Arabie, P., Hubert, L. J., & De Soete, G. (1996). Clustering and classification. Singapore: World Scientific."},{"key":"9373_CR9","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.neucom.2006.11.018","volume":"70","author":"M Aupetit","year":"2007","unstructured":"Aupetit, M. (2007). Visualizing distortions and recovering topology in continuous projection techniques. Neurocomputing, 70, 1304\u20131330.","journal-title":"Neurocomputing"},{"key":"9373_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-94-009-3977-6_2","volume-title":"Multivariate statistical modeling and data analysis","author":"HH Bock","year":"1987","unstructured":"Bock, H. H. (1987). On the interface between cluster analysis, principal component analysis, and multidimensional scaling. In H. Bozdogan & A. K. Gupta (Eds.), Multivariate statistical modeling and data analysis (pp. 17\u201334). Dordrecht: Springer."},{"key":"9373_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1147\/rd.81.0022","volume":"8","author":"RE Bonner","year":"1964","unstructured":"Bonner, R. E. (1964). On some clustering technique. IBM Journal of Research and Development, 8, 22\u201332.","journal-title":"IBM Journal of Research and Development"},{"key":"9373_CR12","first-page":"267","volume":"32","author":"WC Chang","year":"1983","unstructured":"Chang, W. C. (1983). On using principal components before separating a mixture of two multivariate normal distributions. Journal of the Royal Statistical Society: Series C: Applied Statistics, 32, 267\u2013275.","journal-title":"Journal of the Royal Statistical Society: Series C: Applied Statistics"},{"key":"9373_CR13","doi-asserted-by":"publisher","unstructured":"Charrad, M., Ghazzali, N., Boiteau, V., & Niknafs, A. (2012). NbClust: An R Package for determining the relevant number of clusters in a data set. Journal of statistical Software, 61(6),1\u201336. https:\/\/doi.org\/10.18637\/jss.v061.i06","DOI":"10.18637\/jss.v061.i06"},{"key":"9373_CR14","first-page":"29","volume-title":"Higher-order statistics","author":"P Comon","year":"1992","unstructured":"Comon, P. (1992). Independent component analysis. In J. Lacoume (Ed.), Higher-order statistics (pp. 29\u201338). Amsterdam: Elsevier."},{"key":"9373_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S Dasgupta","year":"2003","unstructured":"Dasgupta, S., & Gupta, A. (2003). An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures & Algorithms, 22, 60\u201365.","journal-title":"Random Structures & Algorithms"},{"key":"9373_CR16","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-51175-2_24","volume-title":"New approaches in classification and data analysis","author":"G De Soete","year":"1994","unstructured":"De Soete, G., & Carroll, J. D. (1994). K-means clustering in a low-dimensional Euclidean space. In E. Diday, Y. Lechevallier, M. Schader, P. Bertrand, & B. Burtschy (Eds.), New approaches in classification and data analysis (pp. 212\u2013219). Berlin: Springer."},{"key":"9373_CR17","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","volume":"20","author":"D Defays","year":"1977","unstructured":"Defays, D. (1977). An efficient algorithm for a complete link method. The Computer Journal, 20, 364\u2013366.","journal-title":"The Computer Journal"},{"key":"9373_CR18","first-page":"921","volume-title":"15\u00b0 Colloque sur le Traitement du Signal et des Images","author":"P Demartines","year":"1995","unstructured":"Demartines, P., & H\u00e9rault, J. (1995). CCA: \u201ccurvilinear component analysis\u201d. In 15\u00b0 Colloque sur le Traitement du Signal et des Images (pp. 921\u2013924). France: GRETSI, Groupe d\u2019Etudes du Traitement du Signal et des Images."},{"key":"9373_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"9373_CR20","unstructured":"Dimitriadou, E. (2002). cclust\u2013convex clustering methods and clustering indexes. R Package Version 0.6-21."},{"key":"9373_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF02294713","volume":"67","author":"E Dimitriadou","year":"2002","unstructured":"Dimitriadou, E., Dolni\u010dar, S., & Weingessel, A. (2002). An examination of indexes for determining the number of clusters in binary data sets. Psychometrika, 67, 137\u2013159.","journal-title":"Psychometrika"},{"key":"9373_CR22","volume-title":"Pattern classification","author":"RO Duda","year":"2001","unstructured":"Duda, R. O., Hart, P. E., & Stork, D. G. (2001). Pattern classification. New York: Wiley."},{"key":"9373_CR23","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. Proc. Second International Conference on Knowledge Discovery and Data Mining (KDD 96) (Vol. 96, pp. 226\u2013231). Portland, Oregon: AAAI Press."},{"key":"9373_CR24","volume-title":"Cluster analysis","author":"BS Everitt","year":"2001","unstructured":"Everitt, B. S., Landau, S., & Leese, M. (2001). Cluster analysis. London: Arnold."},{"key":"9373_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/9780470977811.ch4","volume-title":"Cluster analysis","author":"BS Everitt","year":"2011","unstructured":"Everitt, B. S., Landau, S., Leese, M., & Stahl, D. (2011). Hierarchical clustering. In B. S. Everitt, S. Landau, M. Leese, & D. Stahl (Eds.), Cluster analysis (5th ed., pp. 71\u2013110). New York: Wiley.","edition":"5"},{"key":"9373_CR26","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"RA Fisher","year":"1936","unstructured":"Fisher, R. A. (1936). The use of multiple measurements in taxonomic problems. Annals of Eugenics, 7, 179\u2013188.","journal-title":"Annals of Eugenics"},{"key":"9373_CR27","doi-asserted-by":"crossref","unstructured":"Florek, K., \u0141ukaszewicz, J., Perkal, J., Steinhaus, H., & Zubrzycki, S. (1951). Sur la liaison et la division des points d'un ensemble fini. Proc. Colloquium Mathematicae (Vol. 2, pp. 282\u2013285). Institute of Mathematics Polish Academy of Sciences.","DOI":"10.4064\/cm-2-3-4-282-285"},{"key":"9373_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-1217-5","volume-title":"Multivariate statistics, a practical approach","author":"B Flury","year":"1988","unstructured":"Flury, B., & Riedwyl, H. (1988). Multivariate statistics, a practical approach. London: Chapman and Hall."},{"key":"9373_CR29","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1198\/016214502760047131","volume":"97","author":"C Fraley","year":"2002","unstructured":"Fraley, C., & Raftery, A. E. (2002). Model-based clustering, discriminant analysis, and density estimation. Journal of the American Statistical Association, 97, 611\u2013631.","journal-title":"Journal of the American Statistical Association"},{"key":"9373_CR30","doi-asserted-by":"crossref","unstructured":"Fraley, C., & Raftery, A.E. (2006). MCLUST version 3: an R package for normal mixture modeling and model-based clustering Vol. Technical Report No. 504, Department of Statistics, University of Washington, Seattle.","DOI":"10.21236\/ADA456562"},{"key":"9373_CR31","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1111\/j.1365-294X.2004.02236.x","volume":"13","author":"P Franck","year":"2004","unstructured":"Franck, P., Cameron, E., Good, G., Rasplus, J. Y., & Oldroyd, B. P. (2004). Nest architecture and genetic differentiation in a species complex of Australian stingless bees. Molecular Ecology, 13, 2317\u20132331.","journal-title":"Molecular Ecology"},{"key":"9373_CR32","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315, 972\u2013976.","journal-title":"Science"},{"key":"9373_CR33","doi-asserted-by":"crossref","unstructured":"Ge, R., Ester, M., Jin, W., & Davidson, I. (2007). Constraint-driven clustering Proc. 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 07) (pp. 320\u2013329). San Jose, California: Association for Computing Machinery.","DOI":"10.1145\/1281192.1281229"},{"key":"9373_CR34","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1200\/JCO.2009.23.4732","volume":"28","author":"T Haferlach","year":"2010","unstructured":"Haferlach, T., Kohlmann, A., Wieczorek, L., Basso, G., Te Kronnie, G., B\u00e9n\u00e9, M.-C., De Vos, J., Hern\u00e1ndez, J. M., Hofmann, W.-K., & Mills, K. I. (2010). Clinical utility of microarray-based gene expression profiling in the diagnosis and subclassification of leukemia: report from the international microarray innovations in leukemia study group. Journal of Clinical Oncology, 28, 2529\u20132537.","journal-title":"Journal of Clinical Oncology"},{"key":"9373_CR35","doi-asserted-by":"publisher","first-page":"3201","DOI":"10.1093\/bioinformatics\/bti517","volume":"21","author":"J Handl","year":"2005","unstructured":"Handl, J., Knowles, J., & Kell, D. B. (2005). Computational cluster validation in post-genomic data analysis. Bioinformatics, 21, 3201\u20133212.","journal-title":"Bioinformatics"},{"key":"9373_CR36","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-01595-8_5","volume-title":"Data analysis, machine learning and knowledge discovery","author":"C Hennig","year":"2014","unstructured":"Hennig, C. (2014). How many bee species? A case study in determining the number of clusters. In M. Spiliopoulou, L. Schmidt-Thieme, & R. Janning (Eds.), Data analysis, machine learning and knowledge discovery (pp. 41\u201349). Berlin: Springer."},{"key":"9373_CR37","doi-asserted-by":"publisher","DOI":"10.1201\/b19706","volume-title":"Handbook of cluster analysis","author":"C Hennig","year":"2015","unstructured":"Hennig, C. (2015). Handbook of cluster analysis. New York: Chapman & Hall\/CRC."},{"key":"9373_CR38","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1093\/bioinformatics\/17.2.126","volume":"17","author":"J Herrero","year":"2001","unstructured":"Herrero, J., Valencia, A., & Dopazo, J. (2001). A hierarchical unsupervised growing neural network for clustering gene expression patterns. Bioinformatics, 17, 126\u2013136.","journal-title":"Bioinformatics"},{"key":"9373_CR39","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1101\/gr.9.11.1106","volume":"9","author":"LJ Heyer","year":"1999","unstructured":"Heyer, L. J., Kruglyak, S., & Yooseph, S. (1999). Exploring expression data: identification and analysis of coexpressed genes. Genome Research, 9, 1106\u20131115.","journal-title":"Genome Research"},{"key":"9373_CR40","first-page":"833","volume-title":"Advances in neural information processing systems","author":"GE Hinton","year":"2002","unstructured":"Hinton, G. E., & Roweis, S. T. (2002). Stochastic neighbor embedding. In Advances in neural information processing systems (pp. 833\u2013840). Cambridge: MIT Press."},{"key":"9373_CR41","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/00031305.1998.10480559","volume":"52","author":"JL HINTZE","year":"1998","unstructured":"HINTZE, J. L., & NELSON, R. D. (1998). Violin plots: a box plot-density trace synergism. The American Statistician, 52, 181\u2013184.","journal-title":"The American Statistician"},{"key":"9373_CR42","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1109\/SSCI.2015.116","volume-title":"2015 IEEE symposium series on computational intelligence","author":"D Hofmeyr","year":"2015","unstructured":"Hofmeyr, D., & Pavlidis, N. (2015). Maximum clusterability divisive clustering. In 2015 IEEE symposium series on computational intelligence (pp. 780\u2013786). Piscataway, NJ: IEEE."},{"key":"9373_CR43","doi-asserted-by":"publisher","first-page":"152","DOI":"10.32614\/RJ-2019-046","volume":"11","author":"D Hofmeyr","year":"2019","unstructured":"Hofmeyr, D., & Pavlidis, N. (2019). PPCI: an R package for cluster identification using projection pursuit. The R Journal, 11, 152.","journal-title":"The R Journal"},{"key":"9373_CR44","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1109\/TPAMI.2016.2609929","volume":"39","author":"DP Hofmeyr","year":"2016","unstructured":"Hofmeyr, D. P. (2016). Clustering by minimum cut hyperplanes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 39, 1547\u20131560.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"9373_CR45","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"H Hotelling","year":"1933","unstructured":"Hotelling, H. (1933). Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology, 24, 417\u2013441.","journal-title":"Journal of Educational Psychology"},{"key":"9373_CR46","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193\u2013218.","journal-title":"Journal of Classification"},{"key":"9373_CR47","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain, A. K., & Dubes, R. C. (1988). Algorithms for clustering data. Englewood Cliffs: Prentice Hall College Div."},{"key":"9373_CR48","doi-asserted-by":"crossref","unstructured":"Johnson, W. B., & Lindenstrauss, J. (1984). Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics, 26(1), 189\u2013206.","DOI":"10.1090\/conm\/026\/737400"},{"key":"9373_CR49","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/9780470316801.ch2","volume-title":"Finding groups in data: An introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman, L., & Rousseeuw, P. J. (1990). Partitioning around medoids (program PAM). In L. Kaufman & P. J. Rousseeuw (Eds.), Finding groups in data: An introduction to cluster analysis (pp. 68\u2013125). Hoboken, NJ: Wiley."},{"key":"9373_CR50","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"2005","unstructured":"Kaufman, L., & Rousseeuw, P. J. (2005). Finding groups in data: an introduction to cluster analysis. Hoboken: Wiley."},{"key":"9373_CR51","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s11229-006-9025-0","volume":"151","author":"J Kim","year":"2006","unstructured":"Kim, J. (2006). Emergence: core ideas and issues. Synthese, 151, 547\u2013559.","journal-title":"Synthese"},{"key":"9373_CR52","first-page":"463","volume-title":"Advances in neural information processing systems","author":"J Kleinberg","year":"2003","unstructured":"Kleinberg, J. (2003). An impossibility theorem for clustering. In Advances in neural information processing systems (pp. 463\u2013470). Vancouver, British Columbia: MIT Press."},{"key":"9373_CR53","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/9.1.60","volume":"9","author":"GN Lance","year":"1966","unstructured":"Lance, G. N., & Williams, W. T. (1966a). Computer programs for hierarchical polythetic classification (\u201csimilarity analyses\u201d). The Computer Journal, 9, 60\u201364.","journal-title":"The Computer Journal"},{"key":"9373_CR54","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1038\/212218a0","volume":"212","author":"GN Lance","year":"1966","unstructured":"Lance, G. N., & Williams, W. T. (1966b). A generalized sorting strategy for computer classifications. Nature, 212, 218.","journal-title":"Nature"},{"key":"9373_CR55","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1093\/comjnl\/9.4.373","volume":"9","author":"GN Lance","year":"1967","unstructured":"Lance, G. N., & Williams, W. T. (1967). A general theory of classificatory sorting strategies: 1. Hierarchical systems. The Computer Journal, 9, 373\u2013380.","journal-title":"The Computer Journal"},{"key":"9373_CR56","volume-title":"UCI machine learning repository","author":"M Lichman","year":"2013","unstructured":"Lichman, M. (2013). UCI machine learning repository. Irvine: University of California, School of Information and Computer Science."},{"key":"9373_CR57","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1109\/TCOM.1980.1094577","volume":"28","author":"Y Linde","year":"1980","unstructured":"Linde, Y., Buzo, A., & Gray, R. (1980). An algorithm for vector quantizer design. IEEE Transactions on Communications, 28, 84\u201395.","journal-title":"IEEE Transactions on Communications"},{"key":"9373_CR58","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-07695-9_24","volume-title":"Advances in self-organizing maps and learning vector quantization","author":"J L\u00f6tsch","year":"2014","unstructured":"L\u00f6tsch, J., & Ultsch, A. (2014). Exploiting the structures of the U-matrix. In Advances in self-organizing maps and learning vector quantization (pp. 249\u2013257). Mittweida: Springer International Publishing."},{"key":"9373_CR59","first-page":"1","volume":"91","author":"A Markos","year":"2019","unstructured":"Markos, A., Iodice D\u2019Enza, A., & van de Velden, M. (2019). Beyond tandem analysis: joint dimension reduction and clustering in R. Journal of Statistical Software (Online), 91, 1\u201324.","journal-title":"Journal of Statistical Software (Online)"},{"key":"9373_CR60","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/72.238311","volume":"4","author":"TM Martinetz","year":"1993","unstructured":"Martinetz, T. M., Berkovich, S. G., & Schulten, K. J. (1993). \u2018Neural-gas\u2019 network for vector quantization and its application to time-series prediction. IEEE Transactions on Neural Networks, 4, 558\u2013569.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"9373_CR61","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1177\/001316446602600402","volume":"26","author":"LL McQuitty","year":"1966","unstructured":"McQuitty, L. L. (1966). Similarity analysis by reciprocal pairs for discrete and continuous data. Educational and Psychological Measurement, 26, 825\u2013831.","journal-title":"Educational and Psychological Measurement"},{"key":"9373_CR62","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01897163","volume":"5","author":"GW Milligan","year":"1988","unstructured":"Milligan, G. W., & Cooper, M. C. (1988). A study of standardization of variables in cluster analysis. Journal of Classification, 5, 181\u2013204.","journal-title":"Journal of Classification"},{"key":"9373_CR63","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034912","volume-title":"Clustering: a data recovery approach","author":"BG Mirkin","year":"2005","unstructured":"Mirkin, B. G. (2005). Clustering: a data recovery approach. Boca Raton: Chapman & Hall\/CRC."},{"key":"9373_CR64","first-page":"849","volume":"2","author":"AY Ng","year":"2002","unstructured":"Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On spectral clustering: analysis and an algorithm. Advances in Neural Information Processing Systems, 2, 849\u2013856.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"9373_CR65","unstructured":"Niu, D., Dy, J., & Jordan, M. (2011). Dimensionality reduction for spectral clustering. In Gordon, G., Dunson, D. & Dud\u00edk, M. (eds.), Proc. Fourteenth International Conference on Artificial Intelligence and Statistics (Vol. 15, pp. 552\u2013560). Fort Lauderdale, FL: PMLR."},{"key":"9373_CR66","doi-asserted-by":"publisher","first-page":"28","DOI":"10.14714\/CP47.470","volume":"47","author":"T Patterson","year":"2004","unstructured":"Patterson, T., & Kelso, N. V. (2004). Hal Shelton revisited: designing and producing natural-color maps with satellite land cover data. Cartographic Perspectives, 47, 28\u201355.","journal-title":"Cartographic Perspectives"},{"key":"9373_CR67","first-page":"5414","volume":"17","author":"NG Pavlidis","year":"2016","unstructured":"Pavlidis, N. G., Hofmeyr, D. P., & Tasoulis, S. K. (2016). Minimum density hyperplanes. The Journal of Machine Learning Research, 17, 5414\u20135446.","journal-title":"The Journal of Machine Learning Research"},{"key":"9373_CR68","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"K Pearson","year":"1901","unstructured":"Pearson, K. (1901). LIII. On lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 2, 559\u2013572.","journal-title":"The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science"},{"key":"9373_CR69","volume-title":"R: a language and environment for statistical computing (Version 3.2.5)","author":"R Development Core Team","year":"2008","unstructured":"R Development Core Team. (2008). R: a language and environment for statistical computing (Version 3.2.5). Vienna: R Foundation for Statistical Computing Retrieved from http:\/\/www.R-project.org."},{"key":"9373_CR70","doi-asserted-by":"publisher","DOI":"10.1201\/b17353","volume-title":"Robust cluster analysis and variable selection","author":"G Ritter","year":"2014","unstructured":"Ritter, G. (2014). Robust cluster analysis and variable selection. Passau: Chapman & Hall\/CRC."},{"key":"9373_CR71","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez, A., & Laio, A. (2014). Clustering by fast search and find of density peaks. Science, 344, 1492\u20131496.","journal-title":"Science"},{"key":"9373_CR72","volume-title":"Finding groups in data","author":"PJ Rousseeuw","year":"1990","unstructured":"Rousseeuw, P. J., & Kaufman, L. (1990). Finding groups in data. Brussels: Wiley."},{"key":"9373_CR73","first-page":"1015","volume-title":"Proceedings in computational statistics (Compstat)","author":"T Scharl","year":"2006","unstructured":"Scharl, T., & Leisch, F. (2006). The stochastic QT-clust algorithm: evaluation of stability and variance on time-course microarray data. In Proceedings in computational statistics (Compstat) (pp. 1015\u20131022). Heidelberg: Physica Verlag."},{"key":"9373_CR74","first-page":"1409","volume":"28","author":"RR Sokol","year":"1958","unstructured":"Sokol, R. R., & Michener, C. D. (1958). A statistical method for evaluating systematic relationships. Univ Kansas Science Bulletin, 28, 1409\u20131438.","journal-title":"Univ Kansas Science Bulletin"},{"key":"9373_CR75","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00357-007-0003-0","volume":"24","author":"D Steinley","year":"2007","unstructured":"Steinley, D., & Brusco, M. J. (2007). Initializing k-means batch clustering: a critical evaluation of several techniques. Journal of Classification, 24, 99\u2013121.","journal-title":"Journal of Classification"},{"key":"9373_CR76","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1080\/00273171.2012.673952","volume":"47","author":"D Steinley","year":"2012","unstructured":"Steinley, D., Brusco, M. J., & Henson, R. (2012). Principal cluster axes: a projection pursuit index for the preservation of cluster structures in the presence of data reduction. Multivariate Behavioral Research, 47, 463\u2013492.","journal-title":"Multivariate Behavioral Research"},{"key":"9373_CR77","volume-title":"Pattern recognition","author":"S Theodoridis","year":"2009","unstructured":"Theodoridis, S., & Koutroumbas, K. (2009). Pattern recognition. Montreal: Elsevier."},{"key":"9373_CR78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-658-20540-9","volume-title":"Projection based clustering through self-organization and swarm intelligence","author":"MC Thrun","year":"2018","unstructured":"Thrun, M. C. (2018). Projection based clustering through self-organization and swarm intelligence. Heidelberg: Springer."},{"key":"9373_CR79","doi-asserted-by":"crossref","unstructured":"Thrun, M.C., Gehlert, T., & Ultsch, A. (2020). Analyzing the fine structure of distributions. Preprint available at arXiv.org, PLOS ONE, in revision arXiv:1908.06081.","DOI":"10.1371\/journal.pone.0238835"},{"key":"9373_CR80","unstructured":"Thrun, M.C., Lerch, F., L\u00f6tsch, J., & Ultsch, A. (2016). Visualization and 3D printing of multivariate data of biomarkers. In International conference in Central Europe on computer graphics, visualization and computer vision (WSCG) (pp. 7\u201316). Plzen."},{"key":"9373_CR81","doi-asserted-by":"publisher","first-page":"105501","DOI":"10.1016\/j.dib.2020.105501","volume":"30 C","author":"MC Thrun","year":"2020","unstructured":"Thrun, M. C., & Ultsch, A. (2020a). Clustering benchmark datasets exploiting the fundamental clustering problems. Data in Brief, 30 C, 105501. https:\/\/doi.org\/10.1016\/j.dib.2020.105501.","journal-title":"Data in Brief"},{"key":"9373_CR82","doi-asserted-by":"publisher","unstructured":"Thrun, M. C., & Ultsch, A. (2020b). Swarm intelligence for self-organized clustering. Journal of Artificial Intelligence, 103237. https:\/\/doi.org\/10.1016\/j.artint.2020.103237.","DOI":"10.1016\/j.artint.2020.103237"},{"key":"9373_CR83","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1016\/j.csda.2010.02.009","volume":"54","author":"ME Timmerman","year":"2010","unstructured":"Timmerman, M. E., Ceulemans, E., Kiers, H. A., & Vichi, M. (2010). Factorial and reduced K-means reconsidered. Computational Statistics & Data Analysis, 54, 1858\u20131871.","journal-title":"Computational Statistics & Data Analysis"},{"key":"9373_CR84","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"WS Torgerson","year":"1952","unstructured":"Torgerson, W. S. (1952). Multidimensional scaling: I. Theory and method. Psychometrika, 17, 401\u2013419.","journal-title":"Psychometrika"},{"key":"9373_CR85","unstructured":"Tukey, J. W. (1977). Exploratory data analysis. Reading: United States Addison-Wesley Publishing Company."},{"key":"9373_CR86","doi-asserted-by":"crossref","unstructured":"Tung, A. K.., Han, J., Lakshmanan, L. V., & Ng, R.T. (2001). Constraint-based clustering in large databases. In Van den Bussche, J. & Vianu, V. (eds.), Proc. International Conference on Database Theory (ICDT) (Vol. 1973, pp. 405-419). Berlin, Heidelberg, London: Springer.","DOI":"10.1007\/3-540-44503-X_26"},{"key":"9373_CR87","unstructured":"Ultsch, A. (1995). Self organizing neural networks perform different from statistical k-means clustering. Proc. society for information and classification (GFKL) (Vol. 1995). Basel."},{"key":"9373_CR88","unstructured":"Ultsch, A. (2005a). Clustering wih SOM: U*C. In Proceedings of the 5th workshop on self-organizing maps (pp. 75\u201382), Paris, France."},{"key":"9373_CR89","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-26981-9_12","volume-title":"Innovations in classification, data science, and information systems","author":"A Ultsch","year":"2005","unstructured":"Ultsch, A. (2005b). Pareto density estimation: A density estimation for knowledge discovery. In D. BAIER & K. D. Werrnecke (Eds.), Innovations in classification, data science, and information systems (pp. 91\u2013100). Berlin, Germany: Springer."},{"key":"9373_CR90","first-page":"1","volume-title":"6th workshop on self-organizing maps (WSOM 07)","author":"A Ultsch","year":"2007","unstructured":"Ultsch, A. (2007). Emergence in self-organizing feature maps. In 6th workshop on self-organizing maps (WSOM 07) (pp. 1\u20137). Bielefeld, Germany: University Library of Bielefeld."},{"key":"9373_CR91","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-28518-4_3","volume-title":"Advances in self-organizing maps and learning vector quantization: proceedings of the 11th international workshop WSOM 2016, Houston, Texas, USA, January 6\u20138, 2016","author":"A Ultsch","year":"2016","unstructured":"Ultsch, A., Behnisch, M., & L\u00f6tsch, J. (2016). ESOM visualizations for quality assessment in clustering. In E. Mer\u00e9nyi, J. M. Mendenhall, & P. O\u2019Driscoll (Eds.), Advances in self-organizing maps and learning vector quantization: proceedings of the 11th international workshop WSOM 2016, Houston, Texas, USA, January 6\u20138, 2016 (pp. 39\u201348). Cham: Springer International Publishing."},{"key":"9373_CR92","unstructured":"Ultsch, A., & Herrmann, L. (2005). The architecture of emergent self-organizing maps to reduce projection errors. In Verleysen, M. (Ed.), Proc. European Symposium on Artificial Neural Networks (ESANN) (pp. 1\u20136). Belgium: Bruges."},{"key":"9373_CR93","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jbi.2016.12.011","volume":"66","author":"A Ultsch","year":"2017","unstructured":"Ultsch, A., & L\u00f6tsch, J. (2017). Machine-learned cluster identification in high-dimensional data. Journal of Biomedical Informatics, 66, 95\u2013104.","journal-title":"Journal of Biomedical Informatics"},{"key":"9373_CR94","first-page":"1","volume-title":"12th international workshop on self-organizing maps and learning vector quantization, clustering and data visualization (WSOM)","author":"A Ultsch","year":"2017","unstructured":"Ultsch, A., & Thrun, M. C. (2017). Credible visualizations for planar projections. In 12th international workshop on self-organizing maps and learning vector quantization, clustering and data visualization (WSOM) (pp. 1\u20135). Nany: IEEE."},{"key":"9373_CR95","unstructured":"Ultsch, A., & Vetter, C. (1995). Self organizing neural networks perform different from statistical k-means clustering Proc. Society for Information and Classification (GFKL) (Vol. 1995) Basel 8th-10th."},{"key":"9373_CR96","first-page":"66","volume":"10","author":"LJP van der Maaten","year":"2009","unstructured":"van der Maaten, L. J. P., Postma, E. O., & van den Herik, H. J. (2009). Dimensionality reduction: A comparative review. Journal of Machine Learning Research, 10, 66\u201371.","journal-title":"Journal of Machine Learning Research"},{"key":"9373_CR97","unstructured":"Van Dongen, S.M. (2000). Graph clustering by flow simulation. Utrecht, Netherlands: Ph.D. thesis University of Utrecht."},{"key":"9373_CR98","first-page":"451","volume":"11","author":"J Venna","year":"2010","unstructured":"Venna, J., Peltonen, J., Nybo, K., Aidos, H., & Kaski, S. (2010). Information retrieval perspective to nonlinear dimensionality reduction for data visualization. The Journal of Machine Learning Research, 11, 451\u2013490.","journal-title":"The Journal of Machine Learning Research"},{"key":"9373_CR99","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0167-9473(00)00064-5","volume":"37","author":"M Vichi","year":"2001","unstructured":"Vichi, M., & Kiers, H. A. L. (2001). Factorial k-means analysis for two-way data. Computational Statistics & Data Analysis, 37, 49\u201364.","journal-title":"Computational Statistics & Data Analysis"},{"key":"9373_CR100","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward Jr., J. H. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58, 236\u2013244.","journal-title":"Journal of the American Statistical Association"},{"key":"9373_CR101","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v021.i05","volume":"21","author":"R Wehrens","year":"2007","unstructured":"Wehrens, R., & Buydens, L. M. C. (2007). Self-and super-organizing maps in R: the Kohonen package. Journal of Statistical Software, 21, 1\u201319.","journal-title":"Journal of Statistical Software"},{"key":"9373_CR102","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1038\/ng.2764","volume":"45","author":"JN Weinstein","year":"2013","unstructured":"Weinstein, J. N., Collisson, E. A., Mills, G. B., Shaw, K. R. M., Ozenberger, B. A., Ellrott, K., Shmulevich, I., Sander, C., Stuart, J. M., & Cancer Genome Atlas Research Network. (2013). The cancer genome atlas pan-cancer analysis project. Nature Genetics, 45, 1113\u20131120.","journal-title":"Nature Genetics"},{"key":"9373_CR103","unstructured":"Wickham, H., & Stryjewski, L. (2011). 40 years of boxplots. The American Statistician."},{"key":"9373_CR104","doi-asserted-by":"publisher","first-page":"9193","DOI":"10.1073\/pnas.87.23.9193","volume":"87","author":"WH Wolberg","year":"1990","unstructured":"Wolberg, W. H., & Mangasarian, O. L. (1990). Multisurface method of pattern separation for medical diagnosis applied to breast cytology. Proceedings of the National Academy of Sciences of the United States of America, 87, 9193\u20139196.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"9373_CR105","volume-title":"Dependence of clustering algorithm performance on clustered-ness of data, technical report HPL-2000-137","author":"B Zhang","year":"2001","unstructured":"Zhang, B. (2001). Dependence of clustering algorithm performance on clustered-ness of data, technical report HPL-2000-137. Palo Alto: Hewlett-Packard Labs."}],"container-title":["Journal of Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-020-09373-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00357-020-09373-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-020-09373-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T03:49:26Z","timestamp":1723434566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00357-020-09373-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":105,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["9373"],"URL":"https:\/\/doi.org\/10.1007\/s00357-020-09373-2","relation":{},"ISSN":["0176-4268","1432-1343"],"issn-type":[{"value":"0176-4268","type":"print"},{"value":"1432-1343","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"20 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Dr. Cornelia Brendel, in accordance with the Declaration of Helsinki, obtained patient consent for this dataset and the Marburg local ethics board approved the study (No. 138\/16).","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}}]}}