An Iterative Distance-Based Model for Unsupervised Weighted Rank Aggregation
Rank aggregation is a popular problem that combines different ranked lists from various sources (frequently called voters or judges), and generates a single aggregated list with improved ranking of its items. In this context, a portion of the existing methods attempt to address the problem by treati...
Saved in:
| Published in: | 2019 IEEE WIC ACM International Conference on Web Intelligence (WI) pp. 358 - 362 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
New York, NY, USA
ACM
14.10.2019
|
| Series: | ACM Other Conferences |
| Subjects: | |
| ISBN: | 1450369340, 9781450369343 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Rank aggregation is a popular problem that combines different ranked lists from various sources (frequently called voters or judges), and generates a single aggregated list with improved ranking of its items. In this context, a portion of the existing methods attempt to address the problem by treating all voters equally. Nevertheless, several related works proved that the careful and effective assignment of different weights to each voter leads to enhanced performance. In this article, we introduce an unsupervised algorithm for learning the weights of the voters for a specific topic or query. The proposed method is based on the fact that if a voter has submitted numerous elements which have been placed in high positions in the aggregated list, then this voter should be treated as an expert, compared to the voters whose suggestions appear in lower places or do not appear at all. The algorithm iteratively computes the distance of each input list with the aggregated list and modifies the weights of the voters until all weights converge. The effectiveness of the proposed method is experimentally demonstrated by aggregating input lists from six TREC conferences. |
|---|---|
| AbstractList | Rank aggregation is a popular problem that combines different ranked lists from various sources (frequently called voters or judges), and generates a single aggregated list with improved ranking of its items. In this context, a portion of the existing methods attempt to address the problem by treating all voters equally. Nevertheless, several related works proved that the careful and effective assignment of different weights to each voter leads to enhanced performance. In this article, we introduce an unsupervised algorithm for learning the weights of the voters for a specific topic or query. The proposed method is based on the fact that if a voter has submitted numerous elements which have been placed in high positions in the aggregated list, then this voter should be treated as an expert, compared to the voters whose suggestions appear in lower places or do not appear at all. The algorithm iteratively computes the distance of each input list with the aggregated list and modifies the weights of the voters until all weights converge. The effectiveness of the proposed method is experimentally demonstrated by aggregating input lists from six TREC conferences. Rank aggregation is a popular problem that combines different ranked lists from various sources (frequently called voters or judges), and generates a single aggregated list with improved ranking of its items. In this context, a portion of the existing methods attempt to address the problem by treating all voters equally. Nevertheless, several related works proved that the careful and effective assignment of different weights to each voter leads to enhanced performance. In this article, we introduce an unsupervised algorithm for learning the weights of the voters for a specific topic or query. The proposed method is based on the fact that if a voter has submitted numerous elements which have been placed in high positions in the aggregated list, then this voter should be treated as an expert, compared to the voters whose suggestions appear in lower places or do not appear at all. The algorithm iteratively computes the distance of each input list with the aggregated list and modifies the weights of the voters until all weights converge. The effectiveness of the proposed method is experimentally demonstrated by aggregating input lists from six TREC conferences.CCS CONCEPTS* Information systems → Rank aggregation; *Theory of computation → Unsupervised learning and clustering. |
| Author | Akritidis, Leonidas Bozanis, Panayiotis Fevgas, Athanasios |
| Author_xml | – sequence: 1 givenname: Leonidas surname: Akritidis fullname: Akritidis, Leonidas email: leoakr@e-ce.uth.gr organization: Department Electrical and Computer Engineering, University of Thessaly, Greece – sequence: 2 givenname: Athanasios surname: Fevgas fullname: Fevgas, Athanasios email: fevgas@e-ce.uth.gr organization: Department Electrical and Computer Engineering, University of Thessaly, Greece – sequence: 3 givenname: Panayiotis surname: Bozanis fullname: Bozanis, Panayiotis email: pbozanis@e-ce.uth.gr organization: Department Electrical and Computer Engineering, University of Thessaly, Greece |
| BookMark | eNqNkL1PwzAQxY0ACVo6M7BkZEnxZx2PoeWjUhESomK07OYcTFunskMl_ntSNQMj07t7T--k-w3QWWgCIHRN8JgQLu4YE1jwybhTKrg8QYPOxWyiGMenf5cLNErpC2NMJaZYqUu0KEM2byGa1u8hm_nUmrCC_N4kqLKXpoJN5pqYLUP63kHc-4P9Ab7-bLvhzYR1VtZ1hLrrN-EKnTuzSTDqdYiWjw_v0-d88fo0n5aL3FAu25xaSSmfECuZMowWVjjMmYPuiUoWThpHqsoKo1YcuwKsYRURnBcCpJUFEDZEN8e7HgD0LvqtiT-6UFhxdUjHx9Sstto2zTppgvUBlO5B6R6UttGD6wq3_yywX8woZ2w |
| ContentType | Conference Proceeding |
| Copyright | 2019 ACM |
| Copyright_xml | – notice: 2019 ACM |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1145/3350546.3352547 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 1450369340 9781450369343 |
| Editor | Vakali, Athena Gottlob, Georg Tzouramanis, Theodoros Barnaghi, Payam Manolopoulos, Yannis |
| Editor_xml | – sequence: 1 givenname: Payam surname: Barnaghi fullname: Barnaghi, Payam – sequence: 2 givenname: Georg surname: Gottlob fullname: Gottlob, Georg – sequence: 3 givenname: Yannis surname: Manolopoulos fullname: Manolopoulos, Yannis – sequence: 4 givenname: Theodoros surname: Tzouramanis fullname: Tzouramanis, Theodoros – sequence: 5 givenname: Athena surname: Vakali fullname: Vakali, Athena |
| EndPage | 362 |
| ExternalDocumentID | 8909491 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IL 6IN AAJGR ABLEC ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IEGSK OCL RIB RIC RIE RIL AAWTH LHSKQ |
| ID | FETCH-LOGICAL-a247t-2b722461b739a328b5f043fe505d78f7af1ddb5a9c40f8eba3d154485e7b78e13 |
| IEDL.DBID | RIE |
| ISBN | 1450369340 9781450369343 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000519076200053&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:40:22 EDT 2025 Wed Jan 31 06:55:59 EST 2024 Wed Jan 31 06:36:25 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | unsupervised rank aggregation weighted rank aggregation distance-based rank aggregation unsupervised learning |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | DirectLink |
| MeetingName | WI '19: IEEE/WIC/ACM International Conference on Web Intelligence |
| MergedId | FETCHMERGED-LOGICAL-a247t-2b722461b739a328b5f043fe505d78f7af1ddb5a9c40f8eba3d154485e7b78e13 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_8909491 acm_books_10_1145_3350546_3352547 acm_books_10_1145_3350546_3352547_brief |
| PublicationCentury | 2000 |
| PublicationDate | 20191014 2019-Oct. |
| PublicationDateYYYYMMDD | 2019-10-14 2019-10-01 |
| PublicationDate_xml | – month: 10 year: 2019 text: 20191014 day: 14 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Other Conferences |
| PublicationTitle | 2019 IEEE WIC ACM International Conference on Web Intelligence (WI) |
| PublicationTitleAbbrev | WI-IAT |
| PublicationYear | 2019 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0002702099 |
| Score | 1.7156657 |
| Snippet | Rank aggregation is a popular problem that combines different ranked lists from various sources (frequently called voters or judges), and generates a single... |
| SourceID | ieee acm |
| SourceType | Publisher |
| StartPage | 358 |
| SubjectTerms | Computational modeling Computing methodologies Computing methodologies -- Machine learning Convergence distance-based Information systems Information systems -- Information retrieval Information systems -- Information retrieval -- Retrieval models and ranking Information systems -- Information retrieval -- Retrieval tasks and goals Information systems -- Information systems applications Iterative methods Kernel Logic gates Measurement rank aggregation Unsupervised learning unsupervised rank aggregation weighted rank aggregation |
| Title | An Iterative Distance-Based Model for Unsupervised Weighted Rank Aggregation |
| URI | https://ieeexplore.ieee.org/document/8909491 |
| WOSCitedRecordID | wos000519076200053&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFA5z-OCTyibOGxEEX-zWNkmTPs7LUJAxxOHeSi4nQ9Ru7OLvN0nLRBDEtxBCS79AzndO830HoQurjfE2SlHmJT5UJzZSiUmjlMkYuNRghQrNJvhwKCaTfNRAVxstDACEy2fQ9cPwL9_M9NqXynoid8mIl6pvcZ5VWq1NPcXrqhzbqd17Esp6hLjoTrOuVxUxGsKP_vjRRCXEkMHu_96-h9rfYjw82oSZfdSAsoUe-yV-CIbI7rTCt54EunXRtYtJBvv-Zu_YsVE8LpfruT8N_PRLqIK6wZMs33B_6jLtadiXNhoP7p5v7qO6MUIkU8pXUap48IFTnOSSpEIxG1NiwX2v4cJyaRNjFJO5prEVoCQx3nRHMOCKC0jIAWqWsxIOEc60UUrExuTuEZzlEignQlEtHIRg4w46d6gVnvEvi0rEzIoa2aJGtoMu_1xTKJf52w5qeVyLeeWkUdSQHv0-fYx2HD3Jq6tzJ6i5WqzhFG3rz9XrcnEWtv8LGg2s0Q |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwGA1jCvqksonzGkHwxW5tkyzp47yMDecYsuHeQq5D1G7s4u83ycpEEMS3EEJLT0vO933NOR8AV1Zp7W2UoqaX-GCV2EgmOo1SImJDhTKWydBsgvb7bDzOBiVws9HCGGPC4TNT98PwL19P1cqXyhosc8mIl6pvEYzTeK3W2lRUvLLKxTuFf0-CSQMhx--4Wfe6IoIDAamPH21UAou09_53_31Q_ZbjwcGGaA5AyeQV0GvlsBsskd1-Be99GOjWRbeOlTT0Hc7eoYtH4ShfrGZ-P_DTL6EO6gbPIn-DrYnLtSfhzVTBqP0wvOtERWuESKSYLqNU0uAEJynKBEqZJDbGyBr3vJoyS4VNtJZEZArHlhkpkPa2O4wYKikzCToE5XyamyMAm0pLyWKtM3cJSjJhMEVMYsUchMbGNXDpUOM-5l_wtYyZ8AJZXiBbA9d_ruHS5f62BioeVz5be2nwAtLj36cvwE5n-NTjvW7_8QTsumAlWx-kOwXl5XxlzsC2-ly-Lubn4VP4AknJsBg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE%2FWIC%2FACM+International+Conference+on+Web+Intelligence&rft.atitle=An+Iterative+Distance-Based+Model+for+Unsupervised+Weighted+Rank+Aggregation&rft.au=Akritidis%2C+Leonidas&rft.au=Fevgas%2C+Athanasios&rft.au=Bozanis%2C+Panayiotis&rft.series=ACM+Other+Conferences&rft.date=2019-10-14&rft.pub=ACM&rft.isbn=1450369340&rft.spage=358&rft.epage=362&rft_id=info:doi/10.1145%2F3350546.3352547 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450369343/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450369343/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450369343/sc.gif&client=summon&freeimage=true |