Abstract
This paper presents two new clustering algorithms which are based on the entropy regularized fuzzy c-means and can treat data with some errors. First, the tolerance which means the permissible range of the error is introduced into optimization problems which relate with clustering, and the tolerance is formulated. Next, the problems are solved using Kuhn-Tucker conditions. Last, the algorithms are constructed based on the results of solving the problems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)
Liu, Z.Q., Miyamoto, S. (eds.): Soft computing and human-centered machines, pp. 85–129. Springer, Tokyo (2000)
Endo, Y., Horiuchi, K.: On clustering algorithm for fuzzy data. In: Proc. 1997 International Symposium on Nonlinear Theory and Its Applications, pp. 381–384 (1997)
Endo, Y.: Clustering algorithm using covariance for fuzzy data. In: Proc. 1998 International Symposium on Nonlinear Theory and Its Applications, pp. 511–514 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murata, R., Endo, Y., Haruyama, H., Miyamoto, S. (2006). On Fuzzy c-Means for Data with Tolerance. In: Torra, V., Narukawa, Y., Valls, A., Domingo-Ferrer, J. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2006. Lecture Notes in Computer Science(), vol 3885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11681960_34
Download citation
DOI: https://doi.org/10.1007/11681960_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32780-6
Online ISBN: 978-3-540-32781-3
eBook Packages: Computer ScienceComputer Science (R0)