Sciweavers

304 search results - page 34 / 61
» Soft-Supervised Learning for Text Classification
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
ICDAR
2009
IEEE
14 years 2 months ago
Learning Rich Hidden Markov Models in Document Analysis: Table Location
Hidden Markov Models (HMM) are probabilistic graphical models for interdependent classification. In this paper we experiment with different ways of combining the components of an ...
Ana Costa e Silva
ICML
2003
IEEE
14 years 8 months ago
Unsupervised Learning with Permuted Data
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
Sergey Kirshner, Sridevi Parise, Padhraic Smyth
KDD
2003
ACM
157views Data Mining» more  KDD 2003»
14 years 8 months ago
Cross-training: learning probabilistic mappings between topics
Classification is a well-established operation in text mining. Given a set of labels A and a set DA of training documents tagged with these labels, a classifier learns to assign l...
Sunita Sarawagi, Soumen Chakrabarti, Shantanu Godb...
ICML
2006
IEEE
14 years 8 months ago
Constructing informative priors using transfer learning
Many applications of supervised learning require good generalization from limited labeled data. In the Bayesian setting, we can try to achieve this goal by using an informative pr...
Rajat Raina, Andrew Y. Ng, Daphne Koller