KFCSA: a novel clustering algorithm for high-dimension data

Authors:
Kan Li;Yushu Liu
Affiliations:
Dept. of Computer Science and Engineering, Beijing Institute of Technology, Beijing, China;Dept. of Computer Science and Engineering, Beijing Institute of Technology, Beijing, China
Venue:
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Year:
2005

Citing 5
Cited 1

Algorithms for clustering data

Algorithms for clustering data
Nonlinear component analysis as a kernel eigenvalue problem

Neural Computation
Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
Finding natural clusters through entropy minimization

Finding natural clusters through entropy minimization
Mercer kernel-based clustering in feature space

IEEE Transactions on Neural Networks

A novel fuzzy kernel C-means algorithm for document clustering

AIRS'08 Proceedings of the 4th Asia information retrieval conference on Information retrieval technology

Quantified Score

Hi-index	0.00

Visualization

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.