Call For Paper Volume:7 Issue:1 Jan'2020 |

Clustering Based Feature Subset Algorithm in High Dimensional Data

Publication Date : 28/02/2015

Author(s) :


Volume/Issue :
Volume 2
Issue 2
(02 - 2015)

Abstract :

In the high dimensional data the dimensional reduction is an important factor, for that purpose the clustering based feature subset selection algorithm is proposed in this paper. The features have been clustered according to the class labels. The Relevance of the clustered features has been evaluated. The correlation of the relevant clustered feature is then evaluated. Based on the correlation evaluation the Minimum Spanning Tree (MST) has been generated. The representatives of each class have been identified by the MST. The effectiveness is determined in terms of time required to find the subset of feature and the efficiency is determined terms of quality of the subset. By comparing the proposed algorithm with the existing feature selection algorithms like FCBF, reliefF, CFS etc with respect to the four classification algorithms namely Naive Bayer, the tree based c4.5, the instance based IB1 and rule based RIPPER the proposed algorithm is better in terms of efficiency and accuracy. The results are computed with various types of data set. Keywords: Minimum Spanning Tree (MST), FCBF, ReliefF, CFS, IBI, Naïve Bayes

No. of Downloads :



Web Design MymensinghPremium WordPress ThemesWeb Development

Clustering Based Feature Subset Algorithm in High Dimensional Data

February 28, 2015