{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:51:19Z","timestamp":1764784279769,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T00:00:00Z","timestamp":1564704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T00:00:00Z","timestamp":1564704000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003065","name":"University of Vienna","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003065","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":[[2020,2]]},"DOI":"10.1007\/s10115-019-01388-5","type":"journal-article","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T17:02:57Z","timestamp":1564765377000},"page":"457-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Dataset-Transformation: improving clustering by enhancing the structure with DipScaling and DipTransformation"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1298-6535","authenticated-orcid":false,"given":"Benjamin","family":"Schelling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Plant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,2]]},"reference":[{"key":"1388_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Wolf JL, Yu PS, Procopiuc C, Park JS (1999) Fast algorithms for projected clustering, In: Proceedings of the 1999 ACM SIGMOD international conference on management of data, SIGMOD \u201999, ACM, New York, NY, pp 61\u201372","DOI":"10.1145\/304182.304188"},{"key":"1388_CR2","doi-asserted-by":"crossref","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 1998 ACM SIGMOD international conference on management of data, SIGMOD \u201998, ACM, New York, NY, pp 94\u2013105","DOI":"10.1145\/276304.276314"},{"key":"1388_CR3","unstructured":"Arthur D, Vassilvitskii S (2007) K-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA \u201907, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 1027\u20131035"},{"key":"1388_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Plant C, Shao J, Yang Q (2010) Clustering by synchronization, In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201910, ACM, New York, NY, USA, pp 583\u2013592","DOI":"10.1145\/1835804.1835879"},{"key":"1388_CR5","doi-asserted-by":"crossref","unstructured":"Chamalis T, Likas A (2018) The projected dip-means clustering algorithm. In: Proceedings of the 10th Hellenic conference on artificial intelligence, SETN \u201918, pp 14:1\u201314:7","DOI":"10.1145\/3200947.3201008"},{"key":"1388_CR6","unstructured":"Chawla S, Gionis A (2013) k-means: a unified approach to clustering and outlier detection, In: Proceedings of the 13th SIAM international conference on data mining, May 2-4, 2013. Austin, Texas, USA, pp 189\u2013197"},{"issue":"1","key":"1388_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J R Stat Soc Ser B 39(1):1\u201338","journal-title":"J R Stat Soc Ser B"},{"key":"1388_CR8","unstructured":"Dua D, Graff C (2019) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"1388_CR9","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise, In: Proceedings of the second international conference on knowledge discovery and data mining, KDD\u201996, AAAI Press, pp 226\u2013231"},{"key":"1388_CR10","doi-asserted-by":"crossref","unstructured":"Goebl S, He X, Plant C, B\u00f6hm C (2014) Finding the optimal subspace for clustering. In: Proceedings of the 2014 IEEE international conference on data mining, ICDM \u201914, pp 130\u2013139","DOI":"10.1109\/ICDM.2014.34"},{"key":"1388_CR11","doi-asserted-by":"crossref","DOI":"10.1201\/9780429246579","volume-title":"A handbook of small data sets","author":"DJ Hand","year":"1993","unstructured":"Hand DJ, Daly F, McConway K, Lunn D, Ostrowski E (1993) A handbook of small data sets. Chapman and Hall, London"},{"issue":"1","key":"1388_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1214\/aos\/1176346577","volume":"13","author":"JA Hartigan","year":"1985","unstructured":"Hartigan JA, Hartigan PM (1985) The dip test of unimodality. Ann Stat 13(1):70\u201384","journal-title":"Ann Stat"},{"issue":"1","key":"1388_CR13","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H-P Kriegel","year":"2009","unstructured":"Kriegel H-P, Kr\u00f6ger P, Zimek A (2009) Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Discov Data 3(1):1:1\u20131:58","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1388_CR14","doi-asserted-by":"crossref","unstructured":"Maurus S, Plant C (2016) Skinny-dip: clustering in a sea of noise. In: Proceedings of the 22Nd ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201916, pp 1055\u20131064","DOI":"10.1145\/2939672.2939740"},{"key":"1388_CR15","doi-asserted-by":"crossref","unstructured":"Mautz D, Ye W, Plant C, B\u00f6hm C (2017) Towards an optimal subspace for k-means. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201917, pp 365\u2013373","DOI":"10.1145\/3097983.3097989"},{"key":"1388_CR16","first-page":"849","volume-title":"Advances in neural information processing systems 14","author":"AY Ng","year":"2002","unstructured":"Ng AY, Jordan MI, Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: Dietterich TG, Becker S, Ghahramani Z (eds) Advances in neural information processing systems 14. MIT Press, Cambridge, pp 849\u2013856"},{"key":"1388_CR17","unstructured":"Pelleg D, Moore A (2000) X-means: extending k-means with efficient estimation of the number of clusters. In: Proceedings of the 17th international conference on machine learning, Morgan Kaufmann, pp 727\u2013734"},{"issue":"1","key":"1388_CR18","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson R (1973) Slink: an optimally efficient algorithm for the single-link cluster method. Comput J 16(1):30\u201334","journal-title":"Comput J"},{"key":"1388_CR19","doi-asserted-by":"crossref","unstructured":"Siffer A, Fouque P-A, Termier A, Largou\u00ebt C (2018) Are your data gathered? In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201918, pp 2210\u20132218","DOI":"10.1145\/3219819.3219994"},{"key":"1388_CR20","first-page":"2579","volume":"9","author":"L Van der Maaten","year":"2008","unstructured":"Van der Maaten L, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579\u20132605","journal-title":"J Mach Learn Res"},{"key":"1388_CR21","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:2837\u20132854","journal-title":"J Mach Learn Res"},{"key":"1388_CR22","unstructured":"Xie J, Girshick R, Farhadi A (2016) Unsupervised deep embedding for clustering analysis. In: Balcan MF, Weinberger KQ (eds) Proceedings of the 33rd international conference on machine learning, vol 48 of Proceedings of Machine Learning Research, PMLR, New York, New York, USA, pp 478\u2013487"},{"key":"1388_CR23","unstructured":"Yang B, Fu X, Sidiropoulos ND, Hong M (2017) Towards k-means-friendly spaces: simultaneous deep learning and clustering. In: Proceedings of the 34th international conference on machine learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp 3861\u20133870"},{"key":"1388_CR24","doi-asserted-by":"crossref","unstructured":"Yang C, Zhang X, Jiao L, Wang G (2008) Self-tuning semi-supervised spectral clustering. In: 2008 international conference on computational intelligence and security, CIS 2008, 13\u201317 December 2008, Suzhou, China, volume 1, conference papers, pp 1\u20135","DOI":"10.1109\/CIS.2008.141"},{"key":"1388_CR25","doi-asserted-by":"crossref","unstructured":"Ye W, Goebl S, Plant C, B\u00f6hm C (2016) Fuse: full spectral clustering. In: Proceedings of the 22Nd ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201916, ACM, New York, NY, USA, pp 1985\u20131994","DOI":"10.1145\/2939672.2939845"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01388-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-019-01388-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01388-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T17:04:04Z","timestamp":1721581444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-019-01388-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,2]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["1388"],"URL":"https:\/\/doi.org\/10.1007\/s10115-019-01388-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2019,8,2]]},"assertion":[{"value":"4 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}