{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T16:25:18Z","timestamp":1790007918316,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3097989","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"365-373","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Towards an Optimal Subspace for K-Means"],"prefix":"10.1145","author":[{"given":"Dominik","family":"Mautz","sequence":"first","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Ye","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudia","family":"Plant","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"B\u00f6hm","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304188"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335383"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276314"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 1027--1035","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii 2007 . k-means: The advantages of careful seeding . In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 1027--1035 . David Arthur and Sergei Vassilvitskii 2007. k-means: The advantages of careful seeding. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 1027--1035."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Christian B\u00f6hm Karin Kailing Peer Kr\u00f6ger and Arthur Zimek 2004. Computing clusters of correlation connected objects Proceedings of the 2004 ACM SIGMOD international conference on Management of data. ACM 455--466. Christian B\u00f6hm Karin Kailing Peer Kr\u00f6ger and Arthur Zimek 2004. Computing clusters of correlation connected objects Proceedings of the 2004 ACM SIGMOD international conference on Management of data. ACM 455--466.","DOI":"10.1145\/1007568.1007620"},{"key":"e_1_3_2_2_7_1","volume-title":"Mining Massive Vector Data on Single Instruction Multiple Data Microarchitectures Data Mining Workshop (ICDMW), 2015 IEEE International Conference on. IEEE, 597--606","author":"B\u00f6hm Christian","year":"2015","unstructured":"Christian B\u00f6hm and Claudia Plant 2015 . Mining Massive Vector Data on Single Instruction Multiple Data Microarchitectures Data Mining Workshop (ICDMW), 2015 IEEE International Conference on. IEEE, 597--606 . Christian B\u00f6hm and Claudia Plant 2015. Mining Massive Vector Data on Single Instruction Multiple Data Microarchitectures Data Mining Workshop (ICDMW), 2015 IEEE International Conference on. IEEE, 597--606."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143875"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014118"},{"key":"e_1_3_2_2_10_1","volume-title":"Adaptive dimension reduction using discriminant analysis and k-means clustering Proceedings of the 24th international conference on Machine learning. ACM, 521--528","author":"Ding Chris","unstructured":"Chris Ding and Tao Li. 2007. Adaptive dimension reduction using discriminant analysis and k-means clustering Proceedings of the 24th international conference on Machine learning. ACM, 521--528 . Chris Ding and Tao Li. 2007. Adaptive dimension reduction using discriminant analysis and k-means clustering Proceedings of the 24th international conference on Machine learning. ACM, 521--528."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Joseph C Dunn. 1973. A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. (1973). Joseph C Dunn. 1973. A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. (1973).","DOI":"10.1080\/01969727308546046"},{"key":"e_1_3_2_2_12_1","volume-title":"Using the triangle inequality to accelerate k-means ICML","author":"Elkan Charles","unstructured":"Charles Elkan . 2003. Using the triangle inequality to accelerate k-means ICML , Vol. Vol. 3 . 147--153. Charles Elkan. 2003. Using the triangle inequality to accelerate k-means ICML, Vol. Vol. 3. 147--153."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.34"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.12"},{"key":"e_1_3_2_2_16_1","unstructured":"Greg Hamerly and Charles Elkan 2004. Learning the k in k-means. (2004). Greg Hamerly and Charles Elkan 2004. Learning the k in k-means. (2004)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(00)00026-5"},{"key":"e_1_3_2_2_18_1","volume-title":"Algorithms for clustering data","author":"Jain Anil K","unstructured":"Anil K Jain and Richard C Dubes 1988. Algorithms for clustering data . Prentice-Hall, Inc. Anil K Jain and Richard C Dubes 1988. Algorithms for clustering data. Prentice-Hall, Inc."},{"key":"e_1_3_2_2_19_1","volume-title":"Principal component analysis","author":"Jolliffe Ian","unstructured":"Ian Jolliffe . 2002. Principal component analysis . Wiley Online Library . Ian Jolliffe. 2002. Principal component analysis. Wiley Online Library."},{"key":"e_1_3_2_2_20_1","volume-title":"Proceedings of the 23rd International Conference on Machine Learning","author":"Kulis Brian","year":"2012","unstructured":"Brian Kulis and Michael I Jordan 2012 . Revisiting k-means: New algorithms via Bayesian nonparametrics . In Proceedings of the 23rd International Conference on Machine Learning (2012). Brian Kulis and Michael I Jordan 2012. Revisiting k-means: New algorithms via Bayesian nonparametrics. In Proceedings of the 23rd International Conference on Machine Learning (2012)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_2_22_1","volume-title":"Chris HQ Ding, and Heng Huang","author":"Luo Dijun","year":"2011","unstructured":"Dijun Luo , Chris HQ Ding, and Heng Huang 2011 . Linear Discriminant Analysis: New Formulations and Overfit Analysis. AAAI. Dijun Luo, Chris HQ Ding, and Heng Huang 2011. Linear Discriminant Analysis: New Formulations and Overfit Analysis. AAAI."},{"key":"e_1_3_2_2_23_1","volume-title":"Very fast EM-based mixture model clustering using multiresolution kd-trees. Advances in Neural information processing systems","author":"Moore Andrew W","year":"1999","unstructured":"Andrew W Moore . 1999. Very fast EM-based mixture model clustering using multiresolution kd-trees. Advances in Neural information processing systems ( 1999 ), 543--549. Andrew W Moore. 1999. Very fast EM-based mixture model clustering using multiresolution kd-trees. Advances in Neural information processing systems (1999), 543--549."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Dan Pelleg and Andrew Moore 1999. Accelerating exact k-means algorithms with geometric reasoning Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM 277--281. Dan Pelleg and Andrew Moore 1999. Accelerating exact k-means algorithms with geometric reasoning Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM 277--281.","DOI":"10.1145\/312129.312248"},{"key":"e_1_3_2_2_25_1","volume-title":"ICML","volume":"1","author":"Pelleg Dan","year":"2000","unstructured":"Dan Pelleg , Andrew W Moore , and others 2000 . X-means: Extending K-means with Efficient Estimation of the Number of Clusters . ICML , Vol. Vol. 1 . Dan Pelleg, Andrew W Moore, and others 2000. X-means: Extending K-means with Efficient Estimation of the Number of Clusters. ICML, Vol. Vol. 1."},{"key":"e_1_3_2_2_26_1","volume-title":"Acceleration of k-means and related clustering algorithms Workshop on Algorithm Engineering and Experimentation","author":"Phillips Steven J","unstructured":"Steven J Phillips . 2002. Acceleration of k-means and related clustering algorithms Workshop on Algorithm Engineering and Experimentation . Springer , 166--177. Steven J Phillips. 2002. Acceleration of k-means and related clustering algorithms Workshop on Algorithm Engineering and Experimentation. Springer, 166--177."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020217"},{"key":"e_1_3_2_2_28_1","volume-title":"KDD workshop on text mining","volume":"400","author":"Steinbach Michael","year":"2000","unstructured":"Michael Steinbach , George Karypis , Vipin Kumar , and others. 2000 . A comparison of document clustering techniques . In KDD workshop on text mining , Vol. Vol. 400 . Boston, 525--526. Michael Steinbach, George Karypis, Vipin Kumar, and others. 2000. A comparison of document clustering techniques. In KDD workshop on text mining, Vol. Vol. 400. Boston, 525--526."},{"key":"e_1_3_2_2_29_1","volume-title":"Vin De Silva, and John C Langford","author":"Tenenbaum Joshua B","year":"2000","unstructured":"Joshua B Tenenbaum , Vin De Silva, and John C Langford . 2000 . A global geometric framework for nonlinear dimensionality reduction. science, Vol. 290 , 5500 (2000), 2319--2323. Joshua B Tenenbaum, Vin De Silva, and John C Langford. 2000. A global geometric framework for nonlinear dimensionality reduction. science, Vol. 290, 5500 (2000), 2319--2323."},{"key":"e_1_3_2_2_30_1","volume-title":"Bayesian K-Means as a\" Maximization-Expectation\" Algorithm","author":"Welling Max","unstructured":"Max Welling and Kenichi Kurihara 2006. Bayesian K-Means as a\" Maximization-Expectation\" Algorithm . SDM. SIAM , 474--478. Max Welling and Kenichi Kurihara 2006. Bayesian K-Means as a\" Maximization-Expectation\" Algorithm. SDM. SIAM, 474--478."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems","author":"Ye Jieping","year":"2007","unstructured":"Jieping Ye , Zheng Zhao , and Mingrui Wu 2007 . Discriminative K-means for Clustering. In Advances in Neural Information Processing Systems 20 , Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems , Vancouver, British Columbia, Canada , December 3-6, 2007. 1649--1656. http:\/\/papers.nips.cc\/paper\/3176-discriminative-k-means-for-clustering Jieping Ye, Zheng Zhao, and Mingrui Wu 2007. Discriminative K-means for Clustering. In Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 3-6, 2007. 1649--1656. http:\/\/papers.nips.cc\/paper\/3176-discriminative-k-means-for-clustering"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3097989","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3097989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T20:37:25Z","timestamp":1750797445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3097989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":32,"alternative-id":["10.1145\/3097983.3097989","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3097989","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}