Identifying Feature Relevance using a Random Forest
  • Video is free for view
View_video

Many feature selection algorithms are limited in that they attempt to identify relevant feature subsets by examining the features individually. This paper introduces a technique for determining feature relevance using the average information gain achieved during the construction of decision tree ensembles. The technique introduces a node complexity measure and a statistical method for updating the feature sampling distribution based upon confidence intervals to control the rate of convergence. Experiments demonstrate the potential of this method for feature selection and subspace identification.

Author: Jeremy D. Rogers, University Of Southampton



Tags: VideoLectures.Net, Machine Learning, Preprocessing, Ensemble Methods, Lectures, Computer Science, Science

Level: advanced Date: October 20, 2008 Votes: 0 User: Dmytro Shteflyuk  Comments:
 
 

1 Response(s) to this entry

Subscribe to comments with RSS.