Sciweavers

1484 search results - page 33 / 297
» Semi-supervised Learning from General Unlabeled Data
Sort
View
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 8 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
ALT
1998
Springer
13 years 12 months ago
PAC Learning from Positive Statistical Queries
Learning from positive examples occurs very frequently in natural learning. The PAC learning model of Valiant takes many features of natural learning into account, but in most case...
François Denis
ICMCS
2005
IEEE
90views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Integrating co-training and recognition for text detection
Training a good text detector requires a large amount of labeled data, which can be very expensive to obtain. Cotraining has been shown to be a powerful semi-supervised learning t...
Wen Wu, Datong Chen, Jie Yang
ICANN
2009
Springer
14 years 9 days ago
Learning SVMs from Sloppily Labeled Data
This paper proposes a modelling of Support Vector Machine (SVM) learning to address the problem of learning with sloppy labels. In binary classification, learning with sloppy labe...
Guillaume Stempfel, Liva Ralaivola
SIGIR
2008
ACM
13 years 7 months ago
Learning to rank with partially-labeled data
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
Kevin Duh, Katrin Kirchhoff