{"id":"https://openalex.org/W388837486","doi":"https://doi.org/10.4018/jmdem.2012100104","title":"Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search","display_name":"Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W388837486","doi":"https://doi.org/10.4018/jmdem.2012100104","mag":"388837486"},"language":"en","primary_location":{"id":"doi:10.4018/jmdem.2012100104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jmdem.2012100104","pdf_url":null,"source":{"id":"https://openalex.org/S87630009","display_name":"International Journal of Multimedia Data Engineering and Management","issn_l":"1947-8534","issn":["1947-8534","1947-8542"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Multimedia Data Engineering and Management","raw_type":"journal-article"},"type":"article","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/A5071002215","display_name":"Bilegsaikhan Naidan","orcid":null},"institutions":[{"id":"https://openalex.org/I204778367","display_name":"Norwegian University of Science and Technology","ror":"https://ror.org/05xg72x27","country_code":"NO","type":"education","lineage":["https://openalex.org/I204778367"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Bilegsaikhan Naidan","raw_affiliation_strings":["Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway","Department of Computer and Information Science, Norwegian University of Science and Technology, TRONDHEIM, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway","institution_ids":["https://openalex.org/I204778367"]},{"raw_affiliation_string":"Department of Computer and Information Science, Norwegian University of Science and Technology, TRONDHEIM, Norway","institution_ids":["https://openalex.org/I204778367"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049248639","display_name":"Magnus Lie Hetland","orcid":"https://orcid.org/0000-0003-4204-2017"},"institutions":[{"id":"https://openalex.org/I204778367","display_name":"Norwegian University of Science and Technology","ror":"https://ror.org/05xg72x27","country_code":"NO","type":"education","lineage":["https://openalex.org/I204778367"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Magnus Lie Hetland","raw_affiliation_strings":["Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway","Department of Computer and Information Science, Norwegian University of Science and Technology, TRONDHEIM, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway","institution_ids":["https://openalex.org/I204778367"]},{"raw_affiliation_string":"Department of Computer and Information Science, Norwegian University of Science and Technology, TRONDHEIM, Norway","institution_ids":["https://openalex.org/I204778367"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01290078,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"4","first_page":"75","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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.9994000196456909,"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.973800003528595,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9592999815940857,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/bregman-divergence","display_name":"Bregman divergence","score":0.8294047117233276},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.7509039640426636},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6557933688163757},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.56989985704422},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5665069222450256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5582917332649231},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5432599186897278},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5310177206993103},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4085426926612854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37584182620048523},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.26820874214172363},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.197870671749115},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.18303364515304565},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11813947558403015}],"concepts":[{"id":"https://openalex.org/C149073432","wikidata":"https://www.wikidata.org/wiki/Q4960382","display_name":"Bregman divergence","level":2,"score":0.8294047117233276},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.7509039640426636},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6557933688163757},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.56989985704422},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5665069222450256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5582917332649231},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5432599186897278},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5310177206993103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4085426926612854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37584182620048523},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.26820874214172363},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.197870671749115},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.18303364515304565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11813947558403015},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/jmdem.2012100104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jmdem.2012100104","pdf_url":null,"source":{"id":"https://openalex.org/S87630009","display_name":"International Journal of Multimedia Data Engineering and Management","issn_l":"1947-8534","issn":["1947-8534","1947-8542"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Multimedia Data Engineering and Management","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jmdem0:v:3:y:2012:i:4:p:75-87","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jmdem.2012100104","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W42106223","https://openalex.org/W299839057","https://openalex.org/W1541459201","https://openalex.org/W1880262756","https://openalex.org/W2005797502","https://openalex.org/W2033468335","https://openalex.org/W2040711469","https://openalex.org/W2046947077","https://openalex.org/W2049644877","https://openalex.org/W2118269922","https://openalex.org/W2120750550","https://openalex.org/W2150102617","https://openalex.org/W2153602280","https://openalex.org/W2160063258","https://openalex.org/W2166632516","https://openalex.org/W2170605888","https://openalex.org/W2171896402","https://openalex.org/W3035139526","https://openalex.org/W3169291629","https://openalex.org/W4242599275"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2787484455","https://openalex.org/W2119808169"],"abstract_inverted_index":{"This":[0],"article":[1],"presents":[2],"a":[3,72,99,114],"new":[4,100],"approximate":[5],"index":[6,49,82,101],"structure,":[7],"the":[8,14,20,35,47,54,93,121],"Bregman":[9,15,56,94],"hyperplane":[10],"tree,":[11],"for":[12,81,103],"indexing":[13],"divergence,":[16],"aiming":[17],"to":[18,53,92,111],"decrease":[19],"number":[21],"of":[22,61,74,79],"distance":[23],"computations":[24],"required":[25],"at":[26,117],"query":[27,118],"processing":[28,119],"time,":[29],"by":[30],"sacrificing":[31],"some":[32],"accuracy":[33],"in":[34,59,71],"result.":[36],"The":[37,84],"experimental":[38],"results":[39,70],"on":[40],"various":[41],"high-dimensional":[42],"data":[43],"sets":[44],"demonstrate":[45],"that":[46,108],"proposed":[48],"structure":[50,102],"performs":[51],"comparably":[52],"state-of-the-art":[55],"ball":[57,95],"tree":[58,96],"terms":[60],"search":[62,107],"performance":[63],"and":[64,97,113],"result":[65],"quality.":[66],"Moreover,":[67],"this":[68],"method":[69],"speedup":[73],"well":[75],"over":[76],"an":[77],"order":[78],"magnitude":[80],"construction.":[83],"authors":[85],"also":[86],"apply":[87],"their":[88],"space":[89],"partitioning":[90],"principle":[91],"obtain":[98],"exact":[104],"nearest":[105],"neighbor":[106],"is":[109],"faster":[110],"build":[112],"slightly":[115],"slower":[116],"than":[120],"original.":[122]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}