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
01 Jun 2017
TL;DR: This paper develops some linear programming models with the aid of multidimensional analysis of preference (LINMAP) method to solve interval type-2 fuzzy MAGDM problems, in which the information about attribute weights is incompletely known, and all pairwise comparison judgments over alternatives are represented by IT2FSs.
Abstract: Supplier selection is a key issue in supply chain management, which directly impacts the manufacturer's performance. The problem can be viewed as a multiple attribute group decision making (MAGDM) that concerns many conflicting evaluation attributes, both being of qualitative and quantitative nature. Due to the increasing complexity and uncertainty of socio-economic environment, some evaluations of attributes are not adequately represented by numerical assessments and type-1 fuzzy sets. In this paper, we develop some linear programming models with the aid of multidimensional analysis of preference (LINMAP) method to solve interval type-2 fuzzy MAGDM problems, in which the information about attribute weights is incompletely known, and all pairwise comparison judgments over alternatives are represented by IT2FSs. First, we introduce a new distance measure based on the centroid interval between the IT2FSs. Then, we construct the linear programming model to determine the interval type-2 fuzzy positive ideal solution (IT2PIS) and corresponding attributes weight vector. Based on it, an extended LINMAP method to solve MAGDM problem under IT2FSs environment is developed. Finally, a supplier selection example is provided to demonstrate the usefulness of the proposed method.

68 citations

Journal ArticleDOI
TL;DR: An improvement was achieved in accuracy in the LSSM map that was developed using the IPCM method by minimizing the uncertainty associated with criteria ranking/weighting in a traditional AHP and could form a basis for future research into minimize the uncertainty in weightings derived using the AHP method.
Abstract: The analytical hierarchy process (AHP) is one of the most effective methods for criteria ranking/weighting to have been successfully incorporated into GIS analyses. We present a new method for optimizing pairwise comparison decision-making matrices in AHP method, which has been developed on the basis of an interval pairwise comparison matrix (IPCM) derived from expert knowledge. The method has been used for criteria ranking in land subsidence susceptibility mapping (LSSM) as a practical test case, for which an interval matrix was generated by pairwise comparison. To compare the capability of the AHP method (a traditional approach) with that of the proposed IPCM method (a novel approach), 11 creations of LSSM were ranked using each approach in turn. The criteria weightings obtained were then used to produce LSSM maps based on each of these approaches. The results were tested against a data set of known land subsidence occurrences, indicating an improvement in accuracy of about 14% in the LSSM map that was developed using the IPCM method. This improvement was achieved by minimizing the uncertainty associated with criteria ranking/weighting in a traditional AHP and could form a basis for future research into minimizing the uncertainty in weightings derived using the AHP method. Our results will be of considerable importance for researchers involved in GIS-based multi-criteria decision analysis (MCDA) and those dealing with GIS-based spatial decision-making methods.

68 citations

Proceedings ArticleDOI
27 Oct 2013
TL;DR: This paper proposes a novel Metric Fusion technique via cross-view graph Random Walk, named MFRW, regarding a multi-view based similarity graphs (with each similarity graph constructed under each view), and seeks a high-order metric yielded by graph random walks over constructed similarity graphs.
Abstract: Many real-world objects described by multiple attributes or features can be decomposed as multiple "views" (e.g., an image can be described by a color view or a shape view), which often provides complementary information to each other. Learning a metric (similarity measures) for multi-view data is primary due to its wide applications in practices. However, leveraging multi-view information to produce a good metric is a great challenge and existing techniques are concerned with pairwise similarities, leading to undesirable fusion metric and high computational complexity. In this paper, we propose a novel Metric Fusion technique via cross-view graph Random Walk, named MFRW, regarding a multi-view based similarity graphs (with each similarity graph constructed under each view). Instead of using pairwise similarities, we seek a high-order metric yielded by graph random walks over constructed similarity graphs. Observing that ``outlier views" may exist in the fusion process, we incorporate the coefficient matrices representing the correlation strength between any two views into MFRW, named WMFRW. The principle of \textsf{WMFRW} is implemented by exploring the ``common latent structure" between views. The empirical studies conducted on real-world databases demonstrate that our approach outperforms the state-of-the-art competitors in terms of effectiveness and efficiency.

68 citations

Journal ArticleDOI
TL;DR: The proposed planning process provides an analytical framework for multicriteria decisionmaking that is rational, consistent, explicit, and defensible for multiobjective decision making.
Abstract: Resource inventory and monitoring (I&M) programs in national parks combine multiple objectives in order to create a plan of action over a finite time horizon. Because all program activities are constrained by time and money, it is critical to plan I&M activities that make the best use of available agency resources. However, multiple objectives complicate a relatively straightforward allocation process. The analytic hierarchy process (AHP) offers a structure for multiobjective decision making so that decision-makers’ preferences can be formally incorporated in seeking potential solutions. Within the AHP, inventory and monitoring program objectives and decision criteria are organized into a hierarchy. Pairwise comparisons among decision elements at any level of the hierarchy provide a ratio scale ranking of those elements. The resulting priority values for all projects are used as each project’s contribution to the value of an overall I&M program. These priorities, along with budget and personnel constraints, are formulated as a zero/one integer programming problem that can be solved to select those projects that produce the best program. An extensive example illustrates how this approach is being applied to I&M projects in national parks in the Pacific Northwest region of the United States. The proposed planning process provides an analytical framework for multicriteria decisionmaking that is rational, consistent, explicit, and defensible.

68 citations

Proceedings Article
01 Jan 2002
TL;DR: An alternative embedding to multi-dimensional scaling (MDS) that allows us to apply a variety of classical machine learning and signal processing algorithms, and a class of pair-wise grouping algorithms which share the shift-in variance property is statistically invariant under this embedding procedure.
Abstract: Pairwise data in empirical sciences typically violate metricity, either due to noise or due to fallible estimates, and therefore are hard to analyze by conventional machine learning technology. In this paper we therefore study ways to work around this problem. First, we present an alternative embedding to multi-dimensional scaling (MDS) that allows us to apply a variety of classical machine learning and signal processing algorithms. The class of pair-wise grouping algorithms which share the shift-in variance property is statistically invariant under this embedding procedure, leading to identical assignments of objects to clusters. Based on this new vectorial representation, denoising methods are applied in a second step. Both steps provide a theoretically well controlled setup to translate from pairwise data to the respective denoised metric representation. We demonstrate the practical usefulness of our theoretical reasoning by discovering structure in protein sequence data bases, visibly improving performance upon existing automatic methods.

68 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