CBFS: High performance feature selection algorithm based on feature clearness

24Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

Abstract

Background: The goal of feature selection is to select useful features and simultaneously exclude garbage features from a given dataset for classification purposes. This is expected to bring reduction of processing time and improvement of classification accuracy. Methodology: In this study, we devised a new feature selection algorithm (CBFS) based on clearness of features. Feature clearness expresses separability among classes in a feature. Highly clear features contribute towards obtaining high classification accuracy. CScore is a measure to score clearness of each feature and is based on clustered samples to centroid of classes in a feature. We also suggest combining CBFS and other algorithms to improve classification accuracy. Conclusions/Significance: From the experiment we confirm that CBFS is more excellent than up-to-date feature selection algorithms including FeaLect. CBFS can be applied to microarray gene selection, text categorization, and image classification. © 2012 Seo, Oh.

Cite

CITATION STYLE

APA

Seo, M., & Oh, S. (2012). CBFS: High performance feature selection algorithm based on feature clearness. PLoS ONE, 7(7). https://doi.org/10.1371/journal.pone.0040419

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free