{"id":"https://openalex.org/W138279173","doi":null,"title":"A Framework for Unsupervised Rank Aggregation","display_name":"A Framework for Unsupervised Rank Aggregation","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W138279173","mag":"138279173"},"language":"en","primary_location":{"id":"mag:138279173","doi":null,"is_oa":false,"landing_page_url":"http://cogcomp.cs.illinois.edu/papers/KlementievRoSm08a.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5051935193","display_name":"Alexandre Klementiev","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexandre Klementiev","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023802054","display_name":"Dan Roth","orcid":"https://orcid.org/0009-0002-1447-5173","observed_orcids":["https://orcid.org/0009-0002-1447-5173"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dan Roth","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0002-1447-5173","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5090984634","display_name":"Kevin Small","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kevin Small","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3131,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.90461252,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.61080002784729,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.61080002784729,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.09070000052452087,"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/T10203","display_name":"Recommender Systems and Techniques","score":0.02810000069439411,"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/rank-aggregation","display_name":"rank aggregation","score":0.9750000238418579},{"id":"https://openalex.org/keywords/unsupervised-learning","display_name":"unsupervised learning","score":0.9900000095367432},{"id":"https://openalex.org/keywords/partial-rankings","display_name":"partial rankings","score":0.8460000157356262},{"id":"https://openalex.org/keywords/permutations","display_name":"permutations","score":0.7350000143051147},{"id":"https://openalex.org/keywords/data-fusion","display_name":"data fusion","score":0.9470000267028809},{"id":"https://openalex.org/keywords/ranking-data","display_name":"rank data","score":0.5720000267028809}],"concepts":[{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.6992504000663757},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6792412400245667},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6734830141067505},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.6396201848983765},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5962187051773071},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5627167820930481},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.5463025569915771},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5028311610221863},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.49877357482910156},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4707548916339874},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.4508306384086609},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.42170649766921997},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.36262747645378113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20730453729629517},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.16044554114341736},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:138279173","doi":null,"is_oa":false,"landing_page_url":"http://cogcomp.cs.illinois.edu/papers/KlementievRoSm08a.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1550469973","https://openalex.org/W1600537614","https://openalex.org/W1877442813","https://openalex.org/W1978604688","https://openalex.org/W1978753906","https://openalex.org/W1985514943","https://openalex.org/W2011395874","https://openalex.org/W2011616938","https://openalex.org/W2016963000","https://openalex.org/W2019473674","https://openalex.org/W2027752285","https://openalex.org/W2049633694","https://openalex.org/W2051834357","https://openalex.org/W2063445365","https://openalex.org/W2078396654","https://openalex.org/W2111286236","https://openalex.org/W2132300069","https://openalex.org/W2138309709","https://openalex.org/W2142646165","https://openalex.org/W2142880323","https://openalex.org/W2145680575","https://openalex.org/W2150781025","https://openalex.org/W2495505314","https://openalex.org/W2751862591"],"related_works":["https://openalex.org/W7100112860","https://openalex.org/W2145680575","https://openalex.org/W1877442813","https://openalex.org/W7096837121","https://openalex.org/W2604706513","https://openalex.org/W7100128938","https://openalex.org/W1481216242","https://openalex.org/W4253137046","https://openalex.org/W2019710252","https://openalex.org/W7099379461"],"abstract_inverted_index":{"The":[0],"need":[1],"to":[2,26,45,61],"meaningfully":[3],"combine":[4],"sets":[5],"of":[6,20,41,75,98,113],"rankings":[7,64],"often":[8],"comes":[9],"up":[10],"when":[11],"one":[12],"deals":[13],"with":[14],"ranked":[15,38],"data.":[16],"Although":[17],"a":[18,54],"number":[19],"heuristic":[21],"and":[22,56,69,78],"supervised":[23,37],"learning":[24,60,88],"approaches":[25,115],"rank":[27,91],"aggregation":[28,92],"exist,":[29],"they":[30],"generally":[31],"require":[32],"either":[33],"domain":[34],"knowledge":[35],"or":[36],"data,":[39],"both":[40,114],"which":[42,94],"are":[43],"expensive":[44],"acquire.":[46],"To":[47],"address":[48],"these":[49],"limitations,":[50],"we":[51,83],"propose":[52],"1":[53],"mathematical":[55],"algorithmic":[57],"framework":[58,100],"for":[59,72,90],"aggregate":[62],"(partial)":[63],"in":[65],"an":[66,86],"unsupervised":[67,87],"setting,":[68],"instantiate":[70],"it":[71],"the":[73,96,104,111,117],"cases":[74],"combining":[76,79],"permutations":[77],"top-k":[80],"lists.":[81],"Furthermore,":[82],"also":[84],"derive":[85],"algorithm":[89],"(ULARA),":[93],"approximates":[95],"behavior":[97],"this":[99],"by":[101],"directly":[102],"optimizing":[103],"weighted":[105],"Borda":[106],"count.":[107],"We":[108],"experimentally":[109],"demonstrate":[110],"eectiveness":[112],"on":[116],"data":[118],"fusion":[119],"task.":[120]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}