The random subspace method for constructing decision forests
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| The Nature of Statistical Learning Theory | 1995 | 39,409 |
| C4.5: Programs for Machine Learning | 1992 | 23,704 |
| Classification and Regression Trees. | 1986 | 21,044 |
| Bagging Predictors | 1996 | 17,191 |
| Bagging predictors | 1996 | 16,468 |
| Induction of Decision Trees | 1986 | 15,020 |
| Induction of decision trees | 1986 | 12,427 |
| Experiments with a new boosting algorithm | 1996 | 7,582 |
| Random decision forests | 2002 | 5,123 |
| Decision combination in multiple classifier systems | 1994 | 1,515 |
What cites it, inside the corpus
Links
Topics
| Neural Networks and Applications | Computer Science |
| Face and Expression Recognition | Computer Science |
| Machine Learning and Data Classification | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports1 author record(s) attached.
- supports44 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 5cad55ac5d4d41e1…