Sciweavers

399 search results - page 27 / 80
» Robust Boosting for Learning from Few Examples
Sort
View
CVPR
2006
IEEE
15 years 11 months ago
Automatic Discovery of Action Taxonomies from Multiple Views
We present a new method for segmenting actions into primitives and classifying them into a hierarchy of action classes. Our scheme learns action classes in an unsupervised manner ...
Daniel Weinland, Rémi Ronfard, Edmond Boyer
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 1 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
AI
2005
Springer
14 years 9 months ago
Unsupervised named-entity extraction from the Web: An experimental study
The KNOWITALL system aims to automate the tedious process of extracting large collections of facts (e.g., names of scientists or politicians) from the Web in an unsupervised, doma...
Oren Etzioni, Michael J. Cafarella, Doug Downey, A...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
14 years 11 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
NIPS
2001
14 years 11 months ago
Active Learning in the Drug Discovery Process
We investigate the following data mining problem from Computational Chemistry: From a large data set of compounds, find those that bind to a target molecule in as few iterations o...
Manfred K. Warmuth, Gunnar Rätsch, Michael Ma...