Sciweavers

1484 search results - page 41 / 297
» Semi-supervised Learning from General Unlabeled Data
Sort
View
PKDD
2009
Springer
174views Data Mining» more  PKDD 2009»
15 years 8 months ago
Active and Semi-supervised Data Domain Description
Data domain description techniques aim at deriving concise descriptions of objects belonging to a category of interest. For instance, the support vector domain description (SVDD) l...
Nico Görnitz, Marius Kloft, Ulf Brefeld
127
Voted
AUSAI
2008
Springer
15 years 3 months ago
Learning to Find Relevant Biological Articles without Negative Training Examples
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...
Keith Noto, Milton H. Saier Jr., Charles Elkan
104
Voted
ECIR
2007
Springer
15 years 3 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
COLT
2003
Springer
15 years 7 months ago
Learning with Equivalence Constraints and the Relation to Multiclass Learning
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
Aharon Bar-Hillel, Daphna Weinshall
DASFAA
2004
IEEE
135views Database» more  DASFAA 2004»
15 years 5 months ago
Semi-supervised Text Classification Using Partitioned EM
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
Gao Cong, Wee Sun Lee, Haoran Wu, Bing Liu