Pairwise comparison

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

An analytic hierarchy process based simulation model for entry mode decision regarding foreign direct investment

Abstract: A methodology is developed for ranking entry mode alternatives encountered by individual firms considering foreign direct investment (FDI). The methodology deals with the risks and uncertainties related to FDI. The analytic hierarchy process (AHP) is used to solve the multiple criteria decision-making problem using input from a firm's management. A simulation approach is incorporated into the AHP to handle the uncertainty considerations encountered in an FDI environment. The uncertainties include: (1) uncertainty regarding the future characteristics of the FDI decision making environment, (2) uncertainty associated with the decision maker's judgment regarding pairwise comparisons necessitated by the AHP.

Gradient boosting factorization machines

Abstract: Recommendation techniques have been well developed in the past decades. Most of them build models only based on user item rating matrix. However, in real world, there is plenty of auxiliary information available in recommendation systems. We can utilize these information as additional features to improve recommendation performance. We refer to recommendation with auxiliary information as context-aware recommendation. Context-aware Factorization Machines (FM) is one of the most successful context-aware recommendation models. FM models pairwise interactions between all features, in such way, a certain feature latent vector is shared to compute the factorized parameters it involved. In practice, there are tens of context features and not all the pairwise feature interactions are useful. Thus, one important challenge for context-aware recommendation is how to effectively select "good" interaction features. In this paper, we focus on solving this problem and propose a greedy interaction feature selection algorithm based on gradient boosting. Then we propose a novel Gradient Boosting Factorization Machine (GBFM) model to incorporate feature selection algorithm with Factorization Machines into a unified framework. The experimental results on both synthetic and real datasets demonstrate the efficiency and effectiveness of our algorithm compared to other state-of-the-art methods.

On the extraction of weights from pairwise comparison matrices

Abstract: We study properties of weight extraction methods for pairwise comparison matrices that minimize suitable measures of inconsistency, ‘average error gravity’ measures, including one that leads to the geometric row means. The measures share essential global properties with the AHP inconsistency measure. By embedding the geometric mean in a larger class of methods we shed light on the choice between it and its traditional AHP competitor, the principal right eigenvector. We also suggest how to assess the extent of inconsistency by developing an alternative to the Random Consistency Index, which is not based on random comparison matrices, but based on judgemental error distributions. We define and discuss natural invariance requirements and show that the minimizers of average error gravity generally satisfy them, except a requirement regarding the order in which matrices and weights are synthesized. Only the geometric row mean satisfies this requirement also. For weight extraction we recommend the geometric mean.

Optimal arrangement of components via pairwise rearrangements

Abstract: : The authors introduce the notion of comparison of the criticality of two nodes in a coherent system, and develop a monotonicity property of the reliability function under component pairwise rearrangement. They use this property to find the optimal component arrangement. Worked examples illustrate the methods proposed. Keywords: Optimization; Permutations; Nodes.