{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:29:49Z","timestamp":1743064189444,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319968896"},{"type":"electronic","value":"9783319968902"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96890-2_22","type":"book-chapter","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T05:27:37Z","timestamp":1531978057000},"page":"268-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LIDH: An Efficient Filtering Method for Approximate k Nearest Neighbor Queries Based on Local Intrinsic Dimension"],"prefix":"10.1007","author":[{"given":"Yang","family":"Song","sequence":"first","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Gan, J., Feng, J., Fang, Q., Ng, W.: Locality-sensitive hashing scheme based on dynamic collision counting. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2012, Scottsdale, AZ, USA, 20\u201324 May 2012, pp. 541\u2013552 (2012)","DOI":"10.1145\/2213836.2213898"},{"issue":"1","key":"22_CR2","first-page":"1","volume":"9","author":"Q Huang","year":"2015","unstructured":"Huang, Q., Feng, J., Zhang, Y., Fang, Q., Ng, W.: Query-aware locality-sensitive hashing for approximate nearest neighbor search. PVLDB 9(1), 1\u201312 (2015)","journal-title":"PVLDB"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, 19\u201321 May 2002, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 741\u2013750 (2002)","DOI":"10.1145\/509907.510013"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Houle, M.E., Kashima, H., Nett, M.: Generalized expansion dimension. In: 12th IEEE International Conference on Data Mining Workshops, ICDM Workshops, Brussels, Belgium, 10 December 2012, pp. 587\u2013594 (2012)","DOI":"10.1109\/ICDMW.2012.94"},{"issue":"7","key":"22_CR5","first-page":"769","volume":"10","author":"G Casanova","year":"2017","unstructured":"Casanova, G., Englmeier, E., Houle, M.E., Kr\u00f6ger, P., Nett, M., Schubert, E., Zimek, A.: Dimensional testing for reverse k-nearest neighbor search. PVLDB 10(7), 769\u2013780 (2017)","journal-title":"PVLDB"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Houle, M.E.: Dimensionality, discriminability, density and distance distributions. In: 13th IEEE International Conference on Data Mining Workshops, ICDM Workshops, TX, USA, 7\u201310 December 2013, pp. 468\u2013473 (2013)","DOI":"10.1109\/ICDMW.2013.139"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Amsaleg, L., Chelly, O., Furon, T., Girard, S., Houle, M.E., Kawarabayashi, K., Nett, M.: Estimating local intrinsic dimensionality. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, NSW, Australia, 10\u201313 August 2015, pp. 29\u201338 (2015)","DOI":"10.1145\/2783258.2783405"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Houle, M.E., Ma, X., Nett, M., Oria, V.: Dimensional testing for multi-step similarity search. In: 12th IEEE International Conference on Data Mining, ICDM 2012, Brussels, Belgium, 10\u201313 December 2012, pp. 299\u2013308 (2012)","DOI":"10.1109\/ICDM.2012.91"},{"issue":"12","key":"22_CR9","doi-asserted-by":"publisher","first-page":"3258","DOI":"10.1109\/TKDE.2015.2475740","volume":"27","author":"ME Houle","year":"2015","unstructured":"Houle, M.E., Ma, X., Oria, V.: Effective and efficient algorithms for flexible aggregate similarity search in high dimensional spaces. IEEE Trans. Knowl. Data Eng. 27(12), 3258\u20133273 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.is.2016.01.008","volume":"59","author":"ME Houle","year":"2016","unstructured":"Houle, M.E., Ma, X., Oria, V., Sun, J.: Efficient similarity search within user-specified projective subspaces. Inf. Syst. 59, 2\u201314 (2016)","journal-title":"Inf. Syst."},{"issue":"301","key":"22_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Publ. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"Publ. Am. Stat. Assoc."}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96890-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:26:29Z","timestamp":1710246389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96890-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968896","9783319968902"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96890-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"19 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conferences.cis.umac.mo\/apwebwaim2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}