DocumentCode
603509
Title
On the Combinatorics of Tolerance Relations
Author
Simovici, D.A.
Author_Institution
Dept. of Comp. Sci., Univ. of Massachusetts Boston, Boston, MA, USA
fYear
2013
fDate
22-24 May 2013
Firstpage
225
Lastpage
230
Abstract
Tolerance relations are useful in soft computing in the treatment of non-disjoint clusterings, in the study of fuzzy automata, etc. After a comparative review of tolerance and equivalences of a set, we evaluate the number of tolerances situated between two equivalences, certain combinatorial aspects of the lattice of tolerances on a finite set and the use of bipartite graphs in the study of tolerances.
Keywords
equivalence classes; graph theory; lattice theory; set theory; bipartite graphs; combinatoric-tolerance relations; finite set tolerance lattice; set equivalence; Automata; Bipartite graph; Context; Extraterrestrial measurements; Indexes; Lattices; Gini index; equivalence; tolerance;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic (ISMVL), 2013 IEEE 43rd International Symposium on
Conference_Location
Toyama
ISSN
0195-623X
Print_ISBN
978-1-4673-6067-8
Electronic_ISBN
0195-623X
Type
conf
DOI
10.1109/ISMVL.2013.47
Filename
6524668
Link To Document