• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Combining labeled and unlabeled data with co-training (1998)

Cached

  • Download as a PDF

Download Links

  • [l2r.cs.uiuc.edu]
  • [luthuli.cs.uiuc.edu]
  • [axon.cs.byu.edu]
  • [www.iro.umontreal.ca]
  • [www-connex.lip6.fr]
  • [www-connex.lip6.fr]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.ri.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Avrim Blum , Tom Mitchell
Citations:946 - 27 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Blum98combininglabeled,
    author = {Avrim Blum and Tom Mitchell},
    title = {Combining labeled and unlabeled data with co-training},
    booktitle = {},
    year = {1998},
    pages = {92--100},
    publisher = {Morgan Kaufmann Publishers}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We consider the problem of using a large unlabeled sample to boost performance of a learning algorithm when only a small set of labeled examples is available. In particular, we consider a setting in which the description of each example can be partitioned into two distinct views, motivated by the task of learning to classify web pages. For example, the description of a web page can be partitioned into the words occurring on that page, and the words occurring in hyperlinks that point to that page. We assume that either view of the example would be su cient for learning if we had enough labeled data, but our goal is to use both views together to allow inexpensive unlabeled data to augment amuch smaller set of labeled examples. Speci cally, the presence of two distinct views of each example suggests strategies in which two learning algorithms are trained separately on each view, and then each algorithm's predictions on new unlabeled examples are used to enlarge the training set of the other. Our goal in this paper is to provide a PAC-style analysis for this setting, and, more broadly, a PAC-style framework for the general problem of learning from both labeled and unlabeled data. We also provide empirical results on real web-page data indicating that this use of unlabeled examples can lead to signi cant improvement of hypotheses in practice. As part of our analysis, we provide new re-

Citations

6232 Maximum likelihood from incomplete data via the EM algorithm - Dempster, Laird, et al. - 1977
3341 Pattern Classification and Scene Analysis - Duda, Hart - 1973
383 Unsupervised Word Sense Disambiguation Rivaling Supervised Methods - Yarowsky - 1995
290 DiPasquo,“Learning to extract Symbolic Knowledge from the World Wide Web - Craven, Freitag, et al. - 1998
248 Efficient noise-tolerant learning from statistical queries - Kearns - 1998
247 Pattern Classi cation and Scene Analysis - Duda, Hart - 1973
239 Comparison of Two Learning Algorithms for Text Categorization - Lewis, Ringuette - 1994
157 Supervised learning from incomplete data via an EM approach - Ghahramani, Jordan - 1994
83 On the complexity of teaching - Goldman, Kearns - 1992
82 The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter - Castelli, Cover - 1996
75 M.: Informedia: News–on–demand multimedia information acquisition and retrieval - Hauptmann, Witbrock - 1997
59 On the exponential value of labeled samples - Castelli, Cover - 1995
57 Random sampling in cut, flow, and network design problems - Karger - 1994
33 Learning from a mixture of labeled and unlabeled examples with parametric side information - Ratsaby, Venkatesh - 1995
23 A computational model of teaching - Jackson, Tomkins - 1992
8 Improving acoustic models by watching television - Witbrock, Hauptmann - 1998
7 Pac learning with constant-partition classification noise and applications to decision tree induction - Decatur - 1997
4 cient noise-tolerant learning from statistical queries - unknown authors - 1993
1 learning with constantpartition classi cation noise and applications to decision tree induction - PAC - 1997
1 Random sampling in cut, ow, and network design problems. Journal version draft - Karger - 1997
1 Pattern Classificataon and Scene Analysis - Duda, Hart - 1973
1 R itn~ I 01x1 sampling in cut, flow, and network - Karger - 1997
1 noise-tolerant learning from statistical queries - Efficient - 1993
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University