Clustering Based on Fuzzy Tolerance Quotient Spaces ?
نویسندگان
چکیده
The quotient space theory based on fuzzy tolerance relation is put forward to solve the problem of clustering in this paper. The similarity matrix does not always satisfy ultrametric inequality, theoretically and practically. We give the method to construct the hierarchical quotient space chain if the similarity matrix is only reflexive and symmetric. We consider not only the subset of data (cluster) but also the structure of the different granular clusters. The main contributions in this paper include four parts. (1) We introduce sufficient and necessary condition that normalized distance d(x, y) is an equicrural distance; (2) The relation between equicrural distance and ultrametric inequality is discussed; (3) We propose a method to get the proximate partition of a covering from a tolerance relation; (4) An example for using fuzzy tolerance quotient spaces to clustering is given.
منابع مشابه
A Note on the Fuzzy Linear Maps over the Fuzzy Quotient Spaces
In this paper we study various properties of the fuzzy linear maps over the fuzzy quotient spaces. In particular we obtain some exact sequences of the fuzzy linear maps over the fuzzy quotient spaces.
متن کاملBEST SIMULTANEOUS APPROXIMATION IN FUZZY NORMED SPACES
The main purpose of this paper is to consider the t-best simultaneousapproximation in fuzzy normed spaces. We develop the theory of t-bestsimultaneous approximation in quotient spaces. Then, we discuss the relationshipin t-proximinality and t-Chebyshevity of a given space and its quotientspace.
متن کاملSOME RESULTS ON INTUITIONISTIC FUZZY SPACES
In this paper we define intuitionistic fuzzy metric and normedspaces. We first consider finite dimensional intuitionistic fuzzy normed spacesand prove several theorems about completeness, compactness and weak convergencein these spaces. In section 3 we define the intuitionistic fuzzy quotientnorm and study completeness and review some fundamental theorems. Finally,we consider some properties of...
متن کاملFuzzy c-Lines for Data with Tolerance
This paper presents a new clustering algorithm ,which is based on fuzzy c-lines, can treat data with some errors. First, the tolerance is formulated and introduce into optimization problem of clustering. Next, the problem is solved using Karush-Kuhn-Tucker conditions. Last, the algorithm is constructed based on the results of solving the problem. Some numerical examples for the proposed method ...
متن کاملOn Tolerant Fuzzy c-Means Clustering with L1-Regularization
We have proposed tolerant fuzzy c-means clustering (TFCM) from the viewpoint of handling data more flexibly. This paper presents a new type of tolerant fuzzy c-means clustering with L1-regularization. L1-regularization is wellknown as the most successful techniques to induce sparseness. The proposed algorithm is different from the viewpoint of the sparseness for tolerance vector. In the origina...
متن کامل