Fuzzy c-means clustering for data with tolerance using kernel functions

Yuchi Kanzawa, Yasunori Endo, Sadaaki Miyamoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, two new clustering algorithms based on fuzzy c-means for data with tolerance 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, two objective functions in feature space are shown corresponding to two methods, respectively. Third, Karush-Kuhn-Tucker conditions of two objective functions are considered, respectively, and these conditions are reexpressed with kernel functions as the representation of an inner product for mapping from original pattern space into higher dimensional feature space than the original one. Last, two iterative algorithms are proposed for the objective functions, respectively.

Original languageEnglish
Title of host publicationIEEE International Conference on Fuzzy Systems
Pages744-750
Number of pages7
DOIs
Publication statusPublished - 2006
Event2006 IEEE International Conference on Fuzzy Systems - Vancouver, BC
Duration: 2006 Jul 162006 Jul 21

Other

Other2006 IEEE International Conference on Fuzzy Systems
CityVancouver, BC
Period06/7/1606/7/21

Fingerprint

Clustering algorithms
Entropy

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

Cite this

Kanzawa, Y., Endo, Y., & Miyamoto, S. (2006). Fuzzy c-means clustering for data with tolerance using kernel functions. In IEEE International Conference on Fuzzy Systems (pp. 744-750). [1681793] https://doi.org/10.1109/FUZZY.2006.1681793

Fuzzy c-means clustering for data with tolerance using kernel functions. / Kanzawa, Yuchi; Endo, Yasunori; Miyamoto, Sadaaki.

IEEE International Conference on Fuzzy Systems. 2006. p. 744-750 1681793.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kanzawa, Y, Endo, Y & Miyamoto, S 2006, Fuzzy c-means clustering for data with tolerance using kernel functions. in IEEE International Conference on Fuzzy Systems., 1681793, pp. 744-750, 2006 IEEE International Conference on Fuzzy Systems, Vancouver, BC, 06/7/16. https://doi.org/10.1109/FUZZY.2006.1681793
Kanzawa Y, Endo Y, Miyamoto S. Fuzzy c-means clustering for data with tolerance using kernel functions. In IEEE International Conference on Fuzzy Systems. 2006. p. 744-750. 1681793 https://doi.org/10.1109/FUZZY.2006.1681793
Kanzawa, Yuchi ; Endo, Yasunori ; Miyamoto, Sadaaki. / Fuzzy c-means clustering for data with tolerance using kernel functions. IEEE International Conference on Fuzzy Systems. 2006. pp. 744-750
@inproceedings{bfa5f62b086f4151aa78819ac103511b,
title = "Fuzzy c-means clustering for data with tolerance using kernel functions",
abstract = "In this paper, two new clustering algorithms based on fuzzy c-means for data with tolerance 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, two objective functions in feature space are shown corresponding to two methods, respectively. Third, Karush-Kuhn-Tucker conditions of two objective functions are considered, respectively, and these conditions are reexpressed with kernel functions as the representation of an inner product for mapping from original pattern space into higher dimensional feature space than the original one. Last, two iterative algorithms are proposed for the objective functions, respectively.",
author = "Yuchi Kanzawa and Yasunori Endo and Sadaaki Miyamoto",
year = "2006",
doi = "10.1109/FUZZY.2006.1681793",
language = "English",
isbn = "0780394887",
pages = "744--750",
booktitle = "IEEE International Conference on Fuzzy Systems",

}

TY - GEN

T1 - Fuzzy c-means clustering for data with tolerance using kernel functions

AU - Kanzawa, Yuchi

AU - Endo, Yasunori

AU - Miyamoto, Sadaaki

PY - 2006

Y1 - 2006

N2 - In this paper, two new clustering algorithms based on fuzzy c-means for data with tolerance 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, two objective functions in feature space are shown corresponding to two methods, respectively. Third, Karush-Kuhn-Tucker conditions of two objective functions are considered, respectively, and these conditions are reexpressed with kernel functions as the representation of an inner product for mapping from original pattern space into higher dimensional feature space than the original one. Last, two iterative algorithms are proposed for the objective functions, respectively.

AB - In this paper, two new clustering algorithms based on fuzzy c-means for data with tolerance 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, two objective functions in feature space are shown corresponding to two methods, respectively. Third, Karush-Kuhn-Tucker conditions of two objective functions are considered, respectively, and these conditions are reexpressed with kernel functions as the representation of an inner product for mapping from original pattern space into higher dimensional feature space than the original one. Last, two iterative algorithms are proposed for the objective functions, respectively.

UR - http://www.scopus.com/inward/record.url?scp=34250791150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250791150&partnerID=8YFLogxK

U2 - 10.1109/FUZZY.2006.1681793

DO - 10.1109/FUZZY.2006.1681793

M3 - Conference contribution

SN - 0780394887

SN - 9780780394889

SP - 744

EP - 750

BT - IEEE International Conference on Fuzzy Systems

ER -