Combining labeled and unlabeled data with co-training
Published 24 July 1998Open access
Avrim Blum, Tom M. Mitchell
Citations5,604
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We consider the problem of using a large unlabeled sample to boost performance of a learning algorit,hrn when only a small set of labeled examples is available.
Keywords
Computer Science
Journal of the Royal Statistical Society Series B (Statistical Methodology)Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
49,657 Citations1977A. P. Dempster, N. M. Laird +1 more
Pattern classification and scene analysis
12,643 Citations1973Richard O. Duda, Peter E. Hart
Digital Access to Scholarship at Harvard (DASH) (Harvard University)Maximum Likelihood from Incomplete Data via the EM Algorithm
4,523 Citations1977Dempster, Arthur P., Laird, Nan M. +1 more
Unsupervised word sense disambiguation rivaling supervised methods
2,408 Citations1995David Yarowsky
An unsupervised learning algorithm for sense disambiguation that, when trained on unannotated English text, rivals the performance of supervised techniques that require time-consuming hand annotations.
Learning to extract symbolic knowledge from the World Wide Web
675 Citations1998Mark Craven, Dan DiPasquo +5 more
The goal of the research described here is to automatically create a computer understandable world wide knowledge base whose content mirrors that of the World Wide Web, and several machine learning algorithms for this task are described.
Supervised learning from incomplete data via an EM approach
543 Citations1993Zoubin Ghahramani, Michael I. Jordan
A framework based on maximum likelihood density estimation for learning from high-dimensional data sets with arbitrary patterns of missing data is presented and results from a classification benchmark--the iris data set--are presented.
Journal of Computer and System SciencesOn the Complexity of Teaching
277 Citations1995Sally A. Goldman, Michael Kearns
This paper studies the complexity of teaching by considering a variant of the on-line learning model in which a helpful teacher selects the instances, and measures the teaching dimension by a combinatorial measure.
Mathematics of Operations ResearchRandom Sampling in Cut, Flow, and Network Design Problems
195 Citations1999David R. Karger
Efficient noise-tolerant learning from statistical queries
177 Citations1993Michael Kearns
The generality of the statistical query model is demonstrated, showing that practically every class learnable in Valiant’s model and its variants can also be learned in the new model (and thus can be learned in the presence of noise).
Informedia: news-on-demand multimedia information acquisition and retrieval
145 Citations1997Alexander G. Hauptmann, Michael Witbrock
The News-on-Demand application created within the InformediaTM Digital Video Library project is described and how speech recognition is used for transcript creation from video, time alignment of closed-captioned transcripts, a speech query interface, and audio paragraph segmentation is discussed.
Random sampling in cut, flow, and network design problems
108 Citations1994David R. Karger
It is shown that the sparse graph, or skeleton, that arises when the authors randomly sample a graph's edges will accurately approximate the value of all cuts in the original graph with high probability, which makes sampling effective for problems involving cuts in graphs.
Learning from a mixture of labeled and unlabeled examples with parametric side information
97 Citations1995Joel Ratsaby, Santosh S. Venkatesh
The tradeoff between labeled and unlabeled sample complexities in learning is investigated and pendent sampling from the distribution of pairs (x, y) is shown.
A computational model of teaching
47 Citations1992Jeffrey C. Jackson, Andrew Tomkins
A computational analog is presented which allows us to make statements about bounded-complexity teachers and learners, and the model is extended by incorporating trusted information.
Improving Acoustic Models by Watching Television
15 Citations1998Michael Witbrock, Alexander G. Hauptmann
A reliable unsupervised method for identifying accurately transcribed sections of closed-captioned television broadcasts, and it is shown how these segments can be used to train a recognition system.