Improvised: A Fast Clustering-Based Feature Subset Selection Algorithm
Varsha S. Sonwane
, Prof. Pratap Mohite
Feature subset selection, feature clustering, MST, confusion matrix
Feature selection involves identifying a subset of the most useful features that produces well-matched results as the original entire set of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. While the efficiency concerns the time required to find a subset of features, the effectiveness is related to the excellence of the subset of features. Based on these criteria, a fast clustering-based feature selection algorithm, FAST, is proposed and experimentally evaluated in this paper. The FAST algorithm works in two steps. In the first step, it involves (I) identify irrelevant features with help of four mehods 1)using Direct method 2)using cosine methos 3)using polynomial method 4)using linear method.(II)create a set of features are to be excluded (III)construct a MST (IV)obtain representative features and their weights (V)create a confusion matrix and obtain TPR and FPR.. To ensure the efficiency of FAST, we adopt the efficient minimum-spanning tree method. The efficiency and effectiveness of the FAST algorithm are evaluated through an empirical study. Extensive experiments are carried out to compare FAST and several representative feature selection algorithms, namely, FCBF, ReliefF, CFS, Consist, and FOCUS-SF, with respect to four types of well-known classifiers, namely, the probability-based Naive Bayes, the tree-based C4.5, the instance-based IB1, and the rule-based RIPPER before and after feature selection. The results, on 35 publicly available real-world high dimensional image, microarray, and text data, demonstrate that FAST not only produces smaller subsets of features but also improves the performances of the four types of classifiers.
"Improvised: A Fast Clustering-Based Feature Subset Selection Algorithm", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.2, Issue 9, page no.191 - 196, September-2017, Available :https://ijsdr.org/papers/IJSDR1709031.pdf
Volume 2
Issue 9,
September-2017
Pages : 191 - 196
Paper Reg. ID: IJSDR_170773
Published Paper Id: IJSDR1709031
Downloads: 000347180
Research Area: Engineering
Country: -, maharashtra, India
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave
