{"id":"https://openalex.org/W2996832948","doi":"https://doi.org/10.14778/3368289.3368291","title":"A unified optimization algorithm for solving \"regret-minimizing representative\" problems","display_name":"A unified optimization algorithm for solving \"regret-minimizing representative\" problems","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W2996832948","doi":"https://doi.org/10.14778/3368289.3368291","mag":"2996832948"},"language":"en","primary_location":{"id":"doi:10.14778/3368289.3368291","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3368289.3368291","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/A5046581906","display_name":"Suraj Shetiya","orcid":"https://orcid.org/0000-0001-9166-2365"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Suraj Shetiya","raw_affiliation_strings":["University of Texas at Arlington"],"affiliations":[{"raw_affiliation_string":"University of Texas at Arlington","institution_ids":["https://openalex.org/I189196454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027319416","display_name":"Abolfazl Asudeh","orcid":"https://orcid.org/0000-0002-5251-6186"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abolfazl Asudeh","raw_affiliation_strings":["University of Illinois at Chicago"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Chicago","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005312488","display_name":"Sadia Ahmed","orcid":"https://orcid.org/0000-0001-6526-9172"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sadia Ahmed","raw_affiliation_strings":["University of Texas at Arlington"],"affiliations":[{"raw_affiliation_string":"University of Texas at Arlington","institution_ids":["https://openalex.org/I189196454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002203026","display_name":"Gautam Das","orcid":"https://orcid.org/0000-0002-4627-9065"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gautam Das","raw_affiliation_strings":["University of Texas at Arlington"],"affiliations":[{"raw_affiliation_string":"University of Texas at Arlington","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5046581906"],"corresponding_institution_ids":["https://openalex.org/I189196454"],"apc_list":null,"apc_paid":null,"fwci":1.1684,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80130234,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"3","first_page":"239","last_page":"251"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9886999726295471,"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/T12288","display_name":"Optimization and Search Problems","score":0.9865999817848206,"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/regret","display_name":"Regret","score":0.7111608386039734},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.7049669027328491},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5026931762695312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4796586334705353},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45760488510131836},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.435890257358551},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43453043699264526},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.41890907287597656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41877374053001404},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.41325700283050537},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39054757356643677},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16055181622505188},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1282203495502472},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12086322903633118},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11289280652999878}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7111608386039734},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.7049669027328491},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5026931762695312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4796586334705353},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45760488510131836},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.435890257358551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43453043699264526},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.41890907287597656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41877374053001404},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.41325700283050537},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39054757356643677},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16055181622505188},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1282203495502472},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12086322903633118},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11289280652999878},{"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.14778/3368289.3368291","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3368289.3368291","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W79208629","https://openalex.org/W1256248941","https://openalex.org/W1493454437","https://openalex.org/W1972541019","https://openalex.org/W1977333786","https://openalex.org/W1987679122","https://openalex.org/W2009688537","https://openalex.org/W2014208555","https://openalex.org/W2022210287","https://openalex.org/W2038215007","https://openalex.org/W2085121963","https://openalex.org/W2086804918","https://openalex.org/W2092181172","https://openalex.org/W2104211550","https://openalex.org/W2116434582","https://openalex.org/W2126626732","https://openalex.org/W2139273822","https://openalex.org/W2146831356","https://openalex.org/W2149332744","https://openalex.org/W2167723076","https://openalex.org/W2170188482","https://openalex.org/W2193968147","https://openalex.org/W2296319761","https://openalex.org/W2444486138","https://openalex.org/W2585514975","https://openalex.org/W2591955099","https://openalex.org/W2612011639","https://openalex.org/W2666600683","https://openalex.org/W2758103571","https://openalex.org/W2791243274","https://openalex.org/W2798997222","https://openalex.org/W2897961923","https://openalex.org/W2952154529","https://openalex.org/W2962762307","https://openalex.org/W2999729612","https://openalex.org/W3011213521","https://openalex.org/W4231916799","https://openalex.org/W4256046779","https://openalex.org/W6603198872","https://openalex.org/W6654151595","https://openalex.org/W6675442171","https://openalex.org/W6679196244","https://openalex.org/W6680420541","https://openalex.org/W6734655831","https://openalex.org/W6750516253","https://openalex.org/W6764373776"],"related_works":["https://openalex.org/W4376155396","https://openalex.org/W2971351794","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W3160516639"],"abstract_inverted_index":{"Given":[0],"a":[1,21,25,67,83,154,168],"database":[2],"with":[3],"numeric":[4],"attributes,":[5],"it":[6],"is":[7,34,91,177],"often":[8],"of":[9,27,31,46,53,66,115,137,186,207,239,268],"interest":[10],"to":[11,16,93,143,146,163,183,263],"rank":[12],"the":[13,29,32,37,43,47,50,54,58,64,73,113,120,138,164,181,184,203,213,265],"tuples":[14],"according":[15],"linear":[17,126,231],"scoring":[18,22],"functions.":[19,127],"For":[20],"function":[23],"and":[24,49,96,140,212,243,259],"subset":[26,33,48,65],"tuples,":[28],"regret":[30,122],"defined":[35],"as":[36,230,251,253],"(relative)":[38],"difference":[39],"in":[40,86,222,235],"scores":[41],"between":[42],"top-1":[44,51],"tuple":[45,52],"entire":[55],"database.":[56],"Finding":[57],"regret-ratio":[59,75],"minimizing":[60],"set":[61,114],"(RRMS),":[62],"i.e.,":[63],"required":[68],"size":[69,116],"k":[70,117],"that":[71,118,191],"minimizes":[72,119],"maximum":[74],"across":[76],"all":[77,125],"possible":[78],"ranking":[79],"functions,":[80],"has":[81],"been":[82,109],"well-studied":[84],"problem":[85,90,174,206],"recent":[87],"years.":[88],"This":[89],"known":[92],"be":[94],"NP-complete":[95,105],"there":[97],"are":[98,141,192],"several":[99,219,244],"approximation":[100],"algorithms":[101,133],"for":[102,134,171],"it.":[103],"Other":[104],"variants":[106,136],"have":[107,130],"also":[108],"investigated,":[110],"e.g.,":[111],"finding":[112],"average":[121],"ratio":[123],"over":[124,257],"Prior":[128],"work":[129],"designed":[131],"customized":[132],"different":[135,155,173],"problem,":[139],"unlikely":[142],"easily":[144],"generalize":[145],"other":[147],"variants.":[148,175],"In":[149,161],"this":[150],"paper":[151],"we":[152,166],"take":[153],"path":[156],"towards":[157],"tackling":[158],"these":[159],"problems.":[160],"contrast":[162],"prior,":[165],"propose":[167],"unified":[169,198],"algorithm":[170,199],"solving":[172],"Unification":[176],"done":[178],"by":[179,194],"localizing":[180],"customization":[182],"design":[185],"variant-specific":[187],"subroutines":[188],"or":[189],"\"oracles\"":[190],"called":[193],"our":[195,224,269],"algorithm.":[196,216],"Our":[197],"takes":[200],"inspiration":[201],"from":[202,209],"seemingly":[204],"unrelated":[205],"clustering":[208],"data":[210,261],"mining,":[211],"corresponding":[214],"k-medoid":[215],"We":[217,246],"make":[218],"innovative":[220],"contributions":[221],"designing":[223],"algorithm,":[225],"including":[226],"various":[227],"techniques":[228],"such":[229],"programming,":[232],"edge":[233],"sampling":[234],"graphs,":[236],"volume":[237],"estimation":[238],"multi-dimensional":[240],"convex":[241],"polytopes,":[242],"others.":[245],"provide":[247],"rigorous":[248],"theoretical":[249],"analysis,":[250],"well":[252],"substantial":[254],"experimental":[255],"evaluations":[256],"real":[258],"synthetic":[260],"sets":[262],"demonstrate":[264],"practical":[266],"feasibility":[267],"approach.":[270]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}