To access the full text documents, please follow this link: http://hdl.handle.net/2117/6640

An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
Garmendia Salvador, Luis; González del Campo, Ramón; López, Victoria; Recasens Ferrés, Jorge
Universitat Politècnica de Catalunya. Departament d'Estructures a l'Arquitectura; Universitat Politècnica de Catalunya. FIA - Modelització Matemàtica Funcional i Aplicacions
A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computational cost of computing just one. The shape of the binary partition tree for the three output similarities are the same.
Peer Reviewed
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
Artificial intelligence
Intel·ligència artificial
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/publishedVersion
Article
         

Show full item record

Related documents

Other documents of the same author

Garmendia Salvador, Luis; González del Campo, Ramón; Recasens Ferrés, Jorge
González del Campo, Ramón; Garmendia Salvador, Luis; Recasens Ferrés, Jorge
González del Campo, Ramón; Garmendia Salvador, Luis; Recasens Ferrés, Jorge
González del Campo, Ramón; Garmendia Salvador, Luis; Recasens Ferrés, Jorge
Garmendia Salvador, Luis; Recasens Ferrés, Jorge
 

Coordination

 

Supporters