{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T15:04:02Z","timestamp":1794495842269,"version":"4.9.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319149974","type":"print"},{"value":"9783319149981","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-14998-1_17","type":"book-chapter","created":{"date-parts":[[2015,4,2]],"date-time":"2015-04-02T14:57:00Z","timestamp":1427986620000},"page":"373-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Fast Approximate $$K$$-Means via Cluster Closures"],"prefix":"10.1007","author":[{"given":"Jingdong","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qifa","family":"Ke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shipeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,4,1]]},"reference":[{"key":"17_CR1","unstructured":"Boutsidis C, Zouzias A, Drineas P (2010) Random projections for $$k$$-means clustering. CoRR. abs\/1011.4632"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TPAMI.2009.166","volume":"32","author":"O Chum","year":"2010","unstructured":"Chum O, Matas J (2010) Large-scale discovery of spatially related images. IEEE PAMI 32(2):371\u2013377","journal-title":"IEEE PAMI"},{"key":"17_CR3","unstructured":"Elkan C (2003) Using the triangle inequality to accelerate $$k$$-means. In: ICML"},{"key":"17_CR4","unstructured":"Fei-Fei L, Fergus R, Perona P (2004) Learning generative visual models from few training examples: an incremental Bayesian approach tested on 101 object categories. In: CVPR workshop on generative-model based vision"},{"key":"17_CR5","unstructured":"Fern XZ, Brodley CE (2003) Random projection for high dimensional data clustering: a cluster ensemble approach. In: ICML, pp 186\u2013193"},{"key":"17_CR6","first-page":"768","volume":"21","author":"EW Forgy","year":"1965","unstructured":"Forgy EW (1965) Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21:768\u2013780","journal-title":"Biometrics"},{"issue":"6","key":"17_CR7","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1142\/S0218195908002787","volume":"18","author":"G Frahling","year":"2008","unstructured":"Frahling G, Sohler C (2008) A fast $$k$$-means implementation using coresets. Int J Comput Geom Appl 18(6):605\u2013625","journal-title":"Int J Comput Geom Appl"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. IEEE PAMI 33(1):117\u2013128","journal-title":"IEEE PAMI"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Kanungo T, Mount DM, Netanyahu NS, Piatko CD, Silverman R, Angela YW (2002) An efficient $$k$$-means clustering algorithm: analysis and implementation. IEEE PAMI 24(7): 881\u2013892","DOI":"10.1109\/TPAMI.2002.1017616"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos C (1950) An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J Res Natl Bur Stand 45(4):255\u2013282","journal-title":"J Res Natl Bur Stand"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Li X, Wu C, Zach C, Lazebnik S, Frahm J-M (2008) Modeling and recognition of landmark image collections using iconic scene graphs. In: ECCV","DOI":"10.1007\/978-3-540-88682-2_33"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Lloyd Stuart P (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137","DOI":"10.1109\/TIT.1982.1056489"},{"key":"17_CR13","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley symposium on mathematical statistics and probability, vol 1, pp 281\u2013297"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Mahajan M, Nimbhorkar P, Varadarajan KR (2009) The planar $$k$$-means problem is NP-hard. In: WALCOM, pp 274\u2013285","DOI":"10.1007\/978-3-642-00202-1_24"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"McCallum A, Nigam K, Ungar LH (2000) Efficient clustering of high-dimensional data sets with application to reference matching. In: KDD","DOI":"10.1145\/347090.347123"},{"key":"17_CR16","first-page":"331","volume":"1","author":"M Muja","year":"2009","unstructured":"Muja M, Lowe DG (2009) Fast approximate nearest neighbors with automatic algorithm configuration. VISSAPP 1:331\u2013340","journal-title":"VISSAPP"},{"key":"17_CR17","unstructured":"Nist\u00e9r D, Stew\u00e9nius H (2006) Scalable recognition with a vocabulary tree. In: CVPR"},{"key":"17_CR18","unstructured":"Philbin J (2010) Scalable object retrieval in very large image collections. PhD thesis, University of Oxford"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Philbin J, Chum O, Isard M, Sivic J, Zisserman A (2007) Object retrieval with large vocabularies and fast spatial matching. In: CVPR","DOI":"10.1109\/CVPR.2007.383172"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Philbin J, Zisserman A (2008) Object mining using a matching graph on very large image collections. In: ICVGIP, pp 738\u2013745","DOI":"10.1109\/ICVGIP.2008.103"},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11263-011-0445-z","volume":"95","author":"R Raguram","year":"2011","unstructured":"Raguram R, Wu C, Frahm J-M, Lazebnik S (2011) Modeling and recognition of landmark image collections using iconic scene graphs. IJCV 95(3):213\u2013239","journal-title":"IJCV"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Sculley D (2010) Web-scale $$k$$-means clustering. In: WWW","DOI":"10.1145\/1772690.1772862"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Simon I, Snavely N, Seitz SM (2007) Scene summarization for online image collections. In: ICCV, pp 1\u20138","DOI":"10.1109\/ICCV.2007.4408863"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Sivic J, Zisserman A (2003) Video Google: a text retrieval approach to object matching in videos. In: ICCV, pp 1470\u20131477","DOI":"10.1109\/ICCV.2003.1238663"},{"issue":"11","key":"17_CR25","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1109\/TPAMI.2008.128","volume":"30","author":"AB Torralba","year":"2008","unstructured":"Torralba AB, Fergus R, Freeman WT (2008) 80 million tiny images: a large data set for nonparametric object and scene recognition. IEEE PAMI 30(11):1958\u20131970","journal-title":"IEEE PAMI"},{"key":"17_CR26","unstructured":"Verma N, Kpotufe S, Dasgupta S (2009) Which spatial partition trees are adaptive to intrinsic dimension? In: Proceedings of 25th conference on uncertainty in artificial intelligence"},{"issue":"5","key":"17_CR27","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00530-010-0224-7","volume":"17","author":"J Wang","year":"2011","unstructured":"Wang J, Jia L, Hua X-S (2011) Interactive browsing via diversified visual summarization for image search results. Multimed Syst 17(5):379\u2013391","journal-title":"Multimed Syst"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Wang J, Wang J, Ke Q, Zeng G, Li S (2012) Fast approximate $$k$$-means via cluster closures. In: CVPR, pp 3037\u20133044","DOI":"10.1109\/CVPR.2012.6248034"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Wang J, Wang J, Zeng G, Tu Z, Gan R, Li S (2012) Scalable $$k$$-NN graph construction for visual descriptors. In: CVPR, pp 1106\u20131113","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"17_CR30","unstructured":"Wang J, Wang J, Zeng G, Tu Z, Gan R, Li S (2013) Scalable $$k$$-NN graph construction. CoRR. abs\/1307.7852"}],"container-title":["Multimedia Data Mining and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14998-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T21:39:34Z","timestamp":1675114774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-14998-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149974","9783319149981"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14998-1_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-14998-1","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}