Fuzzy c -Means for Data with Tolerance Defined as Hyper-Rectangle

The paper presents some new clustering algorithms which are based on fuzzy c-means. The algorithms can treat data with tolerance defined as hyper-rectangle. First, the tolerance is introduced into optimization problems of clustering. This is generalization of calculation errors or missing values. Next, the problems are solved and some algorithms are constructed based on the results. Finally, usefulness of the proposed algorithms are verified through numerical examples.

[1]  K. Jajuga L 1 -norm based fuzzy clustering , 1991 .

[2]  Sadaaki Miyamoto,et al.  L/sub 1/-Norm based Fuzzy Clustering for Data with Tolerance , 2006, 2006 IEEE International Conference on Fuzzy Systems.

[3]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[4]  Sadaaki Miyamoto,et al.  Fuzzy c-means as a regularization and maximum entropy approach , 1997 .

[5]  Sadaaki Miyamoto,et al.  On Fuzzy c-Means for Data with Tolerance , 2006, J. Adv. Comput. Intell. Intell. Informatics.

[6]  Sadaaki Miyamoto,et al.  Fuzzy Clustering of Data with Interval Uncertainties , 2000 .