Sciweavers

246 search results - page 8 / 50
» Calibrating Random Forests
Sort
View
ECML
2004
Springer
14 years 27 days ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
PAMI
1998
127views more  PAMI 1998»
13 years 7 months ago
The Random Subspace Method for Constructing Decision Forests
—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 ...
Tin Kam Ho
NIPS
2004
13 years 9 months ago
Using Random Forests in the Structured Language Model
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
Peng Xu, Frederick Jelinek
ICIP
2009
IEEE
14 years 8 months ago
Age Regression From Faces Using Random Forests
Predicting the age of a person through face image analysis holds the potential to drive an extensive array of real world applications from human computer interaction and security ...
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
13 years 11 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran