 Data analytics: feature extraction for application with small sample in classification algorithmsL. Kamatchi Priya, M.K. Kavitha Devi and S. Nagarajan International Journal of Business Information Systems, 2017, vol. 26, issue 3, 378-401 Abstract: This paper focuses on improving the classification accuracy for supervised learning in areas of application with very few training data and with extremely available high dimensionality. This paper proposes a framework which acts as a decision support system incorporating both feature selection and feature extraction to improvise the classification accuracy. The feature selection technique comprises redundancy elimination and relevance analysis. Feature subset selection problems eliminate features which are redundant by using correlation-based maximum spanning tree. But, the eliminated features may contain useful information which may contribute in determining the target or class labels. The principal components are extracted from the eliminated features and they are complemented with the selected features to perform classification. The superiority of the proposed method over other feature selection methods, in terms of computational complexity and classification accuracy, is established extensively on various datasets. Keywords: classification; feature selection; feature extraction; redundancy elimination; relevance analysis; maximum spanning tree; MST; supervised learning. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijbisy:v:26:y:2017:i:3:p:378-401 Access Statistics for this article More articles in International Journal of Business Information Systems from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.