A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Ranking from Pairwise Comparisons
2013
International Conference on Machine Learning
Preserved Fulltext
The ranking of n objects based on pairwise comparisons is a core machine learning problem, arising in recommender systems, ad placement, player ranking, biological applications and others. ...
In many practical situations the true pairwise comparisons cannot be actively measured, but a subset of all n(n − 1)/2 comparisons is passively and noisily observed. ...
Introduction Ranking from binary comparisons is a ubiquitous problem in modern machine learning applications. ...
dblp:conf/icml/WauthierJJ13
fatcat:m6lfxcw2ibdwljrntd2q37bb3e
Efficient computation of rankings from pairwise comparisons
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2022 pre-print arXiv:2207.00076v1 fatcat:fwkxueeewrckhk3kkygm5qa57y
We study the ranking of individuals, teams, or objects, based on pairwise comparisons between them, using the Bradley-Terry model. ...
Estimates of rankings within this model are commonly made using a simple iterative algorithm first introduced by Zermelo almost a century ago. ...
All empirical data used in this paper are freely available online or from their original authors. ...
arXiv:2207.00076v2
fatcat:7h2emmbldndknbkuxmkf5osqpm
Ranking All DEA-Efficient DMUs Based on Cross Efficiency and Analytic Hierarchy Process Methods
2015
Journal of Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the second stage, the pairwise comparison matrix generated in the first stage is utilized to rank scale of the units via the one-step process of AHP. ...
The aim of this paper is to present an original approach for ranking of DEA-efficient DMUs based on the cross efficiency and analytic hierarchy process (AHP) methods. ...
After determining the pairwise comparison matrix A, AHP technique is applied for ranking CCR-efficient DMUs. ...
doi:10.1155/2015/594727
fatcat:pf2alpw62bhcbfogakhzr3hxga
A Hybrid Fuzzy DEA/AHP Methodology for Ranking Units in a Fuzzy Environment
2017
Symmetry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The hybrid fuzzy DEA/AHP approach derives the AHP pairwise comparisons by fuzzy DEA and utilizes AHP to fully rank units. ...
The AHP pairwise comparisons are generated by running pairwise DEA. Thus, there is no subjective evaluation [4] . This method was a new idea in ranking but has lots of problems. ...
The AHP pairwise comparisons are derived mathematically from the results of the average of efficiencies by running fuzzy DEA models, and DMUs are fully ranked by AHP. ...
doi:10.3390/sym9110273
fatcat:35wqagusuncofo3vjhmrkxjede
Inferring Users' Preferences from Crowdsourced Pairwise Comparisons: A Matrix Completion Approach
2013
AAAI Conference on Human Computation & Crowdsourcing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In order to learn a user's preferences from his/her response to only a small number of pairwise comparisons, we propose to leverage the pairwise comparisons made by many crowd users, a problem we refer ...
Our theoretical analysis shows that, on average, only O(r log m) pairwise queries are needed to accurately recover the ranking list of m items for the target user, where r is the rank of the unknown rating ...
pairwise comparison data from 200 workers. ...
dblp:conf/hcomp/YiJJJ13
fatcat:cywo2xnnrncw5erekqs6ekswd4
Aligning with Human Judgement: The Role of Pairwise Preference in Large Language Model Evaluators
[article]
2024
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2024; you can also visit the original URL.
The file type is application/pdf.
Other Versions
to conduct pairwise comparisons and efficiently ranks candidate texts. ...
Furthermore, we provide insights into the role of pairwise preference in quantifying the transitivity of LLMs and demonstrate how PairS benefits from calibration. ...
We formulate the evaluation as a ranking problem from the perspective of transitivity and propose PAIRS, an efficient, scalable, and uncertainty-guided ranking method that navigates the pairwise comparison ...
arXiv:2403.16950v2
fatcat:xenhfpusgjd6rmsyzbptd3ip4m
Environmental efficiency evaluation of the Xiangjiang River basin: A DEA cross-efficiency approach with social network
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Secondly, based on pairwise comparison, we build a non-weighted directed social network where a direction generates from one DMU to another DMU if the former one references the latter one. ...
Firstly, we propose a pairwise comparison model based on cross-efficiency evaluation to identify the superiority and inferiority between any pair of DMUs. ...
CROSS-EFFICIENCY EVALUATION MODEL USING PAIRWISE COMPARISON Although the original cross-efficiency model can rank efficient DMUs, it suffers from non-unique cross-efficiency scores, which reduces the stability ...
doi:10.1109/access.2021.3086030
fatcat:fnuavjh2g5gibbnrcvoqkfzvjm
Fast and Accurate Inference of Plackett-Luce Models
2015
Neural Information Processing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show that the maximum-likelihood (ML) estimate of models derived from Luce's choice axiom (e.g., the Plackett-Luce model) can be expressed as the stationary distribution of a Markov chain. ...
We observe that breaking the rankings into pairwise comparisons (*-F estimators) incurs a significant efficiency loss over using the k-way rankings directly (LSR and ML.) ...
As k grows, breaking rankings into pairwise comparisons becomes increasingly inefficient. LSR remains efficient at no additional computational cost. ...
dblp:conf/nips/MaystreG15
fatcat:q2hfjlx5kvgztgbyy7o7vqho6a
Nontransitive Ranking to Enhance Routing Decision in MANETS
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The pairwise comparisons of each route with others give more accurate and fair comparison. ...
The proposed Nontransitive Route Ranking subjective comparison of one route with others and performs nontransitive ranking to rank routes from best to worst. ...
ranking [11] to rank routes from best to worst. ...
arXiv:1407.5385v1
fatcat:yfztaqswrza2hjlvfidqqwifry
Learning shared rankings from mixtures of noisy pairwise comparisons
2015
2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a novel model for rank aggregation from pairwise comparisons which accounts for a heterogeneous population of inconsistent users whose preferences are different mixtures of multiple shared ranking ...
and computational efficiency guarantees. ...
The problem of estimating rankings from pairwise comparisons data has been extensively studied. ...
doi:10.1109/icassp.2015.7179012
dblp:conf/icassp/DingIS15
fatcat:a43jsyqfx5hqnkv3b24khkfzzi
Prediction-Powered Ranking of Large Language Models
[article]
2024
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2024; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2024 pre-print arXiv:2402.17826v1 fatcat:dzh2bkdcojhnbcarkn66hg4gge
Given a (small) set of pairwise comparisons by humans and a large set of pairwise comparisons by a model, our framework provides a rank-set -- a set of possible ranking positions -- for each of the models ...
and show that the rank-sets constructed using only pairwise comparisons by the strong large language models are often inconsistent with (the distribution of) human pairwise preferences. ...
To lower the cost and increase the efficiency of ranking from pairwise comparisons, it has become a common practice to ask a strong LLM-a model known to strongly align with human preferences-to perform ...
arXiv:2402.17826v2
fatcat:ymtcpc3scnhavcg6usi5m74ybu
An MCDM Approach for Cloud Computing Service Selection Based on Best-Only Method
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The proposed method is compared with two popular MCDM methods, analytical hierarchical process (AHP) and best-worst method (BWM), from three perspectives: efficiency, consistency ratio (CR), and total ...
Based on the obtained results, AHP and BWM require 75.3% and 46.2% more comparisons, respectively, than the proposed method. ...
EVALUATION AND DISCUSSION In this section, we evaluate the appropriateness of our proposed approach from three perspectives: efficiency (number of pairwise comparisons), consistency ratio (CR), and total ...
doi:10.1109/access.2021.3129716
fatcat:p4ra4jdx3fdrrmmtsmurmtw24y
A new DEA ranking system based on interval Cross Efficiency and interval Analytic Hierarchy Process methods
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2014 pre-print arXiv:1409.7547v1 fatcat:mm7uf6i3nzcm5ir76pmmqqclvq
In the second stage, the interval pairwise comparison matrix generated in the first stage is utilized to rank the units (DMUs) via the one step process of interval AHP (i.e. the AHP model with interval ...
The aim of this paper is to present a novel approach for ranking of all DMUs using the interval Cross-Efficiency (ICE) and interval Analytic Hierarchy Process (IAHP) methods. ...
In the second stage, the interval pairwise comparison matrix generated in the first stage is utilized to rank the DMUs via the IAHP. ...
arXiv:1409.7547v2
fatcat:wqnvnpbrtnhavmhe4s6j6acbji
SerialRank: Spectral Ranking using Seriation
2014
Neural Information Processing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
It does so by constructing a similarity matrix from pairwise comparisons, using seriation methods to reorder this matrix and construct a ranking. ...
We describe a seriation algorithm for ranking a set of n items given pairwise comparisons between these items. ...
Acknowledgments FF, AA and MV would like to acknowledge support from a European Research Council starting grant (project SIPA) and support from the MSR-INRIA joint centre. ...
dblp:conf/nips/FogeldV14
fatcat:7pap7644e5aibce6jcepy5y7iq
A new approach for weight derivation using data envelopment analysis in the analytic hierarchy process
2011
Journal of the Operational Research Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Recently, some researches have been carried out in the context of using data envelopment analysis (DEA) models to generate local weights of alternatives from pairwise comparison matrices used in the analytic ...
Through a numerical example, it will be shown that the Revised DEAHP not only produces correct weights for inconsistent matrices but also does not suffer from rank reversal when an irrelevant alternative ...
Criteria To examine the rank reversal problem, the pairwise comparison matrix A is used for this end. As it can be seen from Table 4 , the current ranking is as below. ...
doi:10.1057/jors.2010.105
fatcat:zxcjt2tuivd27a7ewpkyg3ledi
« Previous
Showing results 1 — 15 out of 122,754 results