Skip to content

The random subspace method for constructing decision forests

Tin Kam Ho

IEEE Transactions on Pattern Analysis and Machine Intelligence · 1998 · 7,020 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Ho, T. K. (1998). The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8), 832–844. https://doi.org/10.1109/34.709601

In text: (Ho, 1998)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is seldom resolved. A method to construct a decision tree based classifier is proposed that maintains highest accuracy on training data and improves on generalization accuracy as it grows in complexity. The classifier consists of multiple trees constructed systematically by pseudorandomly selecting subsets of components of the feature vector, that is, trees constructed in randomly chosen subspaces. The subspace method is compared to single-tree classifiers and other forest construction methods by experiments on publicly available datasets, where the method's superiority is demonstrated. We also discuss independence between trees in a forest and relate that to the combined classification accuracy.

  1. Regression Shrinkage and Selection Via the Lasso1996
  2. A Heteroskedasticity-Consistent Covariance Matrix Estimator and a Direct Test for Heteroskedasticity1980
  3. Classification and Regression Trees.1984
  4. Longitudinal data analysis using generalized linear models1986
  5. Bootstrap Methods: Another Look at the Jackknife1979

Metadata from OpenAlex (CC0). Citations are generated from the published record.