Sciweavers

750 search results - page 50 / 150
» Learning SVMs from Sloppily Labeled Data
Sort
View
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
14 years 3 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
ICDM
2008
IEEE
97views Data Mining» more  ICDM 2008»
14 years 3 months ago
Semi-supervised Learning from General Unlabeled Data
We consider the problem of Semi-supervised Learning (SSL) from general unlabeled data, which may contain irrelevant samples. Within the binary setting, our model manages to better...
Kaizhu Huang, Zenglin Xu, Irwin King, Michael R. L...
HCI
2009
13 years 7 months ago
Sign Language Recognition: Working with Limited Corpora
The availability of video format sign language corpora limited. This leads to a desire for techniques which do not rely on large, fully-labelled datasets. This paper covers various...
Helen Cooper, Richard Bowden
MLDM
2007
Springer
14 years 3 months ago
Transductive Learning from Relational Data
Transduction is an inference mechanism “from particular to particular”. Its application to classification tasks implies the use of both labeled (training) data and unlabeled (...
Michelangelo Ceci, Annalisa Appice, Nicola Barile,...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 9 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto