Heuristic Search for Rank Aggregation with Application to Label Ranking
Rank aggregation aims to combine the preference rankings of a number of alternatives from different voters into a single consensus ranking. As a useful model for a variety of practical applications, however, it is a computationally challenging problem. In this paper, we propose an effective hybrid evolutionary ranking algorithm to solve the rank aggregation problem with both complete and partial rankings. The algorithm features a semantic crossover based on concordant pairs and a late acceptance local search reinforced by an efficient incremental evaluation technique. Experiments are conducted to assess the algorithm, indicating a highly competitive performance on benchmark instances compared with state-of-the-art algorithms. To demonstrate its practical usefulness, the algorithm is applied to label ranking, which is an important machine learning task.
Code (0)
등록된 구현이 없습니다.
Tasks
Heuristic SearchSimilar Papers 제목 키워드 기반
Towards Foundation Models for Consensus Rank Aggregation
Aggregating a consensus ranking from multiple input rankings is a fundamental problem with applications in recommendation systems, search engines, job recruitment, and elections. Despite decades of research in consensus …
Reinforcement LearningRecommendation SystemsWeight Set Decomposition for Weighted Rank Aggregation: An interpretable and visual decision support tool
The problem of interpreting or aggregating multiple rankings is common to many real-world applications. Perhaps the simplest and most common approach is a weighted rank aggregation, wherein a (convex) weight is applied t…
A comparative analysis of rank aggregation methods for the partial label ranking problem
The \textit{label ranking} problem is a supervised learning scenario in which the learner predicts a \textit{total order} of the class labels for a given input instance. Recently, research has increasingly focused on the…
Heuristic for Diverse Kemeny Rank Aggregation based on Quantum Annealing
The Kemeny Rank Aggregation (KRA) problem is a well-studied problem in the field of Social Choice with a variety of applications in many different areas like databases and search engines. Intuitively, given a set of vote…
DiversityRanking Aggregation with Interactive Feedback for Collaborative Person Re-identification
Person re-identification (re-ID) aims to retrieve the same person from a group of networking cameras. Ranking aggregation (RA), a method to aggregates multiple ranking results, can further improve the retrieval accuracy …
Person Re-IdentificationRe-RankingRetrieval