Skip to main content

An Algorithm for Generating Consistent and Transitive Approximations of Reciprocal Preference Relations

  • Conference paper
Computational Intelligence for Knowledge-Based Systems Design (IPMU 2010)

Abstract

We establish an iterative algorithm to generate for any given reciprocal relation and any given type of transitivity fitting into the framework of cycle-transitivity, a unique reciprocal relation that approximates the given reciprocal relation and possesses the given transitivity property. In the context of decision making, the algorithm can be used to generate a consistent approximation of a non-consistent reciprocal preference relation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alonso, S., Chiclana, F., Herrera, F., Herrera-Viedma, E.: A Consistency-Based Procedure to Estimate Missing Pairwise Preference Values. International Journal of Intelligent Systems 23, 155–175 (2008)

    Article  MATH  Google Scholar 

  2. Chiclana, F., Herrera-Viedma, E., Alonso, S., Herrera, F.: A Note on the Estimation of Missing Pairwise Preference Values: A Uninorm Consistency Based Method. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 16, 19–32 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chiclana, F., Herrera-Viedma, E., Alonso, S., Herrera, F.: Cardinal Consistency of Reciprocal Preference Relations: A Characterization of Muliplicative Transitivity. IEEE Transactions on Fuzzy Systems 17, 14–23 (2009)

    Article  Google Scholar 

  4. Dawyndt, P., De Meyer, H., De Baets, B.: The Complete Linkage Clustering Algorithm Revisited. Soft Computing 9, 385–392 (2005)

    Article  Google Scholar 

  5. Dawyndt, P., De Meyer, H., De Baets, B.: UPGMA Clustering Revisited: A Weight-Driven Approach to Transitive Approximation. International Journal of Approximate Reasoning 42, 174–191 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. De Baets, B., De Meyer, H.: Transitive Approximation of Fuzzy Relations by Alternating Closures and Openings. Soft Computing 7, 210–219 (2003)

    MATH  Google Scholar 

  7. De Baets, B., De Meyer, H.: Transitivity Frameworks for Reciprocal Relations: Cycle-Transitivity versus FG-Transitivity. Fuzzy Sets and Systems 152, 249–270 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. De Baets, B., De Meyer, H., De Loof, K.: On the Cycle-transitivity of the Mutual Rank Probability Relation of a Poset. Fuzzy Sets and Systems (2010) (under revision)

    Google Scholar 

  9. De Baets, B., De Meyer, H., De Schuymer, B., Jenei, S.: Cyclic Evaluation of Transitivity of Reciprocal Relations. Social Choice and Welfare 26, 217–238 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. De Meyer, H., Naessens, H., De Baets, B.: Algorithms for Computing the Min-Transitive Closure and Associated Partition Tree of a Symmetric Fuzzy Relation. European Journal of Operational Research 155, 226–238 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Diaz, S., Montes, S., De Baets, B.: Transitivity Bounds in Additive Fuzzy Preference Structures. IEEE Transactions on Fuzzy Systems 15, 275–286 (2007)

    Article  Google Scholar 

  12. Fedrizzi, M., Brunelli, M.: On the Normalisation of a Priority Vector Associated with a Reciprocal Relation. International Journal of General Systems 38, 579–586 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Fedrizzi, M., Giove, S.: Incomplete Pairwise Comparison and Consistency Optimization. European Journal of Operational Research 183, 303–313 (2007)

    Article  MATH  Google Scholar 

  14. Gass, S.I.: Transitivity and Pairwise Comparison Matrices. The Journal of the Operational Research Society 49, 616–624 (1998)

    MATH  Google Scholar 

  15. Gogus, O., Boucher, T.O.: Strong Transitivity, Rationality and Weak Monotonicity in Fuzzy Pairwise Comparisons. Fuzzy Sets and Systems 94, 133–144 (1998)

    Article  MathSciNet  Google Scholar 

  16. Herrera-Viedma, E., Herrera, F., Chiclana, F., Luque, M.: Some Issues on Consistency of Fuzzy Preference Relations. European Journal of Operational Research 154, 98–109 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Ma, J., Fan, Z.-P., Jiang, Y.-P., Mao, J.-Y., Ma, L.: A Method for Repairing the Inconsistency of Fuzzy Preference Relations. Fuzzy Sets and Systems 157, 20–30 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Mordecai, A.: Nonlinear Programming: Analysis and Methods. Dover Publishing, New York (2003)

    MATH  Google Scholar 

  19. Naessens, H., De Meyer, H., De Baets, B.: Algorithms for the Computation of T-transitive Closures. IEEE Transactions on Fuzzy Systems 10, 541–551 (2002)

    Article  Google Scholar 

  20. Switalski, Z.: General Transitivity Conditions for Fuzzy Reciprocal Preference Matrices. Fuzzy Sets and Systems 137, 85–100 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  21. Xu, Z.S.: A Survey of Fuzzy Preference Relations. International Journal of General Systems 36, 179–203 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Xu, Z., Da, Q.: An Approach to Improving Consistency of Fuzzy Preference Matrix. Fuzzy Optimization and Decision Making 2, 3–13 (2003)

    Article  MathSciNet  Google Scholar 

  23. 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)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freson, S., De Meyer, H., De Baets, B. (2010). An Algorithm for Generating Consistent and Transitive Approximations of Reciprocal Preference Relations. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds) Computational Intelligence for Knowledge-Based Systems Design. IPMU 2010. Lecture Notes in Computer Science(), vol 6178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14049-5_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14049-5_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14048-8

  • Online ISBN: 978-3-642-14049-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics