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

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

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

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Estructures a l'Arquitectura
dc.contributor	Universitat Politècnica de Catalunya. FIA - Modelització Matemàtica Funcional i Aplicacions
dc.contributor.author	Garmendia Salvador, Luis
dc.contributor.author	González del Campo, Ramón
dc.contributor.author	López, Victoria
dc.contributor.author	Recasens Ferrés, Jorge
dc.date	2009-11
dc.identifier.citation	Garmendia, L. [et al.]. An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity. "Mathware and soft computing", Novembre 2009, vol. 16, núm. 2, p. 175-191.
dc.identifier.citation	1134-5632
dc.identifier.uri	http://hdl.handle.net/2117/6640
dc.language.iso	eng
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
dc.subject	Artificial intelligence
dc.subject	Intel·ligència artificial
dc.title	An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	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.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author