For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Fuzzy c-Means Algorithms for Data with Tolerance Using Kernel Functions
Yuchi KANZAWA Yasunori ENDO Sadaaki MIYAMOTO
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/09/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Nonlinear Theory and its Applications)
Category: Soft Computing
fuzzy c-means, clustering, tolerance, kernel functions,
Full Text: PDF>>
In this paper, two new clustering algorithms based on fuzzy c-means for data with tolerance using kernel functions are proposed. Kernel functions which map the data from the original space into higher dimensional feature space are introduced into the proposed algorithms. Nonlinear boundary of clusters can be easily found by using the kernel functions. First, two clustering algorithms for data with tolerance are introduced. One is based on standard method and the other is on entropy-based one. Second, the tolerance in feature space is discussed taking account into soft margin algorithm in Support Vector Machine. Third, two objective functions in feature space are shown corresponding to two methods, respectively. Fourth, Karush-Kuhn-Tucker conditions of two objective functions are considered, respectively, and these conditions are re-expressed with kernel functions as the representation of an inner product for mapping from the original pattern space into a higher dimensional feature space. Fifth, two iterative algorithms are proposed for the objective functions, respectively. Through some numerical experiments, the proposed algorithms are discussed.