Sciweavers

750 search results - page 125 / 150
» Learning SVMs from Sloppily Labeled Data
Sort
View
ICML
2006
IEEE
14 years 11 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
SIGIR
2004
ACM
14 years 4 months ago
Learning to cluster web search results
Organizing Web search results into clusters facilitates users' quick browsing through search results. Traditional clustering techniques are inadequate since they don't g...
Hua-Jun Zeng, Qi-Cai He, Zheng Chen, Wei-Ying Ma, ...
WWW
2005
ACM
14 years 11 months ago
Web data extraction based on partial tree alignment
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
Yanhong Zhai, Bing Liu
CVPR
2008
IEEE
15 years 19 days ago
On the use of independent tasks for face recognition
We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary...
Àgata Lapedriza, David Masip, Jordi Vitri&a...
ICML
2007
IEEE
14 years 11 months ago
Linear and nonlinear generative probabilistic class models for shape contours
We introduce a robust probabilistic approach to modeling shape contours based on a lowdimensional, nonlinear latent variable model. In contrast to existing techniques that use obj...
Graham McNeill, Sethu Vijayakumar