Pairwise Comparisons Simplified
نویسندگان
چکیده
This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from n · (n − 1) to n − 1. An algorithm of reconstructing of the PC matrix from its set of generators is presented.
منابع مشابه
A simplified implementation of the least squares solution for pairwise comparisons matrices
This is a follow up to ”Solution of the least squares method problem of pairwise comparisons matrix” by Bozóki published by this journal in 2008. Familiarity with this paper is essential and assumed. For lower inconsistency and decreased accuracy, our proposed solutions run in seconds instead of days. As such, they may be useful for researchers willing to use the least squares method (LSM) inst...
متن کاملFinding Common Sequence and Structure Motifs in a Set of RNA Sequences
We present a computational scheme to search for the most common motif, composed of a combination of sequence and structure constraints, among a collection of RNA sequences. The method uses a simplified version of the Sankoff algorithm for simultaneous folding and alignment of RNA sequences, but maintains tractability by constructing multi-sequence alignments from pairwise comparisons. The overa...
متن کاملLearning to Top-K Search using Pairwise Comparisons
Given a collection of N items with some unknown underlying ranking, we examine how to use pairwise comparisons to determine the top ranked items in the set. Resolving the top items from pairwise comparisons has application in diverse fields ranging from recommender systems to image-based search to protein structure analysis. In this paper we introduce techniques to resolve the top ranked items ...
متن کاملA Geometric Framework for the Inconsistency in Pairwise Comparisons
In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group G, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided. Basic criteria for finding a nearest consistent pairwise comparisons matrix (extended to the class of group G) are proposed. A geometric interpretation of pairwis...
متن کاملActive Ranking using Pairwise Comparisons
This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of n objects can be identified by standard sorting methods using n log2 n pairwise comparisons. We are interested in natural situations in which relationships among the objects may allow for ranking using far fewer pairwise comparisons. Specifically, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 253 شماره
صفحات -
تاریخ انتشار 2015