An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix

From MaRDI portal
Publication:5951773

DOI10.1016/S0165-0114(00)00062-2zbMath1003.65043OpenAlexW2019508321MaRDI QIDQ5951773

Hsuan-Shih Lee

Publication date: 8 January 2003

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-0114(00)00062-2

zbMATH Keywords

computational complexitytransitive closurematrix algorithmfuzzy similarityfuzzy equivalencetransitive relation


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of fuzzy sets, etc. (03E72) Pattern recognition, speech recognition (68T10) Complexity and performance of numerical algorithms (65Y20)


Related Items

Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets, Algorithms for computing the optimal transitive approximation of a proximity relation, Reduction method based on a new fuzzy rough set in fuzzy information system and its applications to scheduling problems, On fuzzy preference relation in group decision making, Formal concept analysis based on fuzzy granularity base for different granulations, Equivalent bipolar fuzzy relations, The structural clustering and analysis of metric based on granular space, Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation, Computing a T-transitive lower approximation or opening of a proximity relation, An application of fuzzy hypergraphs and hypergraphs in granular computing, Computationally efficient sup-t transitive closure for sparse fuzzy binary relations



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5951773&oldid=12113953"
Powered by MediaWiki