Sciweavers

421 search results - page 11 / 85
» Reducing Label Complexity by Learning From Bags
Sort
View
FLAIRS
2004
14 years 11 months ago
A Faster Algorithm for Generalized Multiple-Instance Learning
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
Qingping Tao, Stephen D. Scott
ASUNAM
2010
IEEE
14 years 11 months ago
Semi-Supervised Classification of Network Data Using Very Few Labels
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
Frank Lin, William W. Cohen
ML
2000
ACM
124views Machine Learning» more  ML 2000»
14 years 9 months ago
Text Classification from Labeled and Unlabeled Documents using EM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...
Kamal Nigam, Andrew McCallum, Sebastian Thrun, Tom...
69
Voted
ECIR
2007
Springer
14 years 11 months ago
Active Learning with History-Based Query Selection for Text Categorisation
Automated text categorisation systems learn a generalised hypothesis from large numbers of labelled examples. However, in many domains labelled data is scarce and expensive to obta...
Michael Davy, Saturnino Luz
CEAS
2007
Springer
15 years 1 months ago
Online Active Learning Methods for Fast Label-Efficient Spam Filtering
Active learning methods seek to reduce the number of labeled examples needed to train an effective classifier, and have natural appeal in spam filtering applications where trustwo...
D. Sculley