{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T06:18:52Z","timestamp":1781849932604,"version":"3.54.5"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Machine Intell."],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1109\/tpami.2002.1017616","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T21:39:07Z","timestamp":1034977147000},"page":"881-892","source":"Crossref","is-referenced-by-count":4232,"title":["An efficient k-means clustering algorithm: analysis and implementation"],"prefix":"10.1109","volume":"24","author":[{"given":"T.","family":"Kanungo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"N.S.","family":"Netanyahu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.D.","family":"Piatko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Silverman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.Y.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0110-y"},{"key":"ref2","article-title":"An Efficient $\\big. k\\hbox{-}{\\rm{means}}\\bigr.$ Clustering Algorithm","volume-title":"Proc. First Workshop High Performance Data Mining","author":"Alsabti"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276718"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00022-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref6","article-title":"Some Fundamental Concepts and Synthesis Procedures for Pattern Recognition Preprocessors","volume-title":"Proc. Int\u2019l Conf. Microwaves, Circuit Theory, and Information Theory","author":"Ball"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref8","first-page":"585-592.","article-title":"Convergence Properties of the k-means Algorithms","volume-title":"Advances in Neural Information Processing Systems 7","author":"Bottou","year":"1995"},{"key":"ref9","first-page":"91","article-title":"Refining Initial Points for K-means Clustering","volume-title":"Proc. 15th Int\u2019l Conf. Machine Learning","author":"Bradley"},{"key":"ref10","first-page":"9","article-title":"Scaling Clustering Algorithms to Large Databases","volume-title":"Proc. Fourth Int\u2019l Conf. Knowledge Discovery and Data Mining","author":"Bradley"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90007-L"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(85)90053-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"ref14","first-page":"152","article-title":"A Two-Round Variant of EM for Gaussian Mixtures","volume-title":"Proc. 16th Conf. Uncertainty in Artificial Intelligence (UAI-2000)","author":"Dasgupta"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/s0036144599352836"},{"key":"ref16","volume-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"ref17","first-page":"94","article-title":"A Database Interface for Clustering in Large Spatial Databases","volume-title":"Proc. First Int\u2019l Conf. Knowledge Discovery and Data Mining (KDD-95)","author":"Ester"},{"key":"ref18","first-page":"138","article-title":"Clustering and the Continuous $\\big. k\\hbox{-}{\\rm{means}}\\bigr.$ Algorithm","volume":"22","author":"Faber","year":"1994","journal-title":"Los Alamos Science"},{"key":"ref19","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Fayyad","year":"1996"},{"key":"ref20","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller","year":"1968"},{"key":"ref21","first-page":"768,","article-title":"Cluster Analysis of Multivariate Data: Efficiency vs. Interpretability of Classification","volume":"21","author":"Forgey","year":"1965","journal-title":"Biometrics"},{"key":"ref22","volume-title":"Introduction to Statistical Pattern Recognition","author":"Fukunaga","year":"1990"},{"key":"ref23","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/237218.237406"},{"key":"ref27","first-page":"332","article-title":"Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based $\\big. k\\hbox{-}{\\rm{clustering}}\\bigr.$","volume-title":"Proc. 10th Ann. ACM Symp. Computational Geometry","author":"Inaba"},{"key":"ref28","volume-title":"Algorithms for Clustering Data","author":"Jain","year":"1988"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/34.824819"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref31","first-page":"S931-S932,","article-title":"Computing Nearest Neighbors for Moving Points and Applications to Clustering","volume-title":"Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms","author":"Kanungo"},{"key":"ref32","article-title":"The Analysis of a Simple $\\big. k\\hbox{-}{\\rm{means}}\\bigr.$ Clustering Algorithm","author":"Kanungo","year":"2000"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/336154.336189"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88163-3","volume-title":"Self-Organization and Associative Memory","author":"Kohonen","year":"1989"},{"key":"ref36","first-page":"362","article-title":"A Nearly Linear-Time Approximation Scheme for the Euclidean $\\big. k\\hbox{-}{\\rm{median}}\\bigr.$ Problem","volume-title":"Proc. Seventh Ann. European Symp. Algorithms","author":"Kolliopoulos"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref38","first-page":"281","article-title":"Some Methods for Classification and Analysis of Multivariate Observations","volume-title":"Proc. Fifth Berkeley Symp. Math. Statistics and Probability","volume":"1","author":"MacQueen"},{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/059\/06","article-title":"Analysis of Approximate Nearest Neighbor Searching with Clustered Point Sets","volume-title":"Proc. Workshop Algorithm Eng. and Experiments (ALENEX \u201999)","author":"Maneewongvatana"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009735908398"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010019"},{"key":"ref42","article-title":"Very Fast EM-Based Mixture Model Clustering Using Multiresolution kd-Trees","volume-title":"Proc. Conf. Neural Information Processing Systems","author":"Moore"},{"key":"ref43","article-title":"ANN: A Library for Approximate Nearest Neighbor Searching","volume-title":"Proc. Center for Geometric Computing Second Ann. Fall Workshop Computational Geometry","author":"Mount"},{"key":"ref44","first-page":"144","article-title":"Efficient and Effective Clustering Methods for Spatial Data Mining","volume-title":"Proc. 20th Int\u2019l Conf. Very Large Databases","author":"Ng"},{"key":"ref45","first-page":"277","article-title":"Accelerating Exact $\\big. k\\hbox{-}{\\rm{means}}\\bigr.$ Algorithms with Geometric Reasoning","volume-title":"Proc. ACM SIGKDD Int\u2019l Conf. Knowledge Discovery and Data Mining","author":"Pelleg"},{"key":"ref46","article-title":"$\\big. x\\hbox{-}{\\rm{means}}\\bigr.$: Extending $\\big. k\\hbox{-}{\\rm{means}}\\bigr.$ with Efficient Estimation of the Number of Clusters","volume-title":"Proc. 17th Int\u2019l Conf. Machine Learning","author":"Pelleg"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1214\/aop\/1176993713","article-title":"A Centeral Limit Theorem for $\\big. k\\hbox{-}{\\rm{means}}\\bigr.$ Clustering","volume":"10","author":"Pollard","year":"1982","journal-title":"Annals of Probability"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767478"},{"issue":"2","key":"ref50","first-page":"141","article-title":"BIRCH: A New Data Clustering Algorithm and Its Applications","volume-title":"Data Mining and Knowledge Discovery","volume":"1","author":"Zhang","year":"1997"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/34\/21893\/01017616.pdf?arnumber=1017616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:36:55Z","timestamp":1742017015000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1017616\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":49,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,7]]}},"URL":"https:\/\/doi.org\/10.1109\/tpami.2002.1017616","relation":{},"ISSN":["0162-8828"],"issn-type":[{"value":"0162-8828","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}