Computing a T-transitive lower approximation or opening of a proximity relation
From MaRDI portal
Recommendations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Transitive openings
- Algorithms for computing the optimal transitive approximation of a proximity relation
Cites work
- scientific article; zbMATH DE number 4013781 (Why is no real title available?)
- scientific article; zbMATH DE number 431923 (Why is no real title available?)
- scientific article; zbMATH DE number 3865278 (Why is no real title available?)
- scientific article; zbMATH DE number 3870293 (Why is no real title available?)
- scientific article; zbMATH DE number 3898865 (Why is no real title available?)
- scientific article; zbMATH DE number 1183717 (Why is no real title available?)
- scientific article; zbMATH DE number 1735973 (Why is no real title available?)
- scientific article; zbMATH DE number 1508188 (Why is no real title available?)
- scientific article; zbMATH DE number 4116534 (Why is no real title available?)
- A method to make some fuzzy relationsT-transitive
- An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- Fuzzy \(T\)-transitive relations: Eigenvectors and generators
- Fuzzy rationality measures
- Fuzzy sets
- Fuzzy sets and systems. Theory and applications
- ON THE RELATION BETWEEN FUZZY PREORDERS AND FUZZY CONSEQUENCE OPERATORS
- On implicative closure operators in approximate reasoning.
- On similarity relations in fuzzy relational databases
- On some logical connectives for fuzzy sets theory
- On the existence and construction of T-transitive closures.
- On the relationship between T-transitivity and approximate equality
- On the structure of F-indistinguishability operators
- On transitive solutions of fuzzy equations, inequalities and lower approximations of fuzzy relations
- One-dimensional indistinguishability operators
- Similarity relations - the calculation of minimal generating families
- Similarity relations and fuzzy orderings
- Some problems on the definition of fuzzy preference relations
- Special properties, closures and interiors of crisp and fuzzy relations
- Structure of transitive valued binary relations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Transitive approximation of fuzzy relations by alternating closures and openings
- Transitivity of generalized fuzzy matrices
- UPGMA clustering revisited: a weight-driven approach to transitive approximation
Cited in
(5)- Approximation of proximities by aggregating \(T\)-indistinguishability operators
- Algorithms for computing the optimal transitive approximation of a proximity relation
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- A method for obtaining transitive approximations of a binary relation
- Calculating exact transitive closure for a normalized affine integer tuple relation
This page was built for publication: Computing a T-transitive lower approximation or opening of a proximity relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038009)
