Unsupervised Graph-based Rank Aggregation For Improved Retrieval

Abstract

This paper presents a robust and comprehensive graph-based rank aggregation approach, used to combine results of isolated ranker models in retrieval tasks. The method follows an unsupervised scheme, which is independent of how the isolated ranks are formulated. Our approach is able to combine arbitrary models, defined in terms of different ranking criteria, such as those based on textual, image or hybrid content representations. We reformulate the ad-hoc retrieval problem as a document retrieval based on fusion graphs, which we propose as a new unified representation model capable of merging multiple ranks and expressing inter-relationships of retrieval results automatically. By doing so, we claim that the retrieval system can benefit from learning the manifold structure of datasets, thus leading to more effective results. Another contribution is that our graph-based aggregation formulation, unlike existing approaches, allows for encapsulating contextual information encoded from mult

Stats

• citations15
• S2 citations—
• github stars0
• HF likes0
• heat score9.03
• arxiv keydourado2019unsupervised

Related papers

• Fusion Vectors: Embedding Graph Fusions For Efficient Unsupervised Rank Aggregation (2019)0.00
• Unified Learning-to-rank For Multi-channel Retrieval In Large-scale E-commerce Search (2026)0.00
• Optimization Of Rank Losses For Image Retrieval (2023)9.43
• Few-shot Prompting For Pairwise Ranking: An Effective Non-parametric Retrieval Model (2024)5.84
• Graph Convolution Based Efficient Re-ranking For Visual Retrieval (2023)9.92
• Enhancing The Ranking Context Of Dense Retrieval Methods Through Reciprocal Nearest Neighbors (2023)4.52
• Rankgraph: Unified Heterogeneous Graph Learning For Cross-domain Recommendation (2025)3.58
• Optimizing Compound Retrieval Systems (2025)0.00