{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:02:20Z","timestamp":1743058940245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864712"},{"type":"electronic","value":"9783030864729"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86472-9_25","type":"book-chapter","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T22:02:41Z","timestamp":1630360961000},"page":"273-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Optimized Product Quantization for Dynamic Database Using SVD-Updating"],"prefix":"10.1007","author":[{"given":"Kota","family":"Yukawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0595-2230","authenticated-orcid":false,"given":"Toshiyuki","family":"Amagasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, H., et al.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2011)","DOI":"10.1109\/TPAMI.2010.57"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Ge, T., et al.: Optimized product quantization. IEEE Trans. Pattern Anal. Mach. Intell. 36(4), 744\u2013755 (2014)","DOI":"10.1109\/TPAMI.2013.240"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Moffat, A., et al.: Text compression for dynamic document databases. IEEE Trans. Knowl. Data Eng. 9(2), 302\u2013313 (1997)","DOI":"10.1109\/69.591454"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Dong, A., Bhanu, B.: Concept learning and transplantation for dynamic image databases. In: ICME, pp. 765\u2013768 IEEE Computer Society (2003)","DOI":"10.1109\/ICME.2003.1221030"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Xu, D., et al.: Online product quantization. IEEE Trans. Knowl. Data Eng. 30(11), 2185\u20132198 (2018)","DOI":"10.1109\/TKDE.2017.2787711"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Liu, C., et al.: Online optimized product quantization. IEEE International Conference on Data Mining (ICDM), pp. 362\u2013371 (2020)","DOI":"10.1109\/ICDM50108.2020.00045"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Berry, M.W., et al.: Using linear algebra for intelligent information Retrieval. (1994)","DOI":"10.1007\/978-94-015-8196-7_21"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Gray, R.M., et al.: Quantization. IEEE Trans. Inf. Theor. 44, 2325\u20132384 (1998)","DOI":"10.1109\/18.720541"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Sch\u00a8onemann, P.: A generalized solution of the orthogonal procrustes problem. Psychometrika 31(1), 1\u201310 (1966)","DOI":"10.1007\/BF02289451"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Gong, Y., et al.: Iterative quantization: a procrustean approach to learning binary codes. CVPR (2011)","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Norouzi, M., Fleet, D.J.: Cartesian K-means. In: CVPR, pp. 3017\u20133024. IEEE Computer Society (2013)","DOI":"10.1109\/CVPR.2013.388"},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TKDE.2014.2324592","volume":"27","author":"J Wang","year":"2015","unstructured":"Wang, J., et al.: Optimized Cartesian K-means. IEEE Trans. Knowl. Data Eng. 27(1), 180\u2013192 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Babenko, A., Lempitsky, V.S.: Tree quantization for large-scale similarity search and classification. In: CVPR, pp. 4240\u20134248. IEEE Computer Society (2015)","DOI":"10.1109\/CVPR.2015.7299052"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Babenko, A., Lempitsky, V.S.: Additive quantization for extreme vector compression. In: CVPR, pp. 931\u2013938. IEEE Computer Society (2014)","DOI":"10.1109\/CVPR.2014.124"},{"key":"25_CR15","unstructured":"Zhang, T., et al.: Composite quantization for approximate nearest neighbor search. In: ICML, pp. 838\u2013846. JMLR.org (2014)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, T., et al.: Sparse composite quantization. In: CVPR, pp. 4548\u20134556. IEEE Computer Society (2015)","DOI":"10.1109\/CVPR.2015.7299085"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Wang, X., et al.: Supervised quantization for similarity search. In: CVPR, pp. 2018\u20132026. IEEE Computer Society (2016)","DOI":"10.1109\/CVPR.2016.222"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, T., Wang, J.: Collaborative quantization for cross-modal similarity search. In: CVPR, pp. 2036\u20132045. IEEE Computer Society (2016)","DOI":"10.1109\/CVPR.2016.224"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Cao, Y., et al.: Deep quantization network for efficient image retrieval. In: Schuurmans, D., Wellman, M.P. (eds.) In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI), pp. 3457\u20133463. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10455"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Cao, Y., et al.: Deep visual-semantic quantization for efficient image retrieval. In: CVPR, pp. 916\u2013925. IEEE Computer Society (2017)","DOI":"10.1109\/CVPR.2017.104"},{"key":"25_CR21","unstructured":"Sarwar, B., et al.: Incremental singular value decomposition algorithms for highly scalable recommender systems. In: Fifth International Conference on Computer and Information Science, pp. 27--28 (2002)"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Deerwester, S.C., et al.: Indexing by latent semantic analysis. J. Am. Soc. Inf. Sci. 41(6), 391\u2013407 (1990)","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Lang, K.: NewsWeeder: learning to filter netnews. In: International Conference on Machine Learning (1995)","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"25_CR24","unstructured":"Devlin, J., et al.: BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, vol. 1 (Long and Short Papers), pp. 4171\u20144186. Association for Computational Linguistics, Minneapolis (2019)"},{"key":"25_CR25","unstructured":"Fei-Fei, L., et al.: Learning generative visual models from few training examples an incremental Bayesian approach tested on 101 object categories. In: Proceedings of the Workshop on Generative-Model Based Vision. Washington, DC (2004)"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Xiao, J., et al.: SUN database: large-scale scene recognition from abbey to zoo. In: CVPR, pp. 3485\u20133492. IEEE Computer Society (2010)","DOI":"10.1109\/CVPR.2010.5539970"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Friedman, A.: Framing pictures: the role of knowledge in automatized encoding and memory for gist. J. Exp. Psychol. Gen. 108(3), 316\u2013355 (1979)","DOI":"10.1037\/\/0096-3445.108.3.316"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86472-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T12:24:02Z","timestamp":1725711842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86472-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864712","9783030864729"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86472-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}