High-dimensional feature selection for genomic datasets.

A central problem in machine learning and pattern recognition is the process of recognizing the most important features. In this paper, we provide a new feature selection method (DRPT) that consists of first removing the irrelevant features and then detecting correlations between the remaining features. Let D = A ∣ b be a dataset, where b is the class label and A is a matrix whose columns are the features. We solve A x = b using the least squares method and the pseudo-inverse of A. Each component of x can be viewed as an assigned weight to the corresponding column (feature). We define a threshold based on the local maxima of x and remove those features whose weights are smaller than the threshold. To detect the correlations in the reduced matrix, which we still call A , we consider a perturbation A ̃ of A. We prove that correlations are encoded in Δ x = ∣ x − x ̃ ∣ , where x ̃ is the least squares solution of A ̃ x ̃ = b. We cluster features first based on Δ x and then using the entropy of features. Finally, a feature is selected from each sub-cluster based on its weight and entropy. The effectiveness of DRPT has been verified by performing a series of comparisons with seven state-of-the-art feature selection methods over ten genetic datasets ranging up from 9,117 to 267,604 features. The results show that, over all, the performance of DRPT is favorable in several aspects compared to each feature selection algorithm. [ABSTRACT FROM AUTHOR]