{"id":"https://openalex.org/W3113728200","doi":"https://doi.org/10.1145/3430984.3431968","title":"Exploring State-of-the-Art Nearest Neighbor (NN) Search Techniques","display_name":"Exploring State-of-the-Art Nearest Neighbor (NN) Search Techniques","publication_year":2020,"publication_date":"2020-12-28","ids":{"openalex":"https://openalex.org/W3113728200","doi":"https://doi.org/10.1145/3430984.3431968","mag":"3113728200"},"language":"en","primary_location":{"id":"doi:10.1145/3430984.3431968","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3430984.3431968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM India Joint International Conference on Data Science &amp; Management of Data (8th ACM IKDD CODS &amp; 26th COMAD)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061553698","display_name":"Parth Nagarkar","orcid":"https://orcid.org/0000-0001-6284-9251"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Parth Nagarkar","raw_affiliation_strings":["New Mexico State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New Mexico State University, USA","institution_ids":["https://openalex.org/I10052268"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103014125","display_name":"Arnab Bhattacharya","orcid":"https://orcid.org/0000-0001-7331-0788"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arnab Bhattacharya","raw_affiliation_strings":["IIT Kanpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058824991","display_name":"Omid Jafari","orcid":"https://orcid.org/0000-0003-3422-2755"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Omid Jafari","raw_affiliation_strings":["New Mexico State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New Mexico State University, USA","institution_ids":["https://openalex.org/I10052268"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1643,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.37760024,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"443","last_page":"446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.8923443555831909},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8516174554824829},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.7671909332275391},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7556021213531494},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.6374335289001465},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5960692167282104},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.558801531791687},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.5559014678001404},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5314406752586365},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.5256365537643433},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.4952920973300934},{"id":"https://openalex.org/keywords/database-index","display_name":"Database index","score":0.4533604085445404},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.4448099434375763},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.44035011529922485},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.326829731464386},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3195892572402954},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.188809335231781},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.08244588971138}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8923443555831909},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8516174554824829},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.7671909332275391},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7556021213531494},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.6374335289001465},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5960692167282104},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.558801531791687},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.5559014678001404},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5314406752586365},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.5256365537643433},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.4952920973300934},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.4533604085445404},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.4448099434375763},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.44035011529922485},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.326829731464386},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3195892572402954},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.188809335231781},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.08244588971138},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3430984.3431968","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3430984.3431968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM India Joint International Conference on Data Science &amp; Management of Data (8th ACM IKDD CODS &amp; 26th COMAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6700000166893005,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1589213590","https://openalex.org/W1986693891","https://openalex.org/W2038044292","https://openalex.org/W2072605585","https://openalex.org/W2086179657","https://openalex.org/W2086504823","https://openalex.org/W2118269922","https://openalex.org/W2124509324","https://openalex.org/W2144265691","https://openalex.org/W2162006472","https://openalex.org/W2165558283","https://openalex.org/W2294518132","https://openalex.org/W2318810549","https://openalex.org/W2476860574","https://openalex.org/W2797054769","https://openalex.org/W2963588253","https://openalex.org/W3105233790","https://openalex.org/W4242599275"],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W1558159560","https://openalex.org/W1595303882","https://openalex.org/W2182477562","https://openalex.org/W2245581955","https://openalex.org/W325985789","https://openalex.org/W2351157934","https://openalex.org/W2571415506","https://openalex.org/W2375128115","https://openalex.org/W2902799860"],"abstract_inverted_index":{"Finding":[0],"nearest":[1,33,53,119],"neighbors":[2],"(NN)":[3,174],"is":[4,42,77,85,151],"a":[5,88,98,118,124,207],"fundamental":[6,94],"operation":[7],"in":[8,36,141,186,213],"many":[9,37],"diverse":[10],"domains":[11,57],"such":[12],"as":[13],"databases,":[14],"machine":[15],"learning,":[16],"data":[17,27,60,89,179],"mining,":[18],"information":[19],"retrieval,":[20,22],"multimedia":[21],"etc.":[23],"Due":[24],"to":[25,49,91,102,116,134,152,159],"the":[26,30,71,81,104,107,112,142,154,157,161,170,184,194,204,210,214],"deluge":[28],"and":[29,74,96,190],"application":[31,56,200],"of":[32,67,106,148,188,192],"neighbor":[34,120],"queries":[35],"applications":[38],"where":[39],"fast":[40],"performance":[41,105],"necessary,":[43],"efficient":[44],"index":[45,163,196],"structures":[46],"are":[47],"required":[48],"speed":[50],"up":[51],"finding":[52],"neighbors.":[54],"Different":[55],"have":[58],"different":[59,65,178,199],"characteristics":[61],"and,":[62],"therefore,":[63],"require":[64],"types":[66],"indexing":[68,73,100,175],"techniques.":[69],"While":[70],"internal":[72],"searching":[75,114],"mechanism":[76,115],"generally":[78],"hidden":[79],"from":[80],"top-level":[82],"application,":[83],"it":[84],"beneficial":[86],"for":[87,165,177,198],"scientist":[90],"understand":[92],"these":[93],"operations":[95],"choose":[97,160],"correct":[99,113,162],"technique":[101],"improve":[103],"overall":[108],"end-to-end":[109],"workflow.":[110],"Choosing":[111],"solve":[117],"query":[121],"can":[122,131],"be":[123],"daunting":[125],"task,":[126],"however.":[127],"A":[128],"wrong":[129,195],"choice":[130],"potentially":[132],"lead":[133],"low":[135],"accuracy,":[136,191],"slower":[137],"execution":[138],"time,":[139],"or":[140],"worst":[143],"case,":[144],"both.":[145],"The":[146],"objective":[147],"this":[149],"tutorial":[150,205],"present":[153,169,183],"audience":[155],"with":[156,206],"knowledge":[158],"structure":[164,197],"specific":[166],"applications.":[167],"We":[168,181,202],"state-of-the-art":[171],"Nearest":[172,215],"Neighbor":[173,216],"techniques":[176],"characteristics.":[180],"also":[182],"effect,":[185],"terms":[187],"time":[189],"choosing":[193],"needs.":[201],"conclude":[203],"discussion":[208],"on":[209],"future":[211],"challenges":[212],"search":[217],"domain.":[218]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}
