{"id":"https://openalex.org/W2043815117","doi":"https://doi.org/10.1145/1463434.1463520","title":"Optimal incremental multi-step nearest-neighbor search","display_name":"Optimal incremental multi-step nearest-neighbor search","publication_year":2008,"publication_date":"2008-11-05","ids":{"openalex":"https://openalex.org/W2043815117","doi":"https://doi.org/10.1145/1463434.1463520","mag":"2043815117"},"language":"en","primary_location":{"id":"doi:10.1145/1463434.1463520","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1463434.1463520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems","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/A5100447289","display_name":"Ming Zhang","orcid":"https://orcid.org/0000-0002-6497-5566"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ming Zhang","raw_affiliation_strings":["University of Calgary, Calgary, Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calgary, Calgary, Alberta, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066265052","display_name":"Reda Alhajj","orcid":"https://orcid.org/0000-0001-6657-9738"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Reda Alhajj","raw_affiliation_strings":["University of Calgary, Calgary, Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calgary, Calgary, Alberta, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020310155","display_name":"Jon Rokne","orcid":"https://orcid.org/0000-0002-3439-2917"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jon Rokne","raw_affiliation_strings":["University of Calgary, Calgary, Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calgary, Calgary, Alberta, Canada","institution_ids":["https://openalex.org/I168635309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I168635309"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.998199999332428,"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/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9909999966621399,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6575738787651062},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6195290684700012},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5896141529083252},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5858123898506165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5708661675453186},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.48453181982040405},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.47728410363197327},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4630105495452881},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.452786386013031},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23100224137306213},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.11311626434326172}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6575738787651062},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6195290684700012},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5896141529083252},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5858123898506165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5708661675453186},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.48453181982040405},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.47728410363197327},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4630105495452881},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.452786386013031},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23100224137306213},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.11311626434326172},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1463434.1463520","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1463434.1463520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1893622764","https://openalex.org/W1994655805","https://openalex.org/W2072640386","https://openalex.org/W2101319014","https://openalex.org/W2134627110","https://openalex.org/W2143668817","https://openalex.org/W2154931799","https://openalex.org/W2238624099","https://openalex.org/W2612808736"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W2375128115","https://openalex.org/W2148008870","https://openalex.org/W2169618946","https://openalex.org/W2381195555","https://openalex.org/W1558159560","https://openalex.org/W2011582495","https://openalex.org/W2519241726","https://openalex.org/W4297819076","https://openalex.org/W1671890395"],"abstract_inverted_index":{"The":[0],"distance":[1,23],"measures":[2],"used":[3],"to":[4,15,54,68],"determine":[5],"the":[6,19,26,60,63,76,80,92,97,120,123],"dissimilarities":[7],"between":[8],"high-dimensional":[9],"feature":[10],"vectors":[11],"are":[12],"often":[13],"expensive":[14,22],"compute.":[16],"To":[17],"reduce":[18],"number":[20],"of":[21,91,122],"calculations":[24],"in":[25,59,79,101],"search":[27],"process,":[28],"Korn,":[29],"et":[30],"al":[31],"[5]":[32],"proposed":[33,124],"a":[34],"multi-step":[35],"algorithm,":[36],"which":[37],"involves":[38],"two":[39],"stages:":[40],"filtering":[41,61,70,109],"and":[42,51,110,113],"refinement.":[43],"This":[44],"algorithm":[45,65,93,106],"was":[46],"later":[47],"improved":[48,64],"by":[49],"Seidl":[50],"Kriegel":[52],"[8]":[53],"produce":[55,75,96],"optimal-sized":[56],"candidate":[57],"set":[58],"stage;":[62],"is":[66,107],"said":[67],"be":[69],"optimal,":[71,112],"but":[72],"can":[73,95],"not":[74],"result":[77],"incrementally":[78,100],"refinement":[81,111],"stage.":[82],"In":[83],"this":[84],"paper,":[85],"we":[86],"propose":[87],"an":[88,102],"extended":[89,125],"version":[90],"that":[94],"nearest":[98],"neighbors":[99],"optimal":[103],"way.":[104],"Our":[105],"both":[108],"well":[114],"serves":[115],"real":[116],"applications.":[117],"We":[118],"proved":[119],"optimality":[121],"algorithm.":[126]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}