Sciweavers

2252 search results - page 293 / 451
» A distributed machine learning framework
Sort
View
141
Voted
COLT
2000
Springer
15 years 4 months ago
The Role of Critical Sets in Vapnik-Chervonenkis Theory
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
Nicolas Vayatis
128
Voted
ALT
2008
Springer
15 years 2 months ago
Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
Abstract. We consider the problem of sequence prediction in a probabilistic setting. Let there be given a class C of stochastic processes (probability measures on the set of one-wa...
Daniil Ryabko
89
Voted
COLT
2008
Springer
15 years 2 months ago
On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
Shai Shalev-Shwartz, Yoram Singer
115
Voted
ML
2008
ACM
135views Machine Learning» more  ML 2008»
15 years 19 days ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
JMLR
2002
115views more  JMLR 2002»
15 years 10 days ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger