{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T08:16:59Z","timestamp":1772093819256,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819549719","type":"print"},{"value":"9789819549726","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T00:00:00Z","timestamp":1764201600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T00:00:00Z","timestamp":1764201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-4972-6_4","type":"book-chapter","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T08:08:51Z","timestamp":1764144531000},"page":"43-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coordinate-Free k-Means Clustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6749-0567","authenticated-orcid":false,"given":"Dan C.","family":"Popescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-1179","authenticated-orcid":false,"given":"Philip","family":"Kilby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,27]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","volume":"8","author":"KP Sinaga","year":"2023","unstructured":"Sinaga, K.P., Yang, M.S.: Unsupervised K-means clustering algorithm. IEEE Access 8, 80716\u201380727 (2023)","journal-title":"IEEE Access"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"3433","DOI":"10.1109\/TKDE.2022.3155450","volume":"35","author":"F Nie","year":"2023","unstructured":"Nie, F., Li, Z., Wang, R., Li, X.: An effective and efficient algorithm for K-means clustering with new formulation. IEEE Trans. Knowl. Data Eng. 35(4), 3433\u20133433 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"8","key":"4_CR4","doi-asserted-by":"publisher","first-page":"11077","DOI":"10.1109\/TNNLS.2023.3248064","volume":"35","author":"D Cheng","year":"2024","unstructured":"Cheng, D., Huang, J., Zhang, S., Xia, S., Wang, G., Xie, J.: K-means clustering with natural density peaks for discovering arbitrary-shaped clusters. IEEE Trans. Neural Netw. Learn. Sys. 35(8), 11077\u201311090 (2024)","journal-title":"IEEE Trans. Neural Netw. Learn. Sys."},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley-Interscience. John Wiley & Sons, Hoboken (1990)"},{"key":"4_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/b15410","volume-title":"Data Clustering: Algorithms and Application","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal, C.C., Reddy, C.K.: Data Clustering: Algorithms and Application. Chapman & Hall, CRC Press, Boca Raton (2013)"},{"key":"4_CR7","volume-title":"Handbook of Cluster Analysis","author":"M Meila","year":"2015","unstructured":"Meila, M., Murtagh, F., Henig, C., Rocci, R.: Handbook of Cluster Analysis. Chapman and Hall, CRC Press, New York (2015)"},{"key":"4_CR8","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer Series in Statistics. Springer, Heidelberg (2017)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"119596","DOI":"10.1109\/ACCESS.2023.3327640","volume":"11","author":"SM Miraftabzadeh","year":"2023","unstructured":"Miraftabzadeh, S.M., Colombo, C.G., Longo, M., Foiadelli, F.: K-means and alternative clustering methods in modern power systems. IEEE Access 11, 119596\u2013119633 (2023)","journal-title":"IEEE Access"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1080\/00029890.2003.11919989","volume":"110","author":"TM Apostol","year":"2003","unstructured":"Apostol, T.M., Mnatsakanian, M.A.: Sums of squares of distances in $$m$$-space. Amer. Math. Monthly 110, 516\u2013526 (2003)","journal-title":"Amer. Math. Monthly"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"787","DOI":"10.2307\/1968835","volume":"30","author":"IJ Schoenberg","year":"1937","unstructured":"Schoenberg, I.J.: On certain metric spaces arising from Euclidean spaces by a change of metric and their imbedding in Hilbert spaces. Ann. Math. 30, 787\u2013793 (1937)","journal-title":"Ann. Math."},{"issue":"1","key":"4_CR12","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm AS 136: a K-means clustering algorithm. J. R. Stat. Soc. Ser. C (Appl. Stat.) 28(1), 100\u2013108 (1979)","journal-title":"J. R. Stat. Soc. Ser. C (Appl. Stat.)"},{"key":"4_CR13","first-page":"820","volume":"9","author":"M Telgarski","year":"2010","unstructured":"Telgarski, M., Vattani, A.: Hartigan\u2019s method: k-means clustering without voronoi. J. Mach. Learn. Res. 9, 820\u2013827 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR14","unstructured":"Szalkai, B.: Generalizing k-means for an arbitrary distance matrix. arXiv preprint (2013)"},{"key":"4_CR15","unstructured":"Szalkai, B.: An implementation of the relational k-means algorithm. arXiv preprint (2013)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 193\u2013218 (1985)","journal-title":"J. Classif."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-04277-5_18","volume-title":"Artificial Neural Networks \u2013 ICANN 2009","author":"JM Santos","year":"2009","unstructured":"Santos, J.M., Embrechts, M.: On the use of the adjusted rand index as a metric for evaluating supervised classification. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds.) ICANN 2009. LNCS, vol. 5769, pp. 175\u2013184. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04277-5_18"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TSMC.1987.4309069","volume":"17","author":"TO Kvalseth","year":"1987","unstructured":"Kvalseth, T.O.: Entropy and correlation: some comments. IEEE Trans. Syst. Man Cybern. 17, 517\u2013519 (1987)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1007\/s10115-018-1278-7","volume":"61","author":"VHA Soares","year":"2019","unstructured":"Soares, V.H.A., Campello, R.J.G.B., Nourashrafeddin, S., Milios, E., Naldi, M.C.: Combining semantic and term frequency similarities for text clustering. Knowl. Inf. Syst. 61(3), 1485\u20131516 (2019). https:\/\/doi.org\/10.1007\/s10115-018-1278-7","journal-title":"Knowl. Inf. Syst."},{"key":"4_CR20","first-page":"732","volume":"49","author":"LA Goodman","year":"1954","unstructured":"Goodman, L.A., Kruskal, W.H.: Measures of association for cross classifications. J. Am. Stat. Assoc. 49, 732\u2013764 (1954)","journal-title":"J. Am. Stat. Assoc."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"A Ernst","year":"1996","unstructured":"Ernst, A., Krishnamoorthy, M.: Efficient algorithm for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4, 139\u2013154 (1996)","journal-title":"Locat. Sci."},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighbourhood search for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","volume":"28","author":"P Franti","year":"2006","unstructured":"Franti, P., Virmajoki, O., Hautamaki, V.: Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans. Pattern Anal. Mach. Intell. 28, 1875\u20131881 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","AI 2025: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4972-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T07:23:37Z","timestamp":1772090617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4972-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,27]]},"ISBN":["9789819549719","9789819549726"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4972-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,27]]},"assertion":[{"value":"27 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canberra, ACT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}