Now showing items 1-12 of 12

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

(2009-11)
Article
Open Access
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, ...
• #### An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a proximity ﻿

(2008)
Conference report
Open Access
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 ...
• #### Approximating proximities by similarities ﻿

(Univ. Malaga, 2008)
Conference report
Open Access
In this paper an algorithm to find a similarity close to a proximity or tolerance relation R is given. The obtained similarity is closer to R than its transitive closure or any transitive opening of R.
• #### Aproximación de Proximidades por Similitudes ﻿

(Center for Soft Computing, 2008)
Conference report
Open Access
En este trabajo se presenta un algoritmo para hallar una relaci´on de similitud próxima a una relación de proximidad (i.e.: una relación de tolerancia) R dada. La relación de similitud obtenida es más próxima a R que su ...
• #### Estructura de las similitudes ﻿

(Center for Soft Computing, 2008)
Conference report
Open Access
En este artículo se define formalmente el concepto de estructura de similaridad, se cuenta el número de estructuras de similaridades hasta dimensión 5, se propone una nomenclatura y un algoritmo que asigna una estructura ...
• #### Finding close T-indistinguishability operators to a given proximity ﻿

(-, 2007)
Conference report
Open Access
Two ways to approximate a proximity relation R (i.e. a reflexive and symmetric fuzzy relation) by a T-transitive one where T is a continuous archimedean t-norm are given. The first one aggregates the transitive closure R ...
• #### Hesitant fuzzy relations and their transitive closure ﻿

(2016)
Conference report
Open Access
Hesitant fuzzy relations and some of their operations are defined. A first definition of T-transitive property and its closure is defined.
• #### How to make T-transitive a proximity relation ﻿

(2009-02)
Article
Restricted access - publisher's policy
Three ways to approximate a proximity relation R (i.e., a reflexive and symmetric fuzzy relation) by a T -transitive one where T is a continuous Archimedean t-norm are given. The first one aggregates the transitive closure ...
• #### Órdenes parciales para hesitant fuzzy sets ﻿

(2016)
Conference report
Open Access
Se define un nuevo orden parcial H en el conjunto H de subconjuntos finitos del intervalo unidad. Con este preorden H no es un retículo, pero sí lo son algunos subconjuntos de H interesantes. H se puede inyectar de forma ...
• #### Partial orderings for hesitant fuzzy sets ﻿

(2017-05-01)
Article
Open Access
New partial orderings =o=o, =p=p and =H=H are defined, studied and compared on the set HH of finite subsets of the unit interval with special emphasis on the last one. Since comparing two sets of the same cardinality is a ...
• #### Transitive closure of interval-valued fuzzy relations ﻿

(2013-07)
Article
Open Access
In this paper are introduced some concepts of interval-valued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and local reflexivity. The existence and uniqueness of T-transitive ...
• #### Transitive Closure of Interval-valued Relations ﻿

(2009)
Conference report
Open Access
This paper introduces some concepts of intervalvalued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and locally reflexivity. It is also introduced the concept of T-transitive ...