Sciweavers

323 search results - page 26 / 65
» New Algorithms for Learning in Presence of Errors
Sort
View
IJCV
2000
97views more  IJCV 2000»
13 years 8 months ago
Contour Tracking in Clutter: A Subset Approach
A new method for tracking contours of moving objects in clutter is presented. For a given object, a model of its contours is learned from training data in the form of a subset of c...
Daniel Freedman, Michael S. Brandstein
AIIA
2005
Springer
14 years 2 months ago
Experimental Evaluation of Hierarchical Hidden Markov Models
Building profiles for processes and for interactive users is a important task in intrusion detection. This paper presents the results obtained with a Hierarchical Hidden Markov Mo...
Attilio Giordana, Ugo Galassi, Lorenza Saitta
ICMLA
2007
13 years 10 months ago
Memory-based context-sensitive spelling correction at web scale
We study the problem of correcting spelling mistakes in text using memory-based learning techniques and a very large database of token n-gram occurrences in web text as training d...
Andrew Carlson, Ian Fette
ML
2000
ACM
13 years 8 months ago
Enlarging the Margins in Perceptron Decision Trees
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...
Kristin P. Bennett, Nello Cristianini, John Shawe-...
ALT
2009
Springer
14 years 5 months ago
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
Maria-Florina Balcan, Heiko Röglin, Shang-Hua...