Keywords
Random forestMathematicsAdaBoostStatisticsTree (set theory)GeneralizationSupport vector machineGeneralization errorMeasure (data warehouse)Artificial intelligencePattern recognition (psychology)Computer scienceArtificial neural networkData miningCombinatorics
Affiliated Institutions
Related Publications
Kernel Logistic Regression and the Import Vector Machine
The support vector machine (SVM) is known for its good performance in two-class classification, but its extension to multiclass classification is still an ongoing research issue...
Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy
Feature selection is an important problem for pattern classification systems. We study how to select good features according to the maximal statistical dependency criterion base...
Stability-Based Validation of Clustering Solutions
Data clustering describes a set of frequently employed techniques in exploratory data analysis to extract “natural” group structure in data. Such groupings need to be validated ...
Statistical pattern recognition: a review
The primary goal of pattern recognition is supervised or unsupervised classification. Among the various frameworks in which pattern recognition has been traditionally formulated...
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Training Deep Neural Networks is complicated by the fact that the distribution of each layer's inputs changes during training, as the parameters of the previous layers change. T...
Publication Info
- Year
- 2001
- Type
- article
- Volume
- 45
- Issue
- 1
- Pages
- 5-32
- Citations
- 115020
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
115020
OpenAlex
Cite This
Leo Breiman
(2001).
Random Forests.
Machine Learning
, 45
(1)
, 5-32.
https://doi.org/10.1023/a:1010933404324
Identifiers
- DOI
- 10.1023/a:1010933404324