Advances in Feature Selection with Mutual Information

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1007/978-3-642-01805-3_4

The selection of features that are relevant for a prediction or classification problem is an important problem in many domains involving high-dimensional data. Selecting features helps fighting the curse of dimensionality, improving the performances of prediction or classification methods, and interpreting the application. In a nonlinear context, the mutual information is widely used as relevance criterion for features and sets of features. Nevertheless, it suffers from at least three major limitations: mutual information estimators depend on smoothing parameters, there is no theoretically justified stopping criterion in the feature selection greedy procedure, and the estimation itself suffers from the curse of dimensionality. This chapter shows how to deal with these problems. The two first ones are addressed by using resampling techniques that provide a statistical basis to select the estimator parameters and to stop the search procedure. The third one is addressed by modifying the mutual information criterion into a measure of how features are complementary (and not only informative) for the problem at hand.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Advances in Feature Selection with Mutual Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Advances in Feature Selection with Mutual Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Advances in Feature Selection with Mutual Information will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-663829

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.