5,821 research outputs found

    On Axiomatization of Inconsistency Indicators for Pairwise Comparisons

    Full text link
    We examine the notion of inconsistency in pairwise comparisons and propose an axiomatization which is independent of any method of approximation or the inconsistency indicator definition (e.g., Analytic Hierarchy Process, AHP). It has been proven that the eigenvalue-based inconsistency (proposed as a part of AHP) is incorrect.Comment: Enhanced text, with 21 pages and 3 figures, proves that arbitrarily inaccurate pairwise matrices are considered acceptable by theories with a inconsistency based on the principal eigenvalue (e.g., AHP). CPC (corner pairwise comparisons) matrix is the crucial part of this study as it invalidates any eigenvalue-based inconsistency. All comments are highly appreciate

    Notes on the existence of solutions in the pairwise comparisons method using the Heuristic Rating Estimation approach

    Full text link
    Pairwise comparisons are a well-known method for modelling of the subjective preferences of a decision maker. A popular implementation of the method is based on solving an eigenvalue problem for M - the matrix of pairwise comparisons. This does not take into account the actual values of preference. The Heuristic Rating Estimation (HRE) approach is a modification of this method in which allows modelling of the reference values. To determine the relative order of preferences is to solve a certain linear equation system defined by the matrix A and the constant term vector b (both derived from M). The article explores the properties of these equation systems. In particular, it is proven that for some small data inconsistency the A matrix is an M-matrix, hence the equation proposed by the HRE approach has a unique strictly positive solution.Comment: 8 page

    A gradient method for inconsistency reduction of pairwise comparisons matrices

    Full text link
    We investigate an application of a mathematically robust minimization method -- the gradient method -- to the consistencization problem of a pairwise comparisons (PC) matrix. Our approach sheds new light on the notion of a priority vector and leads naturally to the definition of instant priority vectors. We describe a sample family of inconsistency indicators based on various ways of taking an average value, which extends the inconsistency indicator based on the "sup\sup"- norm. We apply this family of inconsistency indicators both for additive and multiplicative PC matrices to show that the choice of various inconsistency indicators lead to non-equivalent consistencization procedures.Comment: 1 figure, several corrections and precision

    JigsawNet: Shredded Image Reassembly using Convolutional Neural Network and Loop-based Composition

    Full text link
    This paper proposes a novel algorithm to reassemble an arbitrarily shredded image to its original status. Existing reassembly pipelines commonly consist of a local matching stage and a global compositions stage. In the local stage, a key challenge in fragment reassembly is to reliably compute and identify correct pairwise matching, for which most existing algorithms use handcrafted features, and hence, cannot reliably handle complicated puzzles. We build a deep convolutional neural network to detect the compatibility of a pairwise stitching, and use it to prune computed pairwise matches. To improve the network efficiency and accuracy, we transfer the calculation of CNN to the stitching region and apply a boost training strategy. In the global composition stage, we modify the commonly adopted greedy edge selection strategies to two new loop closure based searching algorithms. Extensive experiments show that our algorithm significantly outperforms existing methods on solving various puzzles, especially those challenging ones with many fragment pieces
    corecore