{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T18:03:09Z","timestamp":1707501789993},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"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":["Inf Retrieval"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s10791-005-5666-8","type":"journal-article","created":{"date-parts":[[2005,3,4]],"date-time":"2005-03-04T17:35:29Z","timestamp":1109957729000},"page":"331-349","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Data Driven Similarity Measures for k-Means Like Clustering Algorithms"],"prefix":"10.1007","volume":"8","author":[{"given":"Jacob","family":"Kogan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Teboulle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Nicholas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5666_CR1","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/moor.24.3.645","volume":"24","author":"A Auslender","year":"1999","unstructured":"Auslender A, Teboulle M and Ben\u2013Tiba S (1999) Interior proximal amd multiplier methods based on second order homogeneous kernels. Mathematics of Operations Research, 24:645\u2013668.","journal-title":"Mathematics of Operations Research"},{"key":"5666_CR2","doi-asserted-by":"crossref","unstructured":"Berkhin P and Becher JD (2002) Learning simple relations: Theory and applications. In: Proceedings of the Second SIAM International Conference on Data Mining.","DOI":"10.1137\/1.9781611972726.25"},{"key":"5666_CR3","unstructured":"Berry M and Browne M (1999) Understanding Search Engines. SIAM."},{"key":"5666_CR4","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas DP and Tsitsiklis JN (1989) Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, New Jersey."},{"key":"5666_CR5","doi-asserted-by":"crossref","unstructured":"Dempster A, Laird N and Rubin D (1977) Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39.","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"5666_CR6","unstructured":"Dhillon IS, Guan Y and Kogan J (2002) Refining clusters in high-dimensional text data. In: Proceedings of the Workshop on Clustering High Dimensional Data and its Applications (held in conjunction with the Second SIAM International Conference on Data Mining)."},{"key":"5666_CR7","doi-asserted-by":"crossref","unstructured":"Dhillon, IS, Kogan J and Nicholas C (2003) Feature selection and document clustering, In Berry MW Ed. A Comprehensive Survey of Text Mining, pp. 73\u2013100.","DOI":"10.1007\/978-1-4757-4305-0_4"},{"issue":"1","key":"5666_CR8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1007612920971","volume":"42","author":"IS Dhillon","year":"2001","unstructured":"Dhillon IS and Modha DS (2001) Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1):143\u2013175.","journal-title":"Machine Learning"},{"key":"5666_CR9","unstructured":"Duda RO, Hart PE and Stork DG (2000) Pattern Classification. John Wiley & Sons."},{"issue":"3","key":"5666_CR10","first-page":"768","volume":"21","author":"E Forgy","year":"1965","unstructured":"Forgy E (1965) Cluster analysis of multivariate Data: Efficiency vs. interpretability of classifications. Biometrics, 21(3):768.","journal-title":"Biometrics"},{"key":"5666_CR11","doi-asserted-by":"crossref","unstructured":"Inderjit S. Dhillon Subramanyam Mallela and Rahul Kumar (2002) Enhanced word clustering for hierarchical text classification. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD-2002), pp. 191\u2013200.","DOI":"10.1145\/775047.775076"},{"key":"5666_CR12","unstructured":"Kogan J (2001) Clustering large unstructured document sets. In: Berry MW Ed. Computational Information Retrieval, pp. 107\u2013117."},{"key":"5666_CR13","unstructured":"Kogan J (2001) Means clustering for text data. In: Proceedings of the Workshop on Text Mining at the First SIAM International Conference on Data Mining, pp. 47\u201354."},{"key":"5666_CR14","unstructured":"Kogan J, Teboulle M and Nicholas C (2003) Optimization approach to generating families of k-means like algorithms. In: Proceedings of the Workshop on Clustering High Dimensional Data and its Applications (held in conjunction with the Third SIAM International Conference on Data Mining)."},{"key":"5666_CR15","unstructured":"Kogan J, Teboulle M and Nicholas C (2003) The entropic geometric means algorithm: An approach for building small clusters for large text datasets. In: Proceedings of the Workshop on Clustering Large Data Sets (held in conjunction with the Third IEEE International Conference on Data Mining), pp. 63\u201371."},{"key":"5666_CR16","unstructured":"Lei Xu and Michael I. Jordan (1995) On convergence properties of the EM Algorithm for Gaussian Mixtures. MIT A.I. Memo No. 1520, C.B.C.L. paper No. 111."},{"key":"5666_CR17","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex Analysis Princeton University Press, Princeton, NJ."},{"key":"5666_CR18","unstructured":"Teboulle M (1992) On \u03d5-divergence and its applications. In: Phillips FY and Rousseau J Eds. Systems and Management Science by Extremal Methods\u2013Research Honoring Abraham Charnes at Age 70, Kluwer Academic Publishers, pp. 255\u2013273."},{"key":"5666_CR19","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1137\/S1052623495292130","volume":"7","author":"M Teboulle","year":"1997","unstructured":"Teboulle M (1997) Convergence of proximal-like algorithms. SIAM J. of Optimization, 7:1069-1083.","journal-title":"SIAM J. of Optimization"}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-005-5666-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-005-5666-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-005-5666-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-005-5666-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:06:27Z","timestamp":1704204387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-005-5666-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["5666"],"URL":"https:\/\/doi.org\/10.1007\/s10791-005-5666-8","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}