Sciweavers

28 search results - page 2 / 6
» Small Sample Inference for Generalization Error in Classific...
Sort
View
COLT
2001
Springer
13 years 9 months ago
Geometric Bounds for Generalization in Boosting
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
Shie Mannor, Ron Meir
NAACL
2010
13 years 2 months ago
Relaxed Marginal Inference and its Application to Dependency Parsing
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
Sebastian Riedel, David A. Smith
IJBRA
2007
97views more  IJBRA 2007»
13 years 4 months ago
Structural Risk Minimisation based gene expression profiling analysis
: For microarray based cancer classification, feature selection is a common method for improving classifier generalisation. Most wrapper methods use cross validation methods to eva...
Xue-wen Chen, Byron Gerlach, Dechang Chen, ZhenQiu...
ISCA
2011
IEEE
270views Hardware» more  ISCA 2011»
12 years 8 months ago
Sampling + DMR: practical and low-overhead permanent fault detection
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
Shuou Nomura, Matthew D. Sinclair, Chen-Han Ho, Ve...
ICML
1998
IEEE
14 years 5 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour