{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:02:13Z","timestamp":1743069733143,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030880033"},{"type":"electronic","value":"9783030880040"}],"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-88004-0_38","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T23:06:25Z","timestamp":1634857585000},"page":"468-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Control Variates for Similarity Search"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Chew","sequence":"first","affiliation":[]},{"given":"Keegan","family":"Kang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"issue":"4","key":"38_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671\u2013687 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"38_CR2","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences 1997, Proceedings, pp. 21\u201329. IEEE (1997)"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 380\u2013388. ACM (2002)","DOI":"10.1145\/509907.509965"},{"key":"38_CR4","doi-asserted-by":"publisher","unstructured":"Glynn, P.W., Szechtman, R.: Some new perspectives on the method of control variates. In: Fang, K.T., Niederreiter, H., Hickernell, F.J. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2000, pp. 27\u201349. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-642-56046-0_3","DOI":"10.1007\/978-3-642-56046-0_3"},{"issue":"6","key":"38_CR5","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"key":"38_CR6","unstructured":"Guyon, I., Gunn, S., Ben-Hur, A., Dror, G.: Result analysis of the NIPS 2003 feature selection challenge. In: Saul, L.K., Weiss, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems 17, pp. 545\u2013552. MIT Press (2005)"},{"key":"38_CR7","unstructured":"Guyon, I., Gunn, S.R., Ben-Hur, A., Dror, G.: Result analysis of the NIPS 2003 feature selection challenge. In: NIPS, vol. 4, pp. 545\u2013552 (2004)"},{"key":"38_CR8","doi-asserted-by":"publisher","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604\u2013613. ACM, New York (1998). https:\/\/doi.org\/10.1145\/276698.276876, http:\/\/doi.acm.org\/10.1145\/276698.276876","DOI":"10.1145\/276698.276876"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-319-68935-7_43","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2017","author":"K Kang","year":"2017","unstructured":"Kang, K.: Using the multivariate normal to improve random projections. In: Yin, H., et al. (eds.) IDEAL 2017. LNCS, vol. 10585, pp. 397\u2013405. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68935-7_43"},{"issue":"4","key":"38_CR10","doi-asserted-by":"publisher","first-page":"1622","DOI":"10.1007\/s10618-021-00764-6","volume":"35","author":"K Kang","year":"2021","unstructured":"Kang, K.: Correlations between random projections and the bivariate normal. Data Min. Knowl. Disc. 35(4), 1622\u20131653 (2021). https:\/\/doi.org\/10.1007\/s10618-021-00764-6","journal-title":"Data Min. Knowl. Disc."},{"key":"38_CR11","unstructured":"Kang, K., Wong, W.P.: Improving sign random projections with additional information. In: International Conference on Machine Learning, pp. 2479\u20132487. PMLR (2018)"},{"issue":"11","key":"38_CR12","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/11776420_46","volume-title":"Learning Theory","author":"P Li","year":"2006","unstructured":"Li, P., Hastie, T.J., Church, K.W.: Improving random projections using marginal information. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNAI), vol. 4005, pp. 635\u2013649. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11776420_46"},{"key":"38_CR14","unstructured":"Lichman, M.: UCI Machine Learning Repository (2013). http:\/\/archive.ics.uci.edu\/ml"},{"issue":"3","key":"38_CR15","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1287\/opre.33.3.661","volume":"33","author":"RY Rubinstein","year":"1985","unstructured":"Rubinstein, R.Y., Marcus, R.: Efficiency of multivariate control variates in Monte Carlo simulation. Oper. Res. 33(3), 661\u2013677 (1985)","journal-title":"Oper. Res."},{"issue":"2","key":"38_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1109\/MSP.2007.914237","volume":"25","author":"M Slaney","year":"2008","unstructured":"Slaney, M., Casey, M.: Locality-sensitive hashing for finding nearest neighbors [lecture notes]. IEEE Signal Process. Mag. 25(2), 128\u2013131 (2008)","journal-title":"IEEE Signal Process. Mag."},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Szechtman, R., Glynn, P.W.: Constrained Monte Carlo and the method of control variates. In: Proceeding of the 2001 Winter Simulation Conference (Cat. No. 01CH37304), vol. 1, pp. 394\u2013400. IEEE (2001)","DOI":"10.1109\/WSC.2001.977308"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88004-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:02:33Z","timestamp":1725973353000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88004-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030880033","9783030880040"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88004-0_38","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":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chinese Conference on Pattern Recognition and Computer Vision (PRCV)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ccprcv2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.prcv.cn\/2021\/index_en.html","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"513","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":"201","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":"0","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":"39% - 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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"There were 30 oral and 171 poster presentations at the conference.","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)"}}]}}