An algorithm for computing the transitive closure of a fuzzy similarity matrix

DOI10.1016/0165-0114(92)90191-6zbMath0787.62062OpenAlexW2055375485MaRDI QIDQ1311751

Guoyao Fu

Publication date: 20 January 1994

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

Full work available at URL: https://doi.org/10.1016/0165-0114(92)90191-6

zbMATH Keywords

complexityfuzzy classificationnew algorithmfuzzy equivalence matrixtransitive closure of a fuzzy similarity matrix

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Theory of fuzzy sets, etc. (03E72) Probabilistic methods, stochastic differential equations (65C99)

Related Items (7)

Dual fuzzy similarity relation equations ⋮ Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. ⋮ A clustering method to identify representative financial ratios ⋮ An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix ⋮ Optimization methods for fuzzy clustering ⋮ Automatic clustering of business processes in business systems planning ⋮ Iterates of fuzzy circulant matrices

Cites Work

• On similarity relations in fuzzy relational databases
• A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation
• Some Recent Investigations of a New Fuzzy Partitioning Algorithm and its Application to Pattern Classification Problems
• Fuzzy Chains

This page was built for publication: An algorithm for computing the transitive closure of a fuzzy similarity matrix