An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a proximity

View/Open
Document typeConference report
Defense date2008
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
A method to get the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is presented. The method builds at the same time a binary partition tree for the output similarities.
CitationGarmendia Salvador, L.; González, R.; Recasens Ferrés, J. An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a proximity. A: International FLINS Conference. "Computational Intelligence in Decision and Control : proceedings of the 8th International FLINS Conference". 2008, p. 145-150. ISBN 9789812799463.
ISBN9789812799463
Publisher versionhttp://www.mat.ucm.es/congresos/flins2008/
Files | Description | Size | Format | View |
---|---|---|---|---|
FLINS2008.pdf | 40,96Kb | View/Open |