Geometric mean-based pairwise comparison method with the reference values -- statistical approach

• URL: http://arxiv.org/abs/2607.10038v1
• Date: Fri, 10 Jul 2026 23:41:38 GMT
• Title: Geometric mean-based pairwise comparison method with the reference values -- statistical approach
• Abstract summary: We present a statistical view of the pairwise comparison method, using reference values and the geometric mean.<n>Thanks to this approach, we can simultaneously capture both the phenomenon of inconsistency in pairwise comparisons and the preference distance between alternatives.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For many years, the pairwise comparison method has been widely used for decision-making involving experts. The best-known example of this method is the Analytic Hierarchy Process (AHP). In this now classic approach, the weights of alternatives are calculated using the principal eigenvector of the comparison matrix. In this paper, we present a statistical view of the pairwise comparison method, using reference values and the geometric mean to calculate alternative priorities. Thanks to this approach, we can simultaneously capture both the phenomenon of inconsistency in pairwise comparisons and the preference distance between alternatives. In this paper, we define indicators that measure the quality of the obtained weight vector, which, thanks to the statistical approach, have a clear and intuitive interpretation.

Related papers

• Sufficient conditions for a Heuristic Rating Estimation Method application [0.0]
  The research considers both arithmetic and geometric algorithms for complete and incomplete pairwise comparison methods.<n>The illustrative examples show that the estimations of inconsistency in the arithmetic variant are optimal.
  arXiv  Detail & Related papers  (2026-05-09T15:21:06Z)
• Principled Algorithms for Optimizing Generalized Metrics in Binary Classification [53.604375124674796]
  We introduce principled algorithms for optimizing generalized metrics, supported by $H$-consistency and finite-sample generalization bounds.<n>Our approach reformulates metric optimization as a generalized cost-sensitive learning problem.<n>We develop new algorithms, METRO, with strong theoretical performance guarantees.
  arXiv  Detail & Related papers  (2025-12-29T01:33:42Z)
• Rethinking Distance Metrics for Counterfactual Explainability [53.436414009687]
  We investigate a framing for counterfactual generation methods that considers counterfactuals not as independent draws from a region around the reference, but as jointly sampled with the reference from the underlying data distribution. We derive a distance metric, tailored for counterfactual similarity that can be applied to a broad range of settings.
  arXiv  Detail & Related papers  (2024-10-18T15:06:50Z)
• Canonical Variates in Wasserstein Metric Space [16.668946904062032]
  We employ the Wasserstein metric to measure distances between distributions, which are then used by distance-based classification algorithms. Central to our investigation is dimension reduction within the Wasserstein metric space to enhance classification accuracy. We introduce a novel approach grounded in the principle of maximizing Fisher's ratio, defined as the quotient of between-class variation to within-class variation.
  arXiv  Detail & Related papers  (2024-05-24T17:59:21Z)
• Weighted Point Set Embedding for Multimodal Contrastive Learning Toward Optimal Similarity Metric [44.95433989446052]
  We show the benefit of our proposed method through a new understanding of the contrastive loss of CLIP.<n>We show that our proposed similarity based on weighted point sets consistently achieves the optimal similarity.
  arXiv  Detail & Related papers  (2024-04-30T03:15:04Z)
• Statistical inference for pairwise comparison models [5.487882744996216]
  This paper establishes a near-optimal normality for the maximum likelihood in a broad class of pairwise comparison models. The key idea lies in identifying the Fisher information matrix as a weighted graph Laplacian, which can be studied via a meticulous spectral analysis.
  arXiv  Detail & Related papers  (2024-01-16T16:14:09Z)
• A Comparative Analysis of Distributed Linear Solvers under Data Heterogeneity [9.248526557884498]
  We consider the problem of solving a large-scale system of linear equations in a distributed or federated manner by a taskmaster and a set of machines.<n>We compare two well-known classes of algorithms used to solve this problem: projection-based methods and optimization-based methods.
  arXiv  Detail & Related papers  (2023-04-20T20:48:00Z)
• Counting Like Human: Anthropoid Crowd Counting on Modeling the Similarity of Objects [92.80955339180119]
  mainstream crowd counting methods regress density map and integrate it to obtain counting results. Inspired by this, we propose a rational and anthropoid crowd counting framework.
  arXiv  Detail & Related papers  (2022-12-02T07:00:53Z)
• Manifold Hypothesis in Data Analysis: Double Geometrically-Probabilistic Approach to Manifold Dimension Estimation [92.81218653234669]
  We present new approach to manifold hypothesis checking and underlying manifold dimension estimation. Our geometrical method is a modification for sparse data of a well-known box-counting algorithm for Minkowski dimension calculation. Experiments on real datasets show that the suggested approach based on two methods combination is powerful and effective.
  arXiv  Detail & Related papers  (2021-07-08T15:35:54Z)
• MINIMALIST: Mutual INformatIon Maximization for Amortized Likelihood Inference from Sampled Trajectories [61.3299263929289]
  Simulation-based inference enables learning the parameters of a model even when its likelihood cannot be computed in practice. One class of methods uses data simulated with different parameters to infer an amortized estimator for the likelihood-to-evidence ratio. We show that this approach can be formulated in terms of mutual information between model parameters and simulated data.
  arXiv  Detail & Related papers  (2021-06-03T12:59:16Z)
• A Statistical Analysis of Summarization Evaluation Metrics using Resampling Methods [60.04142561088524]
  We find that the confidence intervals are rather wide, demonstrating high uncertainty in how reliable automatic metrics truly are. Although many metrics fail to show statistical improvements over ROUGE, two recent works, QAEval and BERTScore, do in some evaluation settings.
  arXiv  Detail & Related papers  (2021-03-31T18:28:14Z)
• Near-Optimal Comparison Based Clustering [7.930242839366938]
  We show that our method can recover a planted clustering using a near-optimal number of comparisons. We empirically validate our theoretical findings and demonstrate the good behaviour of our method on real data.
  arXiv  Detail & Related papers  (2020-10-08T12:03:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.