{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:27:40Z","timestamp":1770740860848,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T00:00:00Z","timestamp":1508716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Japan Science and Technology Agency (JST) ACT-I","award":["JPMJPR16UO"],"award-info":[{"award-number":["JPMJPR16UO"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,23]]},"DOI":"10.1145\/3123266.3123430","type":"proceedings-article","created":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T13:04:26Z","timestamp":1508504666000},"page":"1725-1733","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["PQk-means"],"prefix":"10.1145","author":[{"given":"Yusuke","family":"Matsui","sequence":"first","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Keisuke","family":"Ogaki","sequence":"additional","affiliation":[{"name":"DWANGO Co., Ltd., Tokyo, Japan"}]},{"given":"Toshihiko","family":"Yamasaki","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]},{"given":"Kiyoharu","family":"Aizawa","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2017,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. ACM SODA.","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii . 2007 . k-means: The Advantages of Careful Seeding . In Proc. ACM SODA. David Arthur and Sergei Vassilvitskii. 2007. k-means: The Advantages of Careful Seeding. In Proc. ACM SODA."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.176"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.124"},{"key":"e_1_3_2_1_4_1","volume-title":"Tree Quantization for Large-Scale Similarity Search and Classification Proc. IEEE CVPR.","author":"Babenko Artem","year":"2015","unstructured":"Artem Babenko and Victor Lempitsky . 2015 . Tree Quantization for Large-Scale Similarity Search and Classification Proc. IEEE CVPR. Artem Babenko and Victor Lempitsky. 2015. Tree Quantization for Large-Scale Similarity Search and Classification Proc. IEEE CVPR."},{"key":"e_1_3_2_1_5_1","volume-title":"Efficient Indexing of Billion-Scale Datasets of Deep Descriptors Proc. IEEE CVPR.","author":"Babenko Artem","year":"2016","unstructured":"Artem Babenko and Victor Lempitsky . 2016 . Efficient Indexing of Billion-Scale Datasets of Deep Descriptors Proc. IEEE CVPR. Artem Babenko and Victor Lempitsky. 2016. Efficient Indexing of Billion-Scale Datasets of Deep Descriptors Proc. IEEE CVPR."},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. NIPS.","author":"Bachem Olivier","year":"2016","unstructured":"Olivier Bachem , Mario Lucic , Hamed Hassani , and Andreas Krause . 2016 a. Fast and Provably Good Seedings for k-Means . In Proc. NIPS. Olivier Bachem, Mario Lucic, Hamed Hassani, and Andreas Krause. 2016 a. Fast and Provably Good Seedings for k-Means. In Proc. NIPS."},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. ACM SODA.","author":"Bachem Olivier","year":"2016","unstructured":"Olivier Bachem , Mario Lucic , S. Hamed Hassani , and Andreas Krause . 2016 b. Approximated K-Means: The Advantages of Careful Seeding . In Proc. ACM SODA. Olivier Bachem, Mario Lucic, S. Hamed Hassani, and Andreas Krause. 2016 b. Approximated K-Means: The Advantages of Careful Seeding. In Proc. ACM SODA."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556260"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2964284.2964331"},{"key":"e_1_3_2_1_10_1","volume-title":"Polysemous Codes Proc. ECCV.","author":"Douze Matthijs","year":"2016","unstructured":"Matthijs Douze , Herv\u00e9 J\u00e9gou , and Florent Perronnin . 2016 . Polysemous Codes Proc. ECCV. Matthijs Douze, Herv\u00e9 J\u00e9gou, and Florent Perronnin. 2016. Polysemous Codes Proc. ECCV."},{"key":"e_1_3_2_1_11_1","volume-title":"Using the Triangle Inequality to Accelerate k-Means Proc. ICML","author":"Elkan Charles","unstructured":"Charles Elkan . 2003. Using the Triangle Inequality to Accelerate k-Means Proc. ICML . Charles Elkan. 2003. Using the Triangle Inequality to Accelerate k-Means Proc. ICML."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"e_1_3_2_1_14_1","volume-title":"Web Scale Photo Hash Clustering on A Single Machine Proc. IEEE CVPR.","author":"Gong Yunchao","year":"2015","unstructured":"Yunchao Gong , Marcin Pawlowski , Fei Yang , Louis Brandy , Lubomir Bourdev , and Rob Fergus . 2015 . Web Scale Photo Hash Clustering on A Single Machine Proc. IEEE CVPR. Yunchao Gong, Marcin Pawlowski, Fei Yang, Louis Brandy, Lubomir Bourdev, and Rob Fergus. 2015. Web Scale Photo Hash Clustering on A Single Machine Proc. IEEE CVPR."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASSP.1984.1162229"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_19_1","volume-title":"Searching in One Billion Vectors: Re-rank with Souce Coding Proc. IEEE ICASSP.","author":"J\u00e9gou Herv\u00e9","year":"2011","unstructured":"Herv\u00e9 J\u00e9gou , Romain Tavenard , Matthijs Douze , and Laurent Amsaleg . 2011 b . Searching in One Billion Vectors: Re-rank with Souce Coding Proc. IEEE ICASSP. Herv\u00e9 J\u00e9gou, Romain Tavenard, Matthijs Douze, and Laurent Amsaleg. 2011 b. Searching in One Billion Vectors: Re-rank with Souce Coding Proc. IEEE ICASSP."},{"key":"e_1_3_2_1_20_1","volume-title":"Billion-scale Similarity Search with GPUs. CoRR","author":"Johnson Jeff","year":"2017","unstructured":"Jeff Johnson , Matthijs Douze , and Herv\u00e9 J\u00e9gou . 2017. Billion-scale Similarity Search with GPUs. CoRR Vol. abs\/ 1702 .08734 ( 2017 ). Jeff Johnson, Matthijs Douze, and Herv\u00e9 J\u00e9gou. 2017. Billion-scale Similarity Search with GPUs. CoRR Vol. abs\/1702.08734 (2017)."},{"key":"e_1_3_2_1_21_1","volume-title":"Imagenet Classification with Deep Convolutional Neural Networks Proc. NIPS.","author":"Krizhevsky Alex","year":"2012","unstructured":"Alex Krizhevsky , Ilya Sutskever , and Geoffrey E Hinton . 2012 . Imagenet Classification with Deep Convolutional Neural Networks Proc. NIPS. Alex Krizhevsky, Ilya Sutskever, and Geoffrey E Hinton. 2012. Imagenet Classification with Deep Convolutional Neural Networks Proc. NIPS."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.225"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. ICML.","author":"Newling James","year":"2016","unstructured":"James Newling and Franccois Fleuret . 2016 a. Fast K-Means with Accurate Bounds . In Proc. ICML. James Newling and Franccois Fleuret. 2016 a. Fast K-Means with Accurate Bounds. In Proc. ICML."},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. NIPS.","author":"Newling James","year":"2016","unstructured":"James Newling and Franccois Fleuret . 2016 b. Nested Mini-Batch K-Means . In Proc. NIPS. James Newling and Franccois Fleuret. 2016 b. Nested Mini-Batch K-Means. In Proc. NIPS."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.388"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.231"},{"key":"e_1_3_2_1_30_1","volume-title":"Improved Hamming Distance Search Using Variable Length Substrings Proc. IEEE CVPR.","author":"Ong Eng-Jon","year":"2016","unstructured":"Eng-Jon Ong and Miroslaw Bober . 2016 . Improved Hamming Distance Search Using Variable Length Substrings Proc. IEEE CVPR. Eng-Jon Ong and Miroslaw Bober. 2016. Improved Hamming Distance Search Using Variable Length Substrings Proc. IEEE CVPR."},{"key":"e_1_3_2_1_31_1","volume-title":"Object Retrieval with Large Vocabularies and Fast Spatial Matching Proc. IEEE CVPR.","author":"Philbin James","year":"2007","unstructured":"James Philbin , Ondvrej Chum , Michael Isard , Josef Sivic , and Andrew Zisserman . 2007 . Object Retrieval with Large Vocabularies and Fast Spatial Matching Proc. IEEE CVPR. James Philbin, Ondvrej Chum, Michael Isard, Josef Sivic, and Andrew Zisserman. 2007. Object Retrieval with Large Vocabularies and Fast Spatial Matching Proc. IEEE CVPR."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1971.10482356"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772862"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2812802"},{"key":"e_1_3_2_1_37_1","volume-title":"Chainer: A Next-generation Open Source Framework for Deep Learning Proc. Workshop on Machine Learning Systems.","author":"Tokui Seiya","year":"2015","unstructured":"Seiya Tokui , Kenta Oono , Shohei Hido , and Justin Clayton . 2015 . Chainer: A Next-generation Open Source Framework for Deep Learning Proc. Workshop on Machine Learning Systems. Seiya Tokui, Kenta Oono, Shohei Hido, and Justin Clayton. 2015. Chainer: A Next-generation Open Source Framework for Deep Learning Proc. Workshop on Machine Learning Systems."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2354409.2354758"},{"key":"e_1_3_2_1_39_1","first-page":"180","article-title":"Optimized Cartesian K-Means","volume":"27","author":"Wang Jianfeng","year":"2015","unstructured":"Jianfeng Wang , Jingdong Wang , Jingkuan Song , Xin-Shun Xu , Heng Tao Shen , and Shipeng Li . 2015 . Optimized Cartesian K-Means . IEEE TKDE , Vol. 27 , 1 (2015), 180 -- 192 . Jianfeng Wang, Jingdong Wang, Jingkuan Song, Xin-Shun Xu, Heng Tao Shen, and Shipeng Li. 2015. Optimized Cartesian K-Means. IEEE TKDE, Vol. 27, 1 (2015), 180--192.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_40_1","volume-title":"A Survey on Learning to Hash","author":"Wang Jingdong","year":"2017","unstructured":"Jingdong Wang , Ting Zhang , Jingkuan Song , Nicu Sebe , and Heng Tao Shen . 2017. A Survey on Learning to Hash . IEEE TPAMI, Vol . PP , 99 ( 2017 ), 1--1. Jingdong Wang, Ting Zhang, Jingkuan Song, Nicu Sebe, and Heng Tao Shen. 2017. A Survey on Learning to Hash. IEEE TPAMI, Vol. PP, 99 (2017), 1--1."},{"key":"e_1_3_2_1_41_1","volume-title":"Joint Unsupervised Learning of Deep Representations and Image Clusters Proc. IEEE CVPR.","author":"Yang Jianwei","year":"2016","unstructured":"Jianwei Yang , Devi Parikh , and Dhruv Batra . 2016 . Joint Unsupervised Learning of Deep Representations and Image Clusters Proc. IEEE CVPR. Jianwei Yang, Devi Parikh, and Dhruv Batra. 2016. Joint Unsupervised Learning of Deep Representations and Image Clusters Proc. IEEE CVPR."},{"key":"e_1_3_2_1_42_1","volume-title":"Composite Quantization for Approximate Nearest Neighbor Search Proc. ICML.","author":"Zhang Ting","year":"2014","unstructured":"Ting Zhang , Chao Du , and Jingdong Wang . 2014 . Composite Quantization for Approximate Nearest Neighbor Search Proc. ICML. Ting Zhang, Chao Du, and Jingdong Wang. 2014. Composite Quantization for Approximate Nearest Neighbor Search Proc. ICML."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299085"}],"event":{"name":"MM '17: ACM Multimedia Conference","location":"Mountain View California USA","acronym":"MM '17","sponsor":["SIGMM ACM Special Interest Group on Multimedia"]},"container-title":["Proceedings of the 25th ACM international conference on Multimedia"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3123266.3123430","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3123266.3123430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:14:04Z","timestamp":1750212844000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3123266.3123430"}},"subtitle":["Billion-scale Clustering for Product-quantized Codes"],"short-title":[],"issued":{"date-parts":[[2017,10,23]]},"references-count":43,"alternative-id":["10.1145\/3123266.3123430","10.1145\/3123266"],"URL":"https:\/\/doi.org\/10.1145\/3123266.3123430","relation":{},"subject":[],"published":{"date-parts":[[2017,10,23]]},"assertion":[{"value":"2017-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}