Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

Hodge-Guided Active Preference Elicitation for Efficient Pairwise Ranking

Author 1: Eskander Bejaoui Author 2: Mohamed Ould-Elhassen Aoueileyine Author 3: Ridha Bouallegue
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 17, No. 9 · Published 2026

DOI: 10.14569/IJACSA.2026.01709102

Abstract

Pairwise comparison is a standard method for eliciting user preferences in recommender systems and group decision-making. The number of required comparisons grows quadratically with the number of alternatives, creating a substantial burden for users and platforms. This paper asks whether Hodge decomposition, which splits a preference flow into gradient (consensus), curl (local inconsistency), and harmonic (global inconsistency) components, can guide which comparisons to request, rather than merely aggregate whichever comparisons arrive. Preference elicitation is formalized as a sequential acquisition problem for online HodgeRank. Seven acquisition policies are evaluated, including two novel Hodge-informed policies: HarmonicReduce, which targets edges likely to carry harmonic inconsistency, and FlowClone, a lightweight neural policy trained by behavioural cloning on a compact five-dimensional feature representation. A Bayesian Bradley-Terry active-learning baseline (BALD) is also included. Policies are evaluated on three real-world datasets under a leakage-free protocol: held-out relevance labels come from full-data batch HodgeRank, tracked via normalized discounted cumulative gain, and validated under five-fold leave-users-out cross-validation so every user is evaluated once. Across all three datasets, geometry-informed active policies cut the comparisons needed to reach a fixed recommendation-quality threshold by roughly half relative to random sampling (43–56% depending on dataset). They consistently outperform BALD, which is itself a statistically confirmed improvement over random sampling on two of the three datasets. This advantage depends on the scoring model: pairing active acquisition with a Borda count aggregator produces worse outcomes than random acquisition with HodgeRank, a phenomenon termed the Borda collapse and confirmed significant, in both directions, by paired Wilcoxon tests with Holm-Bonferroni correction. HarmonicReduce’s effectiveness depends on comparison-graph density, a pattern proven exactly from the circuit rank of the comparison graph. These findings show that Hodge-theoretic structure is informative not only for aggregating collected preferences, but also for deciding which preferences to collect.

Keywords

How to Cite this Article

Bejaoui, E., Aoueileyine, M. O., & Bouallegue, R. (2026). Hodge-Guided Active Preference Elicitation for Efficient Pairwise Ranking. International Journal of Advanced Computer Science and Applications, 17(9). https://doi.org/10.14569/IJACSA.2026.01709102

Bejaoui, Eskander, et al.. "Hodge-Guided Active Preference Elicitation for Efficient Pairwise Ranking." International Journal of Advanced Computer Science and Applications, vol. 17, no. 9, 2026, https://doi.org/10.14569/IJACSA.2026.01709102.

@article{Bejaoui2026,
  title     = {Hodge-Guided Active Preference Elicitation for Efficient Pairwise Ranking},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {17},
  number    = {9},
  year      = {2026},
  publisher = {The Science and Information Organization},
  author    = {Eskander Bejaoui and Mohamed Ould-Elhassen Aoueileyine and Ridha Bouallegue},
  doi       = {10.14569/IJACSA.2026.01709102},
  url       = {https://doi.org/10.14569/IJACSA.2026.01709102}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.

Call for Papers - Important Dates

Volume 17 No. 11, November 2026
Paper Submission Due October 25, 2026
Review Notification November 15, 2026
Publication Date November 30, 2026