{"id":"https://openalex.org/W2149177634","doi":"https://doi.org/10.14778/1687627.1687643","title":"Using trees to depict a forest","display_name":"Using trees to depict a forest","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2149177634","doi":"https://doi.org/10.14778/1687627.1687643","mag":"2149177634"},"language":"en","primary_location":{"id":"doi:10.14778/1687627.1687643","is_oa":false,"landing_page_url":"https://doi.org/10.14778/1687627.1687643","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","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/A5100395521","display_name":"Bin Liu","orcid":"https://orcid.org/0000-0002-7028-5334"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bin Liu","raw_affiliation_strings":["University of Michigan, Ann Arbor"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087012731","display_name":"H. V. Jagadish","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. V. Jagadish","raw_affiliation_strings":["University of Michigan, Ann Arbor"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100395521"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":7.4991,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.9795756,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"133","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9973000288009644,"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/computer-science","display_name":"Computer science","score":0.8330689668655396},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.7131450772285461},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7030029296875},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6535996794700623},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6139065027236938},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.6010836958885193},{"id":"https://openalex.org/keywords/result-set","display_name":"Result set","score":0.5932825207710266},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.5493259429931641},{"id":"https://openalex.org/keywords/medoid","display_name":"Medoid","score":0.5007665157318115},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4737685024738312},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.44983160495758057},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4477432668209076},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4416774809360504},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3647364377975464},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.24573317170143127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0948079526424408}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8330689668655396},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.7131450772285461},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7030029296875},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6535996794700623},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6139065027236938},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.6010836958885193},{"id":"https://openalex.org/C4969071","wikidata":"https://www.wikidata.org/wiki/Q7316353","display_name":"Result set","level":3,"score":0.5932825207710266},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.5493259429931641},{"id":"https://openalex.org/C63085389","wikidata":"https://www.wikidata.org/wiki/Q4287912","display_name":"Medoid","level":3,"score":0.5007665157318115},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4737685024738312},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.44983160495758057},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4477432668209076},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4416774809360504},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3647364377975464},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.24573317170143127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0948079526424408},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"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},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/1687627.1687643","is_oa":false,"landing_page_url":"https://doi.org/10.14778/1687627.1687643","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.227.7530","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.7530","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Ebinliu/pub/vldb09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1493454437","https://openalex.org/W1577072181","https://openalex.org/W1673310716","https://openalex.org/W1767929998","https://openalex.org/W1977496278","https://openalex.org/W2006533296","https://openalex.org/W2011039300","https://openalex.org/W2022056881","https://openalex.org/W2042989628","https://openalex.org/W2074836925","https://openalex.org/W2089120219","https://openalex.org/W2095897464","https://openalex.org/W2097672736","https://openalex.org/W2099305423","https://openalex.org/W2099391294","https://openalex.org/W2101616188","https://openalex.org/W2105518356","https://openalex.org/W2106925043","https://openalex.org/W2122088005","https://openalex.org/W2124158084","https://openalex.org/W2126626732","https://openalex.org/W2130666866","https://openalex.org/W2131687179","https://openalex.org/W2133296809","https://openalex.org/W2134206624","https://openalex.org/W2136121557","https://openalex.org/W2143085379","https://openalex.org/W2145734075","https://openalex.org/W2153066044","https://openalex.org/W2153233077","https://openalex.org/W2159772324","https://openalex.org/W2161547991","https://openalex.org/W2162246203","https://openalex.org/W2212819718","https://openalex.org/W2999729612","https://openalex.org/W4239363526","https://openalex.org/W4255446233"],"related_works":["https://openalex.org/W2092977233","https://openalex.org/W2395498354","https://openalex.org/W2418571785","https://openalex.org/W4231049415","https://openalex.org/W2084860965","https://openalex.org/W2042441172","https://openalex.org/W2157222403","https://openalex.org/W2017776027","https://openalex.org/W3207070658","https://openalex.org/W3022801407"],"abstract_inverted_index":{"When":[0],"a":[1,5,21,43,115,119,131,146,167,178],"database":[2,39],"query":[3,40,152,191],"has":[4],"large":[6],"number":[7],"of":[8,18,45,126,145],"results,":[9,86],"the":[10,32,57,75,84,97,184,199],"user":[11,116],"can":[12,172],"only":[13],"be":[14,173],"shown":[15],"one":[16,122],"page":[17,77,120],"results":[19,29,34,41,61],"at":[20],"time.":[22],"One":[23],"popular":[24],"approach":[25,73],"is":[26,52,69,78,94,135],"to":[27,54,59,74,80,82,89,104,137,162],"rank":[28],"such":[30],"that":[31,118,195],"\"best\"":[33],"appear":[35],"first.":[36],"However,":[37],"standard":[38],"comprise":[42],"set":[44,100],"tuples,":[46],"with":[47,190],"no":[48,66],"associated":[49],"ranking.":[50],"It":[51],"typical":[53],"allow":[55],"users":[56,91],"ability":[58],"sort":[60],"on":[62,155],"selected":[63],"attributes,":[64],"but":[65,87],"actual":[67],"ranking":[68],"defined.":[70],"An":[71],"alternative":[72,139],"first":[76],"not":[79],"try":[81],"show":[83,194],"best":[85],"instead":[88],"help":[90],"learn":[92],"what":[93,106],"available":[95],"in":[96,201],"whole":[98],"result":[99,203],"and":[101,186,205],"direct":[102],"them":[103,189],"finding":[105],"they":[107],"need.":[108],"In":[109],"this":[110],"paper,":[111],"we":[112],"demonstrate":[113],"through":[114,130],"study":[117],"comprising":[121],"representative":[123],"from":[124],"each":[125],"k":[127,132],"clusters":[128],"(generated":[129],"-medoid":[133],"clustering)":[134],"superior":[136],"multiple":[138],"candidate":[140],"methods":[141],"for":[142,181],"generating":[143,183],"representatives":[144,165],"data":[147],"set.":[148],"Users":[149],"often":[150],"refine":[151],"specifications":[153],"based":[154],"returned":[156],"results.":[157],"Traditional":[158],"clustering":[159,171],"may":[160],"lead":[161],"completely":[163],"new":[164],"after":[166],"refinement":[168],"step.":[169],"Furthermore,":[170],"computationally":[174],"expensive.":[175],"We":[176],"propose":[177],"tree-based":[179],"method":[180],"efficiently":[182],"representatives,":[185],"smoothly":[187],"adapting":[188],"refinement.":[192],"Experiments":[193],"our":[196],"algorithms":[197],"outperform":[198],"state-of-the-art":[200],"both":[202],"quality":[204],"efficiency.":[206]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}