A method for obtaining transitive approximations of a binary relation
From MaRDI portal
Recommendations
- Algorithms for computing the optimal transitive approximation of a proximity relation
- Computing a T-transitive lower approximation or opening of a proximity relation
- On pseudo-transitive approximations of fuzzy relations
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
- Transitive approximation of fuzzy relations by alternating closures and openings
Cites work
- scientific article; zbMATH DE number 47228 (Why is no real title available?)
- scientific article; zbMATH DE number 3361657 (Why is no real title available?)
- Goal programming and multiple objective optimizations. Part I
- Measurement Theory
- Mixture of maximal quasi orders: A new approach to preference modelling
- Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
- Preference modelling
- Similarity relations and fuzzy orderings
- Special properties, closures and interiors of crisp and fuzzy relations
- Structure of transitive valued binary relations
- Transitive approximation of fuzzy relations by alternating closures and openings
Cited in
(2)
This page was built for publication: A method for obtaining transitive approximations of a binary relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2271873)
