KFCSA: A novel clustering algorithm for high-dimension data

Kan Li*, Yushu Liu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Classical fuzzy c-means and its variants cannot get better effect when the characteristic of samples is not obvious, and these algorithms run easily into locally optimal solution. According to the drawbacks, a novel mercer kernel based fuzzy clustering self-adaptive algorithm(KFCSA) is presented. Mercer kernel method is used to map implicitly the input data into the high-dimensional feature space through the nonlinear transformation. A self-adaptive algorithm is proposed to decide the number of clusters, which is not given in advance, and it can be gotten automatically by a validity measure function. In addition, attribute reduction algorithm is used to decrease the numbers of attributes before high dimensional data are clustered. Finally, experiments indicate that KFCSA may get better performance.

Original languageEnglish
Title of host publicationFuzzy Systems and Knowledge Discovery - Second International Conference, FSKD 2005, Proceedings
PublisherSpringer Verlag
Pages531-536
Number of pages6
ISBN (Print)9783540283126
Publication statusPublished - 2006
Event2nd International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2005 - Changsa, China
Duration: 27 Aug 200529 Aug 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3613 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2005
Country/TerritoryChina
CityChangsa
Period27/08/0529/08/05

Fingerprint

Dive into the research topics of 'KFCSA: A novel clustering algorithm for high-dimension data'. Together they form a unique fingerprint.

Cite this