{"id":"https://openalex.org/W1599364940","doi":"https://doi.org/10.1145/2339530.2339677","title":"Maximum inner-product search using cone trees","display_name":"Maximum inner-product search using cone trees","publication_year":2012,"publication_date":"2012-08-12","ids":{"openalex":"https://openalex.org/W1599364940","doi":"https://doi.org/10.1145/2339530.2339677","mag":"1599364940"},"language":"en","primary_location":{"id":"doi:10.1145/2339530.2339677","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339530.2339677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1202.6101","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Parikshit Ram","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Parikshit Ram","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":null,"display_name":"Alexander G. Gray","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander G. Gray","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":1.9856,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.8861835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"931","last_page":"939"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/set","display_name":"Set (abstract data type)","score":0.5169000029563904},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4453999996185303},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4099999964237213},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4083999991416931},{"id":"https://openalex.org/keywords/cosine-similarity","display_name":"Cosine similarity","score":0.3747999966144562},{"id":"https://openalex.org/keywords/data-set","display_name":"Data set","score":0.358599990606308},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.3433000147342682},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.3330000042915344}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5604000091552734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5267000198364258},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5169000029563904},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4453999996185303},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4083999991416931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38940000534057617},{"id":"https://openalex.org/C2780762811","wikidata":"https://www.wikidata.org/wiki/Q1784941","display_name":"Cosine similarity","level":3,"score":0.3747999966144562},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.358599990606308},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.3433000147342682},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.3330000042915344},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3264999985694885},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2563999891281128},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2549999952316284},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25220000743865967},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2339530.2339677","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339530.2339677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1202.6101","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1202.6101","pdf_url":"https://arxiv.org/pdf/1202.6101","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1202.6101","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1202.6101","pdf_url":"https://arxiv.org/pdf/1202.6101","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W40442397","https://openalex.org/W1516914187","https://openalex.org/W2012833704","https://openalex.org/W2024668293","https://openalex.org/W2054141820","https://openalex.org/W2061212083","https://openalex.org/W2062604327","https://openalex.org/W2097776316","https://openalex.org/W2118123209","https://openalex.org/W2133296809","https://openalex.org/W2138859814","https://openalex.org/W2147717514"],"related_works":[],"abstract_inverted_index":{"The":[0],"problem":[1,33,65],"of":[2,34,56,126,138,150],"efficiently":[3,35],"finding":[4,36],"the":[5,18,22,30,37,43,50,54,70,95,119,124,127,157],"best":[6,38,55],"match":[7,39],"for":[8,94,122],"a":[9,12,77,83,91,115,136],"query":[10,154],"in":[11,49,153,161],"given":[13],"set":[14],"with":[15,40,69],"respect":[16,41],"to":[17,42,53,147],"Euclidean":[19],"distance":[20],"or":[21],"cosine":[23],"similarity":[24],"has":[25,45],"been":[26,47],"extensively":[27],"studied.":[28],"However,":[29],"closely":[31],"related":[32],"inner-product":[44,110],"never":[46],"explored":[48],"general":[51,78],"setting":[52],"our":[57,132],"knowledge.":[58],"In":[59],"this":[60,64],"paper":[61],"we":[62,75,89,113],"consider":[63],"and":[66,144],"contrast":[67],"it":[68],"previous":[71],"problems":[72],"considered.":[73],"First,":[74],"propose":[76],"branch-and-bound":[79,104],"algorithm":[80,93],"based":[81,107],"on":[82,108,135],"(single)":[84],"tree":[85],"data":[86,117,139],"structure.":[87],"Subsequently,":[88],"present":[90,114],"dual-tree":[92,128],"case":[96],"where":[97],"there":[98],"are":[99,106],"multiple":[100],"queries.":[101],"Our":[102],"proposed":[103,133],"algorithms":[105,134],"novel":[109],"bounds.":[111],"Finally":[112],"new":[116],"structure,":[118],"cone":[120],"tree,":[121],"increasing":[123],"efficiency":[125],"algorithm.":[129],"We":[130],"evaluate":[131],"variety":[137],"sets":[140],"from":[141],"various":[142],"applications,":[143],"exhibit":[145],"up":[146],"five":[148],"orders":[149],"magnitude":[151],"improvement":[152],"time":[155],"over":[156],"naive":[158],"search":[159],"technique":[160],"some":[162],"cases.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}