Abstract
The pairwise comparison method is an interesting technique for assessing priority weights for a finite set of objects. In fact, some web search engines use this inference tool to quantify the importance of a set of web sites. In this paper we deal with the problem of incomplete paired comparisons. Specifically, we focus on the problem of retrieving preference information (as priority weights) from incomplete pairwise comparison matrices generated during a group decision-making process. The proposed methodology solves two problems simultaneously: the problem of deriving preference weights when not all data are available and the implicit consensus problem. We consider an approximation methodology within a flexible and general distance framework for this purpose.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Björck, A.: Solution of Equations in R n. Least Squares Methods. In: Ciarlet, P.G., Lions, J.L. (eds.) Handbook of Numerical Analysis, vol. 1, North-Holland, The Netherlands (1990)
Chu, M.T.: On The Optimal Consistent Approximation to Pairwise Comparison Matrices. Linear Algebra and its Applications 272, 155–168 (1998)
Carmone, F.J., Kara, A., Zanakis, S.H.: A Montecarlo Investigation of Incomplete Pairwise Comparison Matrices in AHP. Eur. J. Opl. Res. 102, 538–553 (1997)
Dopazo, E., González-Pachón, J.: Computational Distance-Based Approximation to a Pairwise Comparison Matrix. Kybernetika 39, 561–568 (2003)
Fan, Z., Ma, J.: An Approach to Multiple Attribute Decision Making Based on Incomplete Information on Alternatives. In: Sprague Jr., R.H. (ed.) Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. IEEE Comput. Soc, Los Alamitos (1999)
González-Pachón, J., Romero, C.: Inferring Consensus Weights from Pairwise Comparison Matrices without Suitable Properties (2004) (submitted)
Harker, P.T.: Incomplete Pairwise Comparisons in the Analytic Hierarchy Process. Mathl. Modelling 9, 837–848 (1987)
Koczkodaj, W., Orlowski, M.: Computing a Consistent Approximation to a Generalized Pairwise Comparisons Matrix. Computers and Mathematics with Applications 37, 79–85 (1999)
Langville, A.N., Meyer, C.D.: A Survey of Eigenvector Methods of Web Information Retrieval. The SIAM Review 47(1), 135–161 (2005)
Romero, C.: Handbook of Critical Issues in Goal Programming. Pergamon Press, Oxford (1991)
Saaty, T.L.: The Analytic Hierarchy Process. McGraw-Hill, New York (1980)
Triantaphyllou, E.: Multi-Criteria Decision Making Methods: A Comparative Study. Kluwer Academic Publishers, The Netherlands (2000)
Xu, Z.S.: Goal Programming Models for Obtaining the Priority Vector of Incomplete Fuzzy Preference Relation. International Journal of Approximate Reasoning 36, 261–270 (2004)
Yoon, M.S., Whang, K.S.: Pooling Partial Pairwise Comparisons in the AHP. Int. J. Mngt. Sci. 4, 35–57 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dopazo, E., González-Pachón, J., Robles, J. (2005). A Distance-Based Method for Preference Information Retrieval in Paired Comparisons. In: Famili, A.F., Kok, J.N., Peña, J.M., Siebes, A., Feelders, A. (eds) Advances in Intelligent Data Analysis VI. IDA 2005. Lecture Notes in Computer Science, vol 3646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552253_7
Download citation
DOI: https://doi.org/10.1007/11552253_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28795-7
Online ISBN: 978-3-540-31926-9
eBook Packages: Computer ScienceComputer Science (R0)