Sciweavers

73 search results - page 4 / 15
» Learning to Classify Documents with Only a Small Positive Tr...
Sort
View
KDD
2008
ACM
195views Data Mining» more  KDD 2008»
14 years 6 months ago
Learning from multi-topic web documents for contextual advertisement
Contextual advertising on web pages has become very popular recently and it poses its own set of unique text mining challenges. Often advertisers wish to either target (or avoid) ...
Yi Zhang, Arun C. Surendran, John C. Platt, Mukund...
MLDM
2007
Springer
13 years 12 months ago
PE-PUC: A Graph Based PU-Learning Approach for Text Classification
This paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed w...
Shuang Yu, Chunping Li
JMLR
2006
134views more  JMLR 2006»
13 years 5 months ago
Considering Cost Asymmetry in Learning Classifiers
Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with fa...
Francis R. Bach, David Heckerman, Eric Horvitz
IJCAI
2007
13 years 7 months ago
Learning to Identify Unexpected Instances in the Test Set
Traditional classification involves building a classifier using labeled training examples from a set of predefined classes and then applying the classifier to classify test instan...
Xiaoli Li, Bing Liu, See-Kiong Ng
ICML
2005
IEEE
14 years 6 months ago
PAC-Bayes risk bounds for sample-compressed Gibbs classifiers
We extend the PAC-Bayes theorem to the sample-compression setting where each classifier is represented by two independent sources of information: a compression set which consists ...
François Laviolette, Mario Marchand