Two Clustering Algorithms for Data with Tolerance based on Hard c-Means
Yukihiro Hamasuna, Yasunori Endo, Yasushi Hasegawa, Sadaaki Miyamoto · Proceedings of ... IEEE International Conference on Fuzzy Systems · 2007
Two clustering algorithms that handle data with tolerance are proposed. One is based on hard c-means while the other uses the learning vector quantization. The concept of the tolerance includes. First, the concept of tolerance which implies errors, ranges and the loss of attribute of data is described. Optimization problems that take the tolerance into account are formulated. Since the Kuhn-Tucker condition give a unique and explicit optimal solution, an alternate minimization algorithm and a learning algorithm are constructed. Moreover, the effectiveness of the proposed algorithms is verified through numerical examples.