Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation-Reference-Cited by-同舟云学术

Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation

Published:2004-05 Issue:1 Volume:155 Page:226-238
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

De Meyer H.,Naessens H.,De Baets B.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference13 articles.

1. Special properties, closures and interiors of crisp and fuzzy relations;Bandler;Fuzzy. Set. Syst.,1988

2. B. DeBaets, H. De Meyer, On the existence and construction of T-transitive closures, Inform. Sci., in press

3. A graph-theoretical analysis of pattern classification via Tamura’s fuzzy relation;Dunn;IEEE Trans. SMC,1974

4. Abstract derivation of transitive closure algorithms;Feijs;Inform. Proc. Lett.,1997

5. An algorithm for computing the transitive closure of a fuzzy similarity matrix;Guoyao;Fuzzy. Set. Syst.,1992

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Transitive full covers of incomplete preference relations;Information Fusion;2022-04

2. An Effective Entity Resolution Approach for Big Data;International Journal of Innovative Technology and Exploring Engineering;2021-09-30

3. Consortium blockchain-driven decentralized organization and operation for manufacturing community in social manufacturing;2020 IEEE 16th International Conference on Automation Science and Engineering (CASE);2020-08

4. The stability of local properties of fuzzy relations under ordinal equivalence;Information Sciences;2019-07

5. Fuzzy Similarity-Based Hierarchical Clustering for Atmospheric Pollutants Prediction;Fuzzy Logic and Applications;2019