{"id":"https://openalex.org/W2896831428","doi":"https://doi.org/10.1109/ijcnn.2018.8489160","title":"Unsupervised Learning to Rank Aggregation using Parameterized Function Optimization","display_name":"Unsupervised Learning to Rank Aggregation using Parameterized Function Optimization","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2896831428","doi":"https://doi.org/10.1109/ijcnn.2018.8489160","mag":"2896831428"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2018.8489160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2018.8489160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5065400728","display_name":"Amirhossein Tavanaei","orcid":"https://orcid.org/0000-0002-6482-440X"},"institutions":[{"id":"https://openalex.org/I79516672","display_name":"University of Louisiana at Lafayette","ror":"https://ror.org/01x8rc503","country_code":"US","type":"education","lineage":["https://openalex.org/I2799628689","https://openalex.org/I79516672"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amirhossein Tavanaei","raw_affiliation_strings":["NSF Center for Visual and Decision Informatics (CVDI), Informatics Research Institute of University of Louisiana at Lafayette, LA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NSF Center for Visual and Decision Informatics (CVDI), Informatics Research Institute of University of Louisiana at Lafayette, LA, USA","institution_ids":["https://openalex.org/I79516672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045680192","display_name":"Raju Gottumukkalay","orcid":null},"institutions":[{"id":"https://openalex.org/I79516672","display_name":"University of Louisiana at Lafayette","ror":"https://ror.org/01x8rc503","country_code":"US","type":"education","lineage":["https://openalex.org/I2799628689","https://openalex.org/I79516672"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raju Gottumukkalay","raw_affiliation_strings":["School of Computing and Informatics, University of Louisiana at Lafayette, LA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing and Informatics, University of Louisiana at Lafayette, LA, USA","institution_ids":["https://openalex.org/I79516672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075357799","display_name":"Anthony S. Maida","orcid":"https://orcid.org/0000-0003-2586-2865"},"institutions":[{"id":"https://openalex.org/I79516672","display_name":"University of Louisiana at Lafayette","ror":"https://ror.org/01x8rc503","country_code":"US","type":"education","lineage":["https://openalex.org/I2799628689","https://openalex.org/I79516672"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anthony S. Maida","raw_affiliation_strings":["School of Computing and Informatics, University of Louisiana at Lafayette, LA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing and Informatics, University of Louisiana at Lafayette, LA, USA","institution_ids":["https://openalex.org/I79516672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023699325","display_name":"Vijay V. Raghavan","orcid":"https://orcid.org/0000-0001-7224-7828"},"institutions":[{"id":"https://openalex.org/I79516672","display_name":"University of Louisiana at Lafayette","ror":"https://ror.org/01x8rc503","country_code":"US","type":"education","lineage":["https://openalex.org/I2799628689","https://openalex.org/I79516672"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijay V. Raghavan","raw_affiliation_strings":["NSF Center for Visual and Decision Informatics (CVDI), Informatics Research Institute of University of Louisiana at Lafayette, LA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NSF Center for Visual and Decision Informatics (CVDI), Informatics Research Institute of University of Louisiana at Lafayette, LA, USA","institution_ids":["https://openalex.org/I79516672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I79516672"],"apc_list":null,"apc_paid":null,"fwci":0.666,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69312356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9945999979972839,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9866999983787537,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.823553204536438},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.7741658091545105},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.7342073917388916},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.6986857056617737},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6622762084007263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6560510396957397},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6392296552658081},{"id":"https://openalex.org/keywords/unsupervised-learning","display_name":"Unsupervised learning","score":0.4971025288105011},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4857052266597748},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45845550298690796},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4351118803024292},{"id":"https://openalex.org/keywords/aggregation-problem","display_name":"Aggregation problem","score":0.4190405011177063},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.411533921957016},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.35049259662628174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23710781335830688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23644739389419556},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07202044129371643}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.823553204536438},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7741658091545105},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.7342073917388916},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.6986857056617737},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6622762084007263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6560510396957397},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6392296552658081},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.4971025288105011},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4857052266597748},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45845550298690796},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4351118803024292},{"id":"https://openalex.org/C32172795","wikidata":"https://www.wikidata.org/wiki/Q4692266","display_name":"Aggregation problem","level":2,"score":0.4190405011177063},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.411533921957016},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.35049259662628174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23710781335830688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23644739389419556},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07202044129371643},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2018.8489160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2018.8489160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Joint Conference on Neural Networks (IJCNN)","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":51,"referenced_works":["https://openalex.org/W43928053","https://openalex.org/W138279173","https://openalex.org/W1481017241","https://openalex.org/W1547121070","https://openalex.org/W1877442813","https://openalex.org/W1934555896","https://openalex.org/W1935651339","https://openalex.org/W1969830451","https://openalex.org/W1973435495","https://openalex.org/W1985554184","https://openalex.org/W1988686126","https://openalex.org/W1997136459","https://openalex.org/W2011395874","https://openalex.org/W2013784666","https://openalex.org/W2040156385","https://openalex.org/W2051275384","https://openalex.org/W2056872955","https://openalex.org/W2056958683","https://openalex.org/W2063445365","https://openalex.org/W2094536313","https://openalex.org/W2100119435","https://openalex.org/W2103850933","https://openalex.org/W2111292692","https://openalex.org/W2115822807","https://openalex.org/W2129245267","https://openalex.org/W2134837986","https://openalex.org/W2142385580","https://openalex.org/W2143331230","https://openalex.org/W2145680575","https://openalex.org/W2146081744","https://openalex.org/W2149427297","https://openalex.org/W2151357995","https://openalex.org/W2157542375","https://openalex.org/W2510009704","https://openalex.org/W2513853793","https://openalex.org/W2579197477","https://openalex.org/W2763110165","https://openalex.org/W2793848360","https://openalex.org/W3099514962","https://openalex.org/W4212901515","https://openalex.org/W4250857377","https://openalex.org/W4251560691","https://openalex.org/W4285719527","https://openalex.org/W6605582092","https://openalex.org/W6628631849","https://openalex.org/W6632915347","https://openalex.org/W6639380717","https://openalex.org/W6640406786","https://openalex.org/W6675337486","https://openalex.org/W6676865029","https://openalex.org/W6679205522"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W4255576661","https://openalex.org/W1516574938","https://openalex.org/W2563912921","https://openalex.org/W2896831428"],"abstract_inverted_index":{"This":[0,14],"paper":[1],"proposes":[2],"a":[3,17,123],"novel":[4],"unsupervised":[5,110,155,181],"rank":[6,19,31,49,60,94,101,111,156,182],"aggregation":[7,20,61,112],"method":[8,62],"using":[9],"parameterized":[10,18],"function":[11],"optimization":[12],"(PFO).":[13],"algorithm":[15,193],"derives":[16],"model":[21,164,178],"by":[22,162,171],"minimizing":[23],"the":[24,46,52,89,98,114,132,139,168,176,189,192],"energy":[25],"of":[26,30,48,83,91,175,191],"weighted":[27],"standard":[28],"deviations":[29],"lists":[32,50],"associated":[33],"with":[34,73,148,167],"different":[35],"rankers":[36],"or":[37],"attributes.":[38],"Parameters,":[39],"in":[40,93,109,126,146,194],"this":[41],"problem,":[42],"are":[43,85],"weights":[44],"representing":[45],"impact":[47],"on":[51,97,116,131,185],"final":[53],"aggregated":[54],"rank.":[55],"The":[56,128,158],"proposed":[57],"learning":[58,99],"to":[59,87,100,105,121],"is":[63],"efficient":[64],"(linear":[65],"time":[66,79],"complexity)":[67],"and":[68,113,142],"its":[69,107],"accuracy":[70],"compares":[71],"favorably":[72,166],"pairwise":[74],"preference":[75],"methods":[76,152],"(with":[77],"polynomial":[78],"complexity).":[80],"Two":[81],"rounds":[82],"experiments":[84],"run":[86],"show":[88,106,134,143],"success":[90,108],"PFO":[92,136,177],"aggregation:":[95],"one":[96],"(LETOR)":[102],"benchmark":[103],"dataset":[104],"other":[115],"three":[117],"university":[118,159],"ranking":[119,196],"datasets":[120],"solve":[122],"practical":[124,186],"problem":[125],"education.":[127],"experimental":[129],"results":[130,141],"LETOR":[133],"that":[135],"significantly":[137],"outperforms":[138],"baseline":[140],"promising":[144],"performances":[145],"comparison":[147],"recent":[149],"high":[150],"performance":[151],"developed":[153],"for":[154,179],"aggregation.":[157],"ranks":[160,169],"obtained":[161],"our":[163],"compare":[165],"reported":[170],"well-known":[172],"organizations.":[173],"Success":[174],"performing":[180],"aggregation,":[183],"specifically":[184],"problems,":[187],"supports":[188],"use":[190],"difficult":[195],"scenarios":[197],"without":[198],"ground":[199],"truth.":[200]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}