Sciweavers

394 search results - page 30 / 79
» A Study of Empirical Learning for an Involved Problem
Sort
View
ICML
2005
IEEE
16 years 19 days ago
Closed-form dual perturb and combine for tree-based models
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
Pierre Geurts, Louis Wehenkel
ICML
2006
IEEE
16 years 19 days ago
Deterministic annealing for semi-supervised kernel machines
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...
CP
2007
Springer
15 years 6 months ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
JMLR
2010
106views more  JMLR 2010»
14 years 6 months ago
Why Does Unsupervised Pre-training Help Deep Learning?
Much recent research has been devoted to learning algorithms for deep architectures such as Deep Belief Networks and stacks of auto-encoder variants, with impressive results obtai...
Dumitru Erhan, Yoshua Bengio, Aaron C. Courville, ...
JMLR
2010
125views more  JMLR 2010»
14 years 6 months ago
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
Jacek P. Dmochowski, Paul Sajda, Lucas C. Parra