2009 · 278 citations · 36 references
ComputingComputer ScienceData ScienceData MiningMachine LearningPredictive AnalyticsDecision TreesDimensionality ReductionEnsemble LearningEnsemble MethodsFeature SelectionVariable SelectionFeature Selection For ClassificationFeature Selection For RegressionFeature Selection In TreesFeature Subset SelectionHybrid Feature SelectionInteractive EffectsRedundant Feature EliminationRedundant Features
Predictive models benefit from a compact, non-redundant subset of features that improves interpretability and generalization. Modern data sets are wide, dirty, mixed with both numerical and categorical predictors, and may contain interactive effects that require complex models. This is a challenge for filters, wrappers, and embedded feature selection methods. We describe details of an algorithm using tree-based ensembles to generate a compact subset of non-redundant features. Parallel and serial ensembles of trees are combined into a mixed method that can uncover masking and detect features of secondary effect. Simulated and actual examples illustrate the effectiveness of the approach.
36
Leo Breiman · Machine Learning · 2001 · 126.2K citations · Full text
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
Classification and Regression Trees.
Alexander Gordon, Leo Breiman, Jerome H. Friedman et al. · Biometrics · 1984 · 23.9K citations
Classification and Regression Trees.
John Van Ryzin, Leo Breiman, Jerome H. Friedman et al. · Journal of the American Statistical Association · 1986 · 21K citations
On Information and Sufficiency
S. Kullback, R. A. Leibler · The Annals of Mathematical Statistics · 1951 · 20K citations · Full text