# How similarity matrices are?

Stochastica (1978)

- Volume: 2, Issue: 4, page 77-80
- ISSN: 0210-7821

## Access Full Article

top## Abstract

top## How to cite

topRiera, Teresa. "How similarity matrices are?." Stochastica 2.4 (1978): 77-80. <http://eudml.org/doc/39849>.

@article{Riera1978,

abstract = {In finite sets with n elements, every similarity relation (or fuzzy equivalence) can be represented by an n x n-matrix S = (sij), sij ∈ [0,1], such that sii = 1 (1 ≤ i ≤ n), sij = sji for any i,j and S o S = S, where o denotes the max-min product of matrices. These matrices represent also dendograms and sets of closed balls of a finite ultrametric space (vid. [1], [2], [3]).},

author = {Riera, Teresa},

journal = {Stochastica},

keywords = {Conjuntos difusos; Matrices de similitud; similarity relation; fuzzy equivalence; dendograms; sets of closed balls of a finite ultrametric space; similarity matrix},

language = {eng},

number = {4},

pages = {77-80},

title = {How similarity matrices are?},

url = {http://eudml.org/doc/39849},

volume = {2},

year = {1978},

}

TY - JOUR

AU - Riera, Teresa

TI - How similarity matrices are?

JO - Stochastica

PY - 1978

VL - 2

IS - 4

SP - 77

EP - 80

AB - In finite sets with n elements, every similarity relation (or fuzzy equivalence) can be represented by an n x n-matrix S = (sij), sij ∈ [0,1], such that sii = 1 (1 ≤ i ≤ n), sij = sji for any i,j and S o S = S, where o denotes the max-min product of matrices. These matrices represent also dendograms and sets of closed balls of a finite ultrametric space (vid. [1], [2], [3]).

LA - eng

KW - Conjuntos difusos; Matrices de similitud; similarity relation; fuzzy equivalence; dendograms; sets of closed balls of a finite ultrametric space; similarity matrix

UR - http://eudml.org/doc/39849

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.