A New Improved Hybridized K-MEANS Clustering Algorithm with Improved PCA Optimized with PSO for High Dimensional Data Set
暂无分享,去创建一个
Abstract— The day to day computation has made the data sets and data objects to grow large so it has become important to cluster the data in order to reduce complexity to some extent. K-means clustering algorithm is an efficient clustering algorithm to cluster the data, but the problem with the k-means is that when the dimension of the data set becomes larger the effectiveness of k-means is lost. PCA algorithm is used with k-means to counter the dimensionality problem. However K-means with PCA does not give much optimisation. It can be experimentally seen that the optimisation of k-means gives more accurate results. So in this paper we have proposed a PSO optimised k-means algorithm with improved PCA for clustering high dimensional data set.
[1] Saturnino Luz,et al. Dimensionality reduction for active learning with nearest neighbour classifier in text categorisation problems , 2007, Sixth International Conference on Machine Learning and Applications (ICMLA 2007).
[2] Yifeng Zeng,et al. Auto-Clustering Using Particle Swarm Optimization and Bacterial Foraging , 2009, ADMI.
[3] Ellips Masehian,et al. Particle Swarm Optimization Methods, Taxonomy and Applications , 2009 .
[4] Eric O. Postma,et al. Dimensionality Reduction: A Comparative Review , 2008 .