Abstract

With the abundance of exceptionally High Dimensional data, feature selection has become an essential element in the Data Mining process. In this paper, we investigate the problem of efficient feature selection for classification on High Dimensional datasets. We present a novel filter based approach for feature selection that sorts out the features based on a score and then we measure the performance of four different Data Mining classification algorithms on the resulting data. In the proposed approach, we partition the sorted feature and search the important feature in forward manner as well as in reversed manner, while starting from first and last feature simultaneously in the sorted list. The proposed approach is highly scalable and effective as it parallelizes over both attribute and tuples simultaneously allowing us to evaluate many of potential features for High Dimensional datasets. The newly proposed framework for feature selection is experimentally shown to be very valuable with real and synthetic High Dimensional datasets which improve the precision of selected features. We have also tested it to measure classification accuracy against various feature selection process.

Highlights

  • Data Mining is a multidisciplinary task to find out hidden nuggets of information from data

  • We have proposed an algorithm for feature subset selection for High Dimensional datasets

  • We are using correlation based feature ranking method, symmetric uncertainty (SU), which forms the basis of our approach

Read more

Summary

Introduction

Data Mining is a multidisciplinary task to find out hidden nuggets of information from data. Feature selection is an active field of research and development since the 70’s, in multidisciplinary field It includes statistical pattern recognition [2] [3], machine learning [4]-[7], Data Mining [8]-[10] and it is extensively applied to various field such as text categorization [11] [12] image retrieval [13] [14], genomics analysis [7] [15] [16], CRM [17]. This requirement is decisive in biological applications, e.g. DNA-microarrays, genomics, and proteomics, mass spectrometry These applications are generally characterized by high dimensionality; the goal is to find a small output set of highly uncorrelated variables on which biomedical and Data Miner experts will subsequently invest considerable less time and research effort.

Literature Review and Background
Mutual Information
Symmetric Uncertainty
Relevant Feature and F-Correlation
A Correlation Based Feature Subset Selection Algorithm
Proposed Framework and Algorithm
Computational Complexity of Proposed Approach
Experimental Result and Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.