Sciweavers

1376 search results - page 43 / 276
» The Localization Hypothesis and Machines
Sort
View
ECML
1997
Springer
14 years 2 months ago
Global Data Analysis and the Fragmentation Problem in Decision Tree Induction
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
Ricardo Vilalta, Gunnar Blix, Larry A. Rendell
COLT
1994
Springer
14 years 2 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby
COLT
2008
Springer
13 years 11 months ago
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...
Shai Ben-David, Tyler Lu, Dávid Pál
NIPS
2001
13 years 11 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson
JMLR
2007
101views more  JMLR 2007»
13 years 9 months ago
Noise Tolerant Variants of the Perceptron Algorithm
A large number of variants of the Perceptron algorithm have been proposed and partially evaluated in recent work. One type of algorithm aims for noise tolerance by replacing the l...
Roni Khardon, Gabriel Wachman