Sciweavers

1484 search results - page 28 / 297
» Semi-supervised Learning from General Unlabeled Data
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
CVPR
2010
IEEE
13 years 5 months ago
P-N learning: Bootstrapping binary classifiers by structural constraints
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
Zdenek Kalal, Jiri Matas, Krystian Mikolajczyk
NAACL
2001
13 years 9 months ago
Unsupervised Learning of Name Structure From Coreference Data
We present two methods for learning the structure of personal names from unlabeled data. The first simply uses a few implicit constraints governing this structure to gain a toehol...
Eugene Charniak
KDD
2009
ACM
142views Data Mining» more  KDD 2009»
14 years 8 months ago
Quantification and semi-supervised classification methods for handling changes in class distribution
In realistic settings the prevalence of a class may change after a classifier is induced and this will degrade the performance of the classifier. Further complicating this scenari...
Jack Chongjie Xue, Gary M. Weiss
ACL
2011
12 years 11 months ago
Joint Bilingual Sentiment Classification with Unlabeled Parallel Corpora
Most previous work on multilingual sentiment analysis has focused on methods to adapt sentiment resources from resource-rich languages to resource-poor languages. We present a nov...
Bin Lu, Chenhao Tan, Claire Cardie, Benjamin K. Ts...