Robust kernel fuzzy clustering

Weiwei Du, Kohei Inoue, Kiichi Urahama

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

Abstract

We present a method for extracting arbitrarily shaped clusters buried in uniform noise data. The popular k-means algorithm is firstly fuzzified with addition of entropie terms to the objective function of data partitioning problem. This fuzzy clustering is then kernelized for adapting to the arbitrary shape of clusters. Finally, the Euclidean distance in this kernelized fuzzy clustering is modified to a robust one for avoiding the influence of noisy background data. This robust kernel fuzzy clustering method is shown to outperform every its predecessor: fuzzified k-means, robust fuzzified k-means and kernel fuzzified k-means algorithms.

Original languageEnglish
Title of host publicationFuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings
PublisherSpringer Verlag
Pages454-461
Number of pages8
Volume3613 LNAI
ISBN (Print)9783540283126
Publication statusPublished - 2006
Event2nd International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2005 - Changsa, China
Duration: Aug 27 2005Aug 29 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3613 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2005
CountryChina
CityChangsa
Period8/27/058/29/05

Fingerprint

Fuzzy clustering
Fuzzy Clustering
K-means Algorithm
K-means
kernel
Data Partitioning
Euclidean Distance
Clustering Methods
Objective function
Arbitrary
Term

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Du, W., Inoue, K., & Urahama, K. (2006). Robust kernel fuzzy clustering. In Fuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings (Vol. 3613 LNAI, pp. 454-461). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3613 LNAI). Springer Verlag.

Robust kernel fuzzy clustering. / Du, Weiwei; Inoue, Kohei; Urahama, Kiichi.

Fuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings. Vol. 3613 LNAI Springer Verlag, 2006. p. 454-461 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3613 LNAI).

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

Du, W, Inoue, K & Urahama, K 2006, Robust kernel fuzzy clustering. in Fuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings. vol. 3613 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3613 LNAI, Springer Verlag, pp. 454-461, 2nd International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2005, Changsa, China, 8/27/05.
Du W, Inoue K, Urahama K. Robust kernel fuzzy clustering. In Fuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings. Vol. 3613 LNAI. Springer Verlag. 2006. p. 454-461. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Du, Weiwei ; Inoue, Kohei ; Urahama, Kiichi. / Robust kernel fuzzy clustering. Fuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings. Vol. 3613 LNAI Springer Verlag, 2006. pp. 454-461 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3ff3bfb410574835a42bcc88f1727852,
title = "Robust kernel fuzzy clustering",
abstract = "We present a method for extracting arbitrarily shaped clusters buried in uniform noise data. The popular k-means algorithm is firstly fuzzified with addition of entropie terms to the objective function of data partitioning problem. This fuzzy clustering is then kernelized for adapting to the arbitrary shape of clusters. Finally, the Euclidean distance in this kernelized fuzzy clustering is modified to a robust one for avoiding the influence of noisy background data. This robust kernel fuzzy clustering method is shown to outperform every its predecessor: fuzzified k-means, robust fuzzified k-means and kernel fuzzified k-means algorithms.",
author = "Weiwei Du and Kohei Inoue and Kiichi Urahama",
year = "2006",
language = "English",
isbn = "9783540283126",
volume = "3613 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "454--461",
booktitle = "Fuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Robust kernel fuzzy clustering

AU - Du, Weiwei

AU - Inoue, Kohei

AU - Urahama, Kiichi

PY - 2006

Y1 - 2006

N2 - We present a method for extracting arbitrarily shaped clusters buried in uniform noise data. The popular k-means algorithm is firstly fuzzified with addition of entropie terms to the objective function of data partitioning problem. This fuzzy clustering is then kernelized for adapting to the arbitrary shape of clusters. Finally, the Euclidean distance in this kernelized fuzzy clustering is modified to a robust one for avoiding the influence of noisy background data. This robust kernel fuzzy clustering method is shown to outperform every its predecessor: fuzzified k-means, robust fuzzified k-means and kernel fuzzified k-means algorithms.

AB - We present a method for extracting arbitrarily shaped clusters buried in uniform noise data. The popular k-means algorithm is firstly fuzzified with addition of entropie terms to the objective function of data partitioning problem. This fuzzy clustering is then kernelized for adapting to the arbitrary shape of clusters. Finally, the Euclidean distance in this kernelized fuzzy clustering is modified to a robust one for avoiding the influence of noisy background data. This robust kernel fuzzy clustering method is shown to outperform every its predecessor: fuzzified k-means, robust fuzzified k-means and kernel fuzzified k-means algorithms.

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

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

M3 - Conference contribution

AN - SCOPUS:33749003745

SN - 9783540283126

VL - 3613 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 454

EP - 461

BT - Fuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings

PB - Springer Verlag

ER -