scispace - formally typeset
Search or ask a question
Topic

Pairwise comparison

About: Pairwise comparison is a research topic. Over the lifetime, 6804 publications have been published within this topic receiving 174081 citations.


Papers
More filters
Journal ArticleDOI
10 Sep 2018-Symmetry
TL;DR: The results show that FUCOM provides better results than the BWM and AHP methods, when the relation between consistency and the required number of the comparisons of the criteria are taken into consideration.
Abstract: In this paper, a new multi-criteria problem solving method—the Full Consistency Method (FUCOM)—is proposed. The model implies the definition of two groups of constraints that need to satisfy the optimal values of weight coefficients. The first group of constraints is the condition that the relations of the weight coefficients of criteria should be equal to the comparative priorities of the criteria. The second group of constraints is defined on the basis of the conditions of mathematical transitivity. After defining the constraints and solving the model, in addition to optimal weight values, a deviation from full consistency (DFC) is obtained. The degree of DFC is the deviation value of the obtained weight coefficients from the estimated comparative priorities of the criteria. In addition, DFC is also the reliability confirmation of the obtained weights of criteria. In order to illustrate the proposed model and evaluate its performance, FUCOM was tested on several numerical examples from the literature. The model validation was performed by comparing it with the other subjective models (the Best Worst Method (BWM) and Analytic Hierarchy Process (AHP)), based on the pairwise comparisons of the criteria and the validation of the results by using DFC. The results show that FUCOM provides better results than the BWM and AHP methods, when the relation between consistency and the required number of the comparisons of the criteria are taken into consideration. The main advantages of FUCOM in relation to the existing multi-criteria decision-making (MCDM) methods are as follows: (1) a significantly smaller number of pairwise comparisons (only n − 1), (2) a consistent pairwise comparison of criteria, and (3) the calculation of the reliable values of criteria weight coefficients, which contribute to rational judgment.

381 citations

Journal ArticleDOI
TL;DR: In this paper, the authors focus on the primary role of effect modifiers, which are study and patient characteristics associated with treatment effects, and provide a basic explanation when network meta-analysis is as valid as pairwise meta analysis.
Abstract: In the last decade, network meta-analysis of randomized controlled trials has been introduced as an extension of pairwise meta-analysis. The advantage of network meta-analysis over standard pairwise meta-analysis is that it facilitates indirect comparisons of multiple interventions that have not been studied in a head-to-head fashion. Although assumptions underlying pairwise meta-analyses are well understood, those concerning network meta-analyses are perceived to be more complex and prone to misinterpretation. In this paper, we aim to provide a basic explanation when network meta-analysis is as valid as pairwise meta-analysis. We focus on the primary role of effect modifiers, which are study and patient characteristics associated with treatment effects. Because network meta-analysis includes different trials comparing different interventions, the distribution of effect modifiers cannot only vary across studies for a particular comparison (as with standard pairwise meta-analysis, causing heterogeneity), but also between comparisons (causing inconsistency). If there is an imbalance in the distribution of effect modifiers between different types of direct comparisons, the related indirect comparisons will be biased. If it can be assumed that this is not the case, network meta-analysis is as valid as pairwise meta-analysis. The validity of network meta-analysis is based on the underlying assumption that there is no imbalance in the distribution of effect modifiers across the different types of direct treatment comparisons, regardless of the structure of the evidence network.

379 citations

Journal ArticleDOI
TL;DR: A line matching algorithm which utilizes both the local appearance of lines and their geometric attributes to solve the problem of segment fragmentation and geometric variation and is accurate even for low-texture images because of the pairwise geometric consistency evaluation.

375 citations

Journal ArticleDOI
TL;DR: Conceptual advances of the Grading of Recommendations Assessment, Development, and Evaluation (GRADE) working group guidance to evaluate the certainty of evidence from network meta-analysis (NMA) are described.

375 citations

Proceedings ArticleDOI
Yu Lei1, K.C. Tai
13 Nov 1998
TL;DR: It is shown that the problem of generating a minimum test set for pairwise testing is NP-complete and the implementation of an IPO-based test generation tool is described and some empirical results are shown.
Abstract: Pairwise testing (or 2-way testing) is a specification-based testing criterion, which requires that for each pair of input parameters of a system, every combination of valid values of these two parameters be covered by at least one test case. Empirical results show that pairwise testing is practical and effective for various types of software systems. We show that the problem of generating a minimum test set for pairwise testing is NP-complete. We propose a test generation strategy, called in-parameter-order (or IPO), for pairwise testing. For a system with two or more input parameters, the IPO strategy generates a pairwise test set for the first two parameters, extends the test set to generate a pairwise test set for the first three parameters, and continues to do so for each additional parameter. The IPO strategy allows the use of local optimization techniques for test generation and the reuse of existing tests when a system is extended with new parameters or new values of existing parameters. We present practical, IPO-based test generation algorithms. We describe the implementation of an IPO-based test generation tool and show some empirical results.

367 citations


Network Information
Related Topics (5)
Markov chain
51.9K papers, 1.3M citations
81% related
Cluster analysis
146.5K papers, 2.9M citations
76% related
Deep learning
79.8K papers, 2.1M citations
75% related
Optimization problem
96.4K papers, 2.1M citations
74% related
Robustness (computer science)
94.7K papers, 1.6M citations
74% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
20231,305
20222,607
2021581
2020554
2019520