Sciweavers

2252 search results - page 61 / 451
» Improving Random Forests
Sort
View
ALT
2007
Springer
14 years 5 months ago
On Calibration Error of Randomized Forecasting Algorithms
It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
Vladimir V. V'yugin
CVPR
2005
IEEE
14 years 10 months ago
Random Subspaces and Subsampling for 2-D Face Recognition
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
Nitesh V. Chawla, Kevin W. Bowyer
MSWIM
2006
ACM
14 years 2 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
14 years 2 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
AAAI
2008
13 years 10 months ago
CRF-OPT: An Efficient High-Quality Conditional Random Field Solver
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...
Minmin Chen, Yixin Chen, Michael R. Brent