{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T05:27:54Z","timestamp":1770701274220,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,2,24]],"date-time":"2014-02-24T00:00:00Z","timestamp":1393200000000},"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":[[2014,2,24]]},"DOI":"10.1145\/2556195.2556260","type":"proceedings-article","created":{"date-parts":[[2014,2,18]],"date-time":"2014-02-18T14:10:41Z","timestamp":1392732641000},"page":"233-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Scalable K-Means by ranked retrieval"],"prefix":"10.1145","author":[{"given":"Andrei","family":"Broder","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lluis","family":"Garcia-Pueyo","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vanja","family":"Josifovski","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srihari","family":"Venkatesan","sequence":"additional","affiliation":[{"name":"xAd, Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,2,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Streaming k-means approximation","author":"Ailon N.","year":"2009","unstructured":"N. Ailon , R. Jaiswal , and C. Monteleoni . Streaming k-means approximation . In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, NIPS 22. 2009 . N. Ailon, R. Jaiswal, and C. Monteleoni. Streaming k-means approximation. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, NIPS 22. 2009."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2027216.2027217"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137880"},{"key":"e_1_3_2_1_5_1","volume-title":"K-means: the advantages of careful seeding","author":"Arthur D.","year":"2007","unstructured":"D. Arthur and S. Vassilvitskii . K-means: the advantages of careful seeding . In N. Bansal, K. Pruhs, and C. Stein, editors, SODA. SIAM , 2007 . D. Arthur and S. Vassilvitskii. K-means: the advantages of careful seeding. In N. Bansal, K. Pruhs, and C. Stein, editors, SODA. SIAM, 2007."},{"key":"e_1_3_2_1_6_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R. A.","year":"1999","unstructured":"R. A. Baeza-Yates and B. Ribeiro-Neto . Modern Information Retrieval . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 1999 . R. A. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_9_1","volume-title":"Dynamic Programming","author":"Bellman R. E.","year":"1957","unstructured":"R. E. Bellman . Dynamic Programming . Princeton University Press , Princeton, NJ, USA , 1957 . R. E. Bellman. Dynamic Programming. Princeton University Press, Princeton, NJ, USA, 1957."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133039"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277783"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780548"},{"key":"e_1_3_2_1_14_1","first-page":"147","volume-title":"ICML","author":"Elkan C.","year":"2003","unstructured":"C. Elkan . Using the triangle inequality to accelerate k-means . In ICML , pages 147 -- 153 , 2003 . C. Elkan. Using the triangle inequality to accelerate k-means. In ICML, pages 147--153, 2003."},{"key":"e_1_3_2_1_15_1","volume-title":"Evaluation strategies for top-k queries over memory-resident inverted indexes. PVLDB, 4(11)","author":"Fontoura M.","year":"2011","unstructured":"M. Fontoura , V. Josifovski , J. Liu , S. Venkatesan , X. Zhu , and J. Y. Zien . Evaluation strategies for top-k queries over memory-resident inverted indexes. PVLDB, 4(11) , 2011 . M. Fontoura, V. Josifovski, J. Liu, S. Venkatesan, X. Zhu, and J. Y. Zien. Evaluation strategies for top-k queries over memory-resident inverted indexes. PVLDB, 4(11), 2011."},{"key":"e_1_3_2_1_16_1","volume-title":"Apache mahout","author":"Foundation A. S.","year":"2010","unstructured":"A. S. Foundation , I. Drost , T. Dunning , J. Eastman , O. Gospodnetic , G. Ingersoll , J. Mannix , S. Owen , and K. Wettin . Apache mahout , 2010 . http:\/\/mloss.org\/software\/view\/144\/. A. S. Foundation, I. Drost, T. Dunning, J. Eastman, O. Gospodnetic, G. Ingersoll, J. Mannix, S. Owen, and K. Wettin. Apache mahout, 2010. http:\/\/mloss.org\/software\/view\/144\/."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796588"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499145_99"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-005-0210-0"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.03.003"},{"key":"e_1_3_2_1_22_1","volume-title":"Efficiency Issues in Information Retrieval Workshop; European Conference for Information Retrieval","author":"Lacour P.","year":"2008","unstructured":"P. Lacour , C. Macdonald , and I. Ounis . Efficiency comparison of document matching techniques . In Efficiency Issues in Information Retrieval Workshop; European Conference for Information Retrieval , 2008 . P. Lacour, C. Macdonald, and I. Ounis. Efficiency comparison of document matching techniques. In Efficiency Issues in Information Retrieval Workshop; European Conference for Information Retrieval, 2008."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11581062_37"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875567"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/237496.237497"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007731"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312248"},{"key":"e_1_3_2_1_29_1","first-page":"727","volume-title":"In Proceedings of the 17th International Conf. on Machine Learning","author":"Pelleg D.","year":"2000","unstructured":"D. Pelleg and A. Moore . X-means: Extending k-means with efficient estimation of the number of clusters . In In Proceedings of the 17th International Conf. on Machine Learning , pages 727 -- 734 . Morgan Kaufmann , 2000 . D. Pelleg and A. Moore. X-means: Extending k-means with efficient estimation of the number of clusters. In In Proceedings of the 17th International Conf. on Machine Learning, pages 727--734. Morgan Kaufmann, 2000."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772862"},{"key":"e_1_3_2_1_31_1","first-page":"2375","volume-title":"Advances in Neural Information Processing Systems 24","author":"Shindler M.","year":"2011","unstructured":"M. Shindler , A. Wong , and A. W. Meyerson . Fast and accurate k-means for large datasets. In J. Shawe-Taylor, R. Zemel, P. Bartlett, F. Pereira, and K. Weinberger, editors , Advances in Neural Information Processing Systems 24 , pages 2375 -- 2383 . 2011 . M. Shindler, A. Wong, and A. W. Meyerson. Fast and accurate k-means for large datasets. In J. Shawe-Taylor, R. Zemel, P. Bartlett, F. Pereira, and K. Weinberger, editors, Advances in Neural Information Processing Systems 24, pages 2375--2383. 2011."},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. AAAI Workshop on AI for Web Search (AAAI 2000","author":"Strehl A.","year":"2000","unstructured":"A. Strehl , J. Ghosh , and R. J. Mooney . Impact of similarity measures on web-page clustering . In Proc. AAAI Workshop on AI for Web Search (AAAI 2000 ), Austin, pages 58--64. AAAI\/MIT Press , July 2000 . A. Strehl, J. Ghosh, and R. J. Mooney. Impact of similarity measures on web-page clustering. In Proc. AAAI Workshop on AI for Web Search (AAAI 2000), Austin, pages 58--64. AAAI\/MIT Press, July 2000."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-011-9340-1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"WSDM 2014: Seventh ACM International Conference on Web Search and Data Mining","location":"New York New York USA","acronym":"WSDM 2014","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 7th ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2556195.2556260","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2556195.2556260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:51Z","timestamp":1750232091000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2556195.2556260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,24]]},"references-count":35,"alternative-id":["10.1145\/2556195.2556260","10.1145\/2556195"],"URL":"https:\/\/doi.org\/10.1145\/2556195.2556260","relation":{},"subject":[],"published":{"date-parts":[[2014,2,24]]},"assertion":[{"value":"2014-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}