CLUSTERING VIA DIMENSIONAL REDUCTION METHOD FOR THE PROJECTION PURSUIT BASED ON THE ICSA

The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with Projection Pursuit dimension reduction based on Immune Clonal Selection Algorithm...

Full description

Saved in:
Bibliographic Details
Published in:Journal of electronics (China) 2010, Vol.27 (4), p.474-479
Main Authors: Gou, Shuiping, Feng, Jing, Jiao, Licheng
Format: Article
Language:English
Subjects:
Electrical Engineering
Engineering
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with Projection Pursuit dimension reduction based on Immune Clonal Selection Algorithm （ICSA-PP） is proposed in this paper. Projection pursuit strategy can maintain consistent Euclidean distances between points in the low-dimensional embeddings where the ICSA is used to search optimizing projection direction. The proposed algorithm can converge quickly with less iteration to reduce dimension of some high-dimensional datasets, and in which space, K-mean clustering algorithm is used to partition the reduced data. The experiment results on UCI data show that the presented method can search quicker to optimize projection direction than Genetic Algorithm （GA） and it has better clustering results compared with traditional linear dimension reduction method for Principle Component Analysis （PCA）.
ISSN:0217-9822
1993-0615
DOI:10.1007/s11767-011-0349-7