{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:24:08Z","timestamp":1760059448210,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:00:00Z","timestamp":1749686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Rank aggregation deals with the problem of fusing multiple ranked lists of elements into a single aggregate list with improved element ordering. Such cases are frequently encountered in numerous applications across a variety of areas, including bioinformatics, machine learning, statistics, information retrieval, and so on. The weighted rank aggregation methods consider a more advanced version of the problem by assuming that the input lists are not of equal importance. In this context, they first apply ad hoc techniques to assign weights to the input lists, and then, they study how to integrate these weights into the scores of the individual list elements. In this paper, we adopt the idea of exploiting the list weights not only during the computation of the element scores, but also to determine which elements will be included in the consensus aggregate list. More specifically, we introduce and analyze a novel refinement mechanism, called WIRE, that effectively removes the weakest elements from the less important input lists, thus improving the quality of the output ranking. We experimentally demonstrate the effectiveness of our method in multiple datasets by comparing it with a collection of state-of-the-art weighted and non-weighted techniques.<\/jats:p>","DOI":"10.3390\/a18060362","type":"journal-article","created":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:47:07Z","timestamp":1749728827000},"page":"362","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["WIRE: A Weighted Item Removal Method for Unsupervised Rank Aggregation"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6602-0723","authenticated-orcid":false,"given":"Leonidas","family":"Akritidis","sequence":"first","affiliation":[{"name":"School of Science and Technology, International Hellenic University, 57001 Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panayiotis","family":"Bozanis","sequence":"additional","affiliation":[{"name":"School of Science and Technology, International Hellenic University, 57001 Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,6,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Chen, J., Long, R., Wang, X.l., Liu, B., and Chou, K.C. (2016). PdRHP-PseRA: Detecting remote homology proteins using profile-based pseudo protein sequence and rank aggregation. Sci. Rep., 6.","DOI":"10.1038\/srep32333"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1093\/bib\/bbx101","article-title":"A comparative study of rank aggregation methods for partial and top ranked lists in genomic applications","volume":"20","author":"Li","year":"2019","journal-title":"Briefings Bioinform."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Gyarmati, L., Orb\u00e1n-Mih\u00e1lyk\u00f3, \u00c9., Mih\u00e1lyk\u00f3, C., and Vathy-Fogarassy, \u00c1. (2023). Aggregated Rankings of Top Leagues\u2019 Football Teams: Application and Comparison of Different Ranking Methods. Appl. Sci., 13.","DOI":"10.3390\/app13074556"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3365375","article-title":"Is rank aggregation effective in recommender systems? An experimental analysis","volume":"11","author":"Oliveira","year":"2020","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Ba\u0142chanowski, M., and Boryczka, U. (2023). A comparative study of rank aggregation methods in recommendation systems. Entropy, 25.","DOI":"10.3390\/e25010132"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Akritidis, L., Katsaros, D., and Bozanis, P. (2008, January 28\u201330). Effective ranking fusion methods for personalized metasearch engines. Proceedings of the 12th Panhellenic Conference on Informatics, Samos Island, Greece.","DOI":"10.1109\/PCI.2008.31"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Wang, M., Li, Q., Lin, Y., and Zhou, B. (2017, January 26\u201328). A personalized result merging method for metasearch engine. Proceedings of the 6th International Conference on Software and Computer Applications, Bangkok, Thailand.","DOI":"10.1145\/3056662.3056698"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.jss.2010.09.001","article-title":"Effective rank aggregation for metasearching","volume":"84","author":"Akritidis","year":"2011","journal-title":"J. Syst. Softw."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00303169","article-title":"Voting schemes for which it can be difficult to tell who won the election","volume":"6","author":"Bartholdi","year":"1989","journal-title":"Soc. Choice Welf."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kilgour, D.M. (2010). Approval balloting for multi-winner elections. Handbook on Approval Voting, Springer.","DOI":"10.1007\/978-3-642-02839-7_6"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"104096","DOI":"10.1016\/j.ipm.2025.104096","article-title":"A Robust Rank Aggregation Framework for Collusive Disturbance Based on Community Detection","volume":"62","author":"Chen","year":"2025","journal-title":"Inf. Process. Manag."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"9353","DOI":"10.1109\/TPAMI.2024.3416710","article-title":"Sequential Manipulation Against Rank Aggregation: Theory and Algorithm","volume":"46","author":"Ma","year":"2024","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"117435","DOI":"10.1016\/j.eswa.2022.117435","article-title":"An unsupervised distance-based model for weighted rank aggregation with list pruning","volume":"202","author":"Akritidis","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_14","unstructured":"de Borda, J.C. (1781). M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l\u2019Academie Royale des Sciences, Imprimerie Royale."},{"key":"ref_15","unstructured":"De Condorcet, N. (1785). Essai sur l\u2019Application de l\u2019Analyse \u00e0 la Probabilit\u00e9 des D\u00e9cisions Rendues \u00e0 la Pluralit\u00e9 des Voix, Imprimerie Royale."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00355-011-0603-9","article-title":"The original Borda Count and partial voting","volume":"40","author":"Emerson","year":"2013","journal-title":"Soc. Choice Welf."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Montague, M., and Aslam, J.A. (2002, January 4\u20139). Condorcet fusion for improved retrieval. Proceedings of the 11th ACM International Conference on Information and Knowledge Management, McLean, VA, USA.","DOI":"10.1145\/584879.584881"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"103860","DOI":"10.1016\/j.ipm.2024.103860","article-title":"Rank Aggregation with Limited Information Based on Link Prediction","volume":"61","author":"Li","year":"2024","journal-title":"Inf. Process. Manag."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., and Sivakumar, D. (2001, January 1\u20135). Rank aggregation methods for the Web. Proceedings of the 10th International Conference on World Wide Web, Hong Kong, China.","DOI":"10.1145\/371920.372165"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"DeConde, R.P., Hawley, S., Falcon, S., Clegg, N., Knudsen, B., and Etzioni, R. (2006). Combining results of microarray experiments: A rank aggregation approach. Stat. Appl. Genet. Mol. Biol., 5.","DOI":"10.2202\/1544-6115.1204"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1093\/bioinformatics\/btr709","article-title":"Robust rank aggregation for gene list integration and meta-analysis","volume":"28","author":"Kolde","year":"2012","journal-title":"Bioinformatics"},{"key":"ref_22","first-page":"577","article-title":"Mathematics without numbers","volume":"88","author":"Kemeny","year":"1959","journal-title":"Daedalus"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0135023","article-title":"A consistent extension of Condorcet\u2019s election principle","volume":"35","author":"Young","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Farah, M., and Vanderpooten, D. (2007, January 23\u201327). An outranking approach for rank aggregation in information retrieval. Proceedings of the 30th ACM Conference on Research and Development in Information Retrieval, Amsterdam, The Netherlands.","DOI":"10.1145\/1277741.1277843"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1093\/bioinformatics\/btm158","article-title":"Weighted rank aggregation of cluster validation measures: A Monte Carlo cross-entropy approach","volume":"23","author":"Pihur","year":"2007","journal-title":"Bioinformatics"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.eswa.2015.12.005","article-title":"Preference relations based unsupervised rank aggregation for metasearch","volume":"49","author":"Desarkar","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.knosys.2018.02.005","article-title":"A weighted rank aggregation approach towards crowd opinion analysis","volume":"149","author":"Chatterjee","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"101319","DOI":"10.1016\/j.softx.2023.101319","article-title":"FLAGR: A flexible high-performance library for rank aggregation","volume":"21","author":"Akritidis","year":"2023","journal-title":"SoftwareX"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Renda, M.E., and Straccia, U. (2003, January 9\u201312). Web metasearch: Rank vs. Score based rank aggregation methods. Proceedings of the 2003 ACM Symposium on Applied Computing, Melbourne, FL, USA.","DOI":"10.1145\/952686.952698"},{"key":"ref_30","unstructured":"Copeland, A.H. (1951). A Reasonable Social Welfare Function, University of Michigan. Technical Report."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/6\/362\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:51:03Z","timestamp":1760032263000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/6\/362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,12]]},"references-count":30,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["a18060362"],"URL":"https:\/\/doi.org\/10.3390\/a18060362","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,6,12]]}}}