Learning indistinguishability from data
This paper presents new points of view on the definition and the meaning of fuzzy sets. A fuzzy set is no longer a representation of vague concepts, but rather is induced by a crisp value and the membership can be thought of as a similarity degree between an element and the crisp value that determines the fuzzy set. Equality relations are defined that are later used to redefine fuzzy systems. Then the equality relations induced by data are treated, thereby obtaining a natural partitioning of the input space into rectangular areas or hyperboxes. To summarize, the paper presents an algorithm for the optimisation of a fuzzy system that learns a piecewise constant scaling function, corresponding to a fuzzy system with triangular memberships.
- Unsupervised Machine Learning on encrypted data
- Should fuzzy equality and similarity satisfy transitivity? Comments on the paper by M. De Cock and E. Kerre
- On the \(T\)-transitivity of kernels
- A similarity measure for fuzzy rulebases based on linguistic gradients
- Indistinguishability operators in measurement theory, Part I: Conversions of indistinguishability operators with respect to scales
- Indistinguishability operators in measurement theory, Part II: Construction of indistinguishability operators based on probability distributions
- scientific article; zbMATH DE number 2215832 (Why is no real title available?)
- The inherent indistinguishability in fuzzy systems
- Fuzzy equalization in the construction of fuzzy sets.
This page was built for publication: Learning indistinguishability from data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1596379)