{"id":"https://openalex.org/W2129331819","doi":"https://doi.org/10.1109/dcc.1992.227447","title":"Improving search for tree-structured vector quantization","display_name":"Improving search for tree-structured vector quantization","publication_year":2003,"publication_date":"2003-01-02","ids":{"openalex":"https://openalex.org/W2129331819","doi":"https://doi.org/10.1109/dcc.1992.227447","mag":"2129331819"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.1992.227447","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.1992.227447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 1992.","raw_type":"proceedings-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/A5003380868","display_name":"Jian Lin","orcid":"https://orcid.org/0000-0003-1265-5314"},"institutions":[{"id":"https://openalex.org/I203331390","display_name":"Eastern Connecticut State University","ror":"https://ror.org/01mhgwt57","country_code":"US","type":"education","lineage":["https://openalex.org/I203331390","https://openalex.org/I4210132746"]},{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Lin","raw_affiliation_strings":["Department of Computer Science, Brandeis University, Waltham, MA, USA","Department of Computer Science, Eastern Connecticut State University, Willimantic, CT, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brandeis University, Waltham, MA, USA","institution_ids":["https://openalex.org/I6902469"]},{"raw_affiliation_string":"Department of Computer Science, Eastern Connecticut State University, Willimantic, CT, USA","institution_ids":["https://openalex.org/I203331390"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036953367","display_name":"James A. Storer","orcid":null},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.A. Storer","raw_affiliation_strings":["Department of Computer Science, Brandeis University, Waltham, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brandeis University, Waltham, MA, USA","institution_ids":["https://openalex.org/I6902469"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003380868"],"corresponding_institution_ids":["https://openalex.org/I203331390","https://openalex.org/I6902469"],"apc_list":null,"apc_paid":null,"fwci":0.2669,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5951571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"it 28","issue":null,"first_page":"339","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9994999766349792,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9994999766349792,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9950000047683716,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/vector-quantization","display_name":"Vector quantization","score":0.6834361553192139},{"id":"https://openalex.org/keywords/codebook","display_name":"Codebook","score":0.6553812026977539},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5717308521270752},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5638414621353149},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5407940745353699},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5127414464950562},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4558100402355194},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4491918385028839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4388655126094818},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.427217960357666},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41654446721076965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4136753976345062},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4124568700790405},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.30310294032096863},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.259854257106781},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19760513305664062},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.19174620509147644}],"concepts":[{"id":"https://openalex.org/C199833920","wikidata":"https://www.wikidata.org/wiki/Q612536","display_name":"Vector quantization","level":2,"score":0.6834361553192139},{"id":"https://openalex.org/C127759330","wikidata":"https://www.wikidata.org/wiki/Q637416","display_name":"Codebook","level":2,"score":0.6553812026977539},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5717308521270752},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5638414621353149},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5407940745353699},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5127414464950562},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4558100402355194},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4491918385028839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4388655126094818},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.427217960357666},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41654446721076965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4136753976345062},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4124568700790405},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.30310294032096863},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.259854257106781},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19760513305664062},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.19174620509147644},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc.1992.227447","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.1992.227447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 1992.","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":15,"referenced_works":["https://openalex.org/W1634005169","https://openalex.org/W1821831831","https://openalex.org/W1854218855","https://openalex.org/W2002182716","https://openalex.org/W2054399571","https://openalex.org/W2098929365","https://openalex.org/W2130305844","https://openalex.org/W2134383396","https://openalex.org/W2138054245","https://openalex.org/W2150593711","https://openalex.org/W2227890591","https://openalex.org/W2265587988","https://openalex.org/W2911302472","https://openalex.org/W6638471410","https://openalex.org/W6639092915"],"related_works":["https://openalex.org/W2148772884","https://openalex.org/W2017514583","https://openalex.org/W2100120615","https://openalex.org/W2352648934","https://openalex.org/W1929869830","https://openalex.org/W2017401491","https://openalex.org/W2387054321","https://openalex.org/W2012827167","https://openalex.org/W2062765737","https://openalex.org/W2391875658"],"abstract_inverted_index":{"The":[0,65],"authors":[1],"analyze":[2],"the":[3,15,36,51,60,83,98,107,111,128,135,139,143,159,162,170],"approximate":[4],"performance":[5,37,136,166],"of":[6,17,38,62,75,114,118,131,138,145,161],"tree":[7,21,63,96],"search":[8,22,172],"and":[9,23],"provide":[10],"tight":[11],"upper":[12],"bounds":[13,30],"on":[14,142],"amount":[16],"error":[18],"resulting":[19],"from":[20],"for":[24,70,91,106],"a":[25,55,86,119,155],"single":[26],"input":[27,93],"vector.":[28],"These":[29],"are":[31,103,149],"not":[32,44],"encouraging":[33],"but":[34],"fortunately,":[35],"tree-structured":[39],"VQ":[40],"in":[41,158],"practice":[42],"does":[43],"seem":[45],"to":[46,58,68],"be":[47,124],"as":[48,125,127],"bad.":[49],"From":[50],"analysis,":[52],"they":[53],"derive":[54],"simple":[56],"heuristic":[57],"improve":[59],"approximation":[61],"search.":[64],"strategy":[66,140],"is":[67,89],"identify":[69],"each":[71],"code":[72,79,87,101,116,121,132,146],"vector":[73,88,94,122],"some":[74],"its":[76],"closest":[77,99],"neighboring":[78,100,115],"vectors":[80,102,117,147],"determined":[81],"by":[82,95],"partition.":[84],"After":[85],"found":[90],"an":[92],"search,":[97],"then":[104],"searched":[105],"best":[108],"match.":[109],"Unfortunately,":[110],"average":[112],"number":[113,130,144,156],"given":[120],"can":[123],"many":[126],"total":[129],"vectors.":[133],"Thus,":[134],"improvement":[137],"depends":[141],"that":[148,154],"searched.":[150],"Experimental":[151],"results":[152],"show":[153],"logarithmic":[157],"size":[160],"codebook":[163],"provides":[164],"significant":[165],"gain":[167],"while":[168],"preserving":[169],"asymptotic":[171],"time":[173],"complexity.<":[174],"<ETX":[175],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[176],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">&gt;</ETX>":[177]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}