{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T15:11:58Z","timestamp":1723907518137},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1016\/j.is.2023.102166","type":"journal-article","created":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T20:19:00Z","timestamp":1673036340000},"page":"102166","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Pushing diversity into higher dimensions: The LID effect on diversified similarity searching"],"prefix":"10.1016","volume":"114","author":[{"given":"Daniel","family":"Jasbick","sequence":"first","affiliation":[]},{"given":"Lucio","family":"Santos","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7271-2774","authenticated-orcid":false,"given":"Paulo M.","family":"Azevedo-Marques","sequence":"additional","affiliation":[]},{"given":"Agma J.M.","family":"Traina","sequence":"additional","affiliation":[]},{"given":"Daniel de","family":"Oliveira","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2198-4670","authenticated-orcid":false,"given":"Marcos","family":"Bedo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2023.102166_b1","series-title":"Swarm Intell. for Multi-Objective Problems in Data Mining","first-page":"199","article-title":"The Basic Principles of Metric Indexing","author":"Hetland","year":"2009"},{"key":"10.1016\/j.is.2023.102166_b2","series-title":"Similarity Search: The Metric Space Approach, vol. 32","author":"Zezula","year":"2010"},{"key":"10.1016\/j.is.2023.102166_b3","series-title":"Encyclopedia of Distances","first-page":"1","article-title":"Encyclopedia of distances","author":"Deza","year":"2009"},{"key":"10.1016\/j.is.2023.102166_b4","series-title":"Operators for Similarity Search","author":"Padmanabhan","year":"2015"},{"issue":"3","key":"10.1016\/j.is.2023.102166_b5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","article-title":"Searching in metric spaces","volume":"33","author":"Ch\u00e1vez","year":"2001","journal-title":"Comput. Surv."},{"key":"10.1016\/j.is.2023.102166_b6","series-title":"Indexing metric spaces for exact similarity search","author":"Chen","year":"2020"},{"key":"10.1016\/j.is.2023.102166_b7","series-title":"Data Mining: The Textbook","author":"Aggarwal","year":"2015"},{"key":"10.1016\/j.is.2023.102166_b8","doi-asserted-by":"crossref","unstructured":"L. Santos, G. Blanco, D. Oliveira, A. Traina, C. Traina, M. Bedo, Exploring diversified similarity with kundaha, in: CIKM, 2018, pp. 1903\u20131906.","DOI":"10.1145\/3269206.3269220"},{"key":"10.1016\/j.is.2023.102166_b9","series-title":"SODA","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"Yianilos","year":"1993"},{"issue":"4","key":"10.1016\/j.is.2023.102166_b10","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/958942.958948","article-title":"Index-driven similarity search in metric spaces","volume":"28","author":"Hjaltason","year":"2003","journal-title":"TODS"},{"issue":"10","key":"10.1016\/j.is.2023.102166_b11","first-page":"1058","article-title":"Pivot-based metric indexing","volume":"10","author":"Chen","year":"2017","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2023.102166_b12","doi-asserted-by":"crossref","unstructured":"L. Santos, W. Oliveira, M. Ferreira, A. Traina, C. Traina, Parameter-free and domain-independent similarity search with diversity, in: SSDBM, 2013, pp. 1\u201312.","DOI":"10.1145\/2484838.2484854"},{"issue":"1","key":"10.1016\/j.is.2023.102166_b13","first-page":"1","article-title":"A survey of query result diversification","volume":"51","author":"Zheng","year":"2017","journal-title":"KIS"},{"issue":"2","key":"10.1016\/j.is.2023.102166_b14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1089\/big.2016.0054","article-title":"Diversity in big data: A review","volume":"5","author":"Drosou","year":"2017","journal-title":"Big Data"},{"key":"10.1016\/j.is.2023.102166_b15","series-title":"SISAP","first-page":"140","article-title":"Some branches may bear rotten fruits: Diversity browsing VP-Trees","author":"Jasbick","year":"2020"},{"key":"10.1016\/j.is.2023.102166_b16","series-title":"ICDT","first-page":"217","article-title":"When is \u201cnearest neighbor\u201d meaningful?","author":"Beyer","year":"1999"},{"issue":"7","key":"10.1016\/j.is.2023.102166_b17","first-page":"873","article-title":"The concentration of fractional distances","volume":"19","author":"Fran\u00e7ois","year":"2007","journal-title":"TKDE"},{"key":"10.1016\/j.is.2023.102166_b18","series-title":"SISAP","first-page":"39","article-title":"Curse of dimensionality in pivot based indexes","author":"Volnyansky","year":"2009"},{"issue":"2","key":"10.1016\/j.is.2023.102166_b19","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/s00453-012-9638-2","article-title":"Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions","volume":"66","author":"Pestov","year":"2013","journal-title":"Algorithmica"},{"key":"10.1016\/j.is.2023.102166_b20","series-title":"The curse revisited: a newly quantified concept of meaningful distances for learning from high-dimensional noisy data","author":"Vandaele","year":"2021"},{"issue":"4","key":"10.1016\/j.is.2023.102166_b21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11704-019-8324-9","article-title":"Diversification on big data in query processing","volume":"14","author":"Zhang","year":"2020","journal-title":"Front. Comput. Sci."},{"issue":"2\u20133","key":"10.1016\/j.is.2023.102166_b22","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.neunet.2007.12.030","article-title":"An axiomatic approach to intrinsic dimension of a dataset","volume":"21","author":"Pestov","year":"2008","journal-title":"Neural Netw."},{"issue":"1","key":"10.1016\/j.is.2023.102166_b23","first-page":"3","article-title":"Fast feature selection using fractal dimension","volume":"1","author":"Traina","year":"2010","journal-title":"JIDM"},{"key":"10.1016\/j.is.2023.102166_b24","series-title":"SISAP","first-page":"218","article-title":"ABID: Angle based intrinsic dimensionality","author":"Thordsen","year":"2020"},{"key":"10.1016\/j.is.2023.102166_b25","series-title":"ICDM","first-page":"468","article-title":"Dimensionality, discriminability, density and distance distributions","author":"Houle","year":"2013"},{"key":"10.1016\/j.is.2023.102166_b26","series-title":"SIGKDD","first-page":"29","article-title":"Estimating local intrinsic dimensionality","author":"Amsaleg","year":"2015"},{"key":"10.1016\/j.is.2023.102166_b27","series-title":"ICDM","first-page":"181","article-title":"Intrinsic dimensionality estimation within tight localities","author":"Amsaleg","year":"2019"},{"key":"10.1016\/j.is.2023.102166_b28","series-title":"SISAP","first-page":"143","article-title":"Indexability-based dataset partitioning","author":"Hoyos","year":"2019"},{"key":"10.1016\/j.is.2023.102166_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.is.2021.101807","article-title":"The role of local dimensionality measures in benchmarking nearest neighbor search","volume":"101","author":"Aum\u00fcller","year":"2021","journal-title":"Inf. Syst."},{"key":"10.1016\/j.is.2023.102166_b30","series-title":"SISAP","first-page":"113","article-title":"The role of local intrinsic dimensionality in benchmarking nearest neighbor search","author":"Aum\u00fcller","year":"2019"},{"key":"10.1016\/j.is.2023.102166_b31","series-title":"SISAP","first-page":"248","article-title":"Local intrinsic dimensionality III: Density and similarity","author":"Houle","year":"2020"},{"issue":"11","key":"10.1016\/j.is.2023.102166_b32","article-title":"Diversifying top-k results","volume":"5","author":"Qin","year":"2012","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2023.102166_b33","series-title":"PVLDB, vol. 6","first-page":"577","article-title":"On the complexity of query result diversification","author":"Deng","year":"2013"},{"issue":"1","key":"10.1016\/j.is.2023.102166_b34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2699499","article-title":"Multiple radii disc diversity: Result diversification based on dissimilarity and coverage","volume":"40","author":"Drosou","year":"2015","journal-title":"TODS"},{"key":"10.1016\/j.is.2023.102166_b35","series-title":"AKDM","first-page":"404","article-title":"Providing diversity in K-nearest neighbor query results","author":"Jain","year":"2004"},{"issue":"4","key":"10.1016\/j.is.2023.102166_b36","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.jco.2009.02.011","article-title":"When is \u2018nearest neighbour\u2019meaningful: A converse theorem and implications","volume":"25","author":"Durrant","year":"2009","journal-title":"J. Complexity"},{"issue":"10","key":"10.1016\/j.is.2023.102166_b37","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1016\/j.camwa.2012.09.011","article-title":"Is the k-NN classifier in high dimensions affected by the curse of dimensionality?","volume":"65","author":"Pestov","year":"2013","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.is.2023.102166_b38","unstructured":"J. He, S. Kumar, S.-F. Chang, On the difficulty of nearest neighbor search, in: ICML, 2012, pp. 41\u201348."},{"issue":"2","key":"10.1016\/j.is.2023.102166_b39","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","article-title":"Distance browsing in spatial databases","volume":"24","author":"Hjaltason","year":"1999","journal-title":"TODS"},{"key":"10.1016\/j.is.2023.102166_b40","series-title":"ICDE","first-page":"554","article-title":"Assessing and remedying coverage for a given dataset","author":"Asudeh","year":"2019"},{"key":"10.1016\/j.is.2023.102166_b41","series-title":"ICDM Workshops","first-page":"587","article-title":"Generalized expansion dimension","author":"Houle","year":"2012"},{"issue":"6","key":"10.1016\/j.is.2023.102166_b42","first-page":"1768","article-title":"Extreme-value-theoretic estimation of local intrinsic dimensionality","volume":"32","author":"Amsaleg","year":"2018","journal-title":"DMKD"},{"issue":"1","key":"10.1016\/j.is.2023.102166_b43","article-title":"Disc diversity: Result diversification based on dissimilarity and coverage","volume":"6","author":"Drosou","year":"2012","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2023.102166_b44","series-title":"ICDE","first-page":"905","article-title":"Finding diverse neighbors in high dimensional space","author":"Guo","year":"2018"},{"issue":"7","key":"10.1016\/j.is.2023.102166_b45","first-page":"769","article-title":"Dimensional testing for reverse k-nearest neighbor search","volume":"10","author":"Casanova","year":"2017","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2023.102166_b46","first-page":"1","article-title":"Pivot selection algorithms in metric spaces: a survey and experimental study","author":"Zhu","year":"2021","journal-title":"VLDB J."},{"issue":"2","key":"10.1016\/j.is.2023.102166_b47","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/PL00010672","article-title":"Dynamic VP-Tree indexing for n-nearest neighbor search given pairwise distances","volume":"9","author":"Fu","year":"2000","journal-title":"The VLDB J."}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437923000029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437923000029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:23:27Z","timestamp":1701649407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437923000029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":47,"alternative-id":["S0306437923000029"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2023.102166","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2023,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pushing diversity into higher dimensions: The LID effect on diversified similarity searching","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2023.102166","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"102166"}}