Downloads: 106 | Views: 274

Survey Paper | Computer Science & Engineering | India | Volume 3 Issue 12, December 2014 | Popularity: 6.9 / 10

Rate This Article!      

A Survey on Fast Clustering Based Feature Selection Algorithm for High Dimensional Data

Swapnil A. Sutar, Prof. Devendra P. Gadekar

Abstract: Data mining has main problem of partitioning a group of objects into a number of subsets, such that similarity in each subset or cluster is increased and effective result should be obtained. The feature selection method is more generalized form of feature extraction. Feature selection gives useful feature from data while the feature extraction creates new feature set according to existing feature sets. The main concept of this fast clustering feature selection algorithm is to cluster subset with most similar characteristic while removing irrelevant subset from that cluster. This FAST algorithm concern with both efficiency and accuracy for finding required set. The FAST algorithm requires two steps for its working, in first step algorithm uses minimum spanning tree (MST) to divide data into different clusters and in second step, it removes irrelevant sets and gives accurate and efficient result with similar sets. All clusters resulted in FAST algorithms are relatively independent of each other. So this may useful for most effective results.

Keywords: Feature extraction, Feature selection, FAST clustering Algorithm, irrelevant subset, Minimum Spanning Tree

Edition: Volume 3 Issue 12, December 2014

Pages: 691 - 694

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles