Learning from Labeled and Unlabeled Data using Graph Mincuts

Learning from Labeled and Unlabeled Data using Graph Mincuts (2001)

Cached

Download Links

[www.aladdin.cs.cmu.edu]
[www.cs.cmu.edu]

Other Repositories/Bibliography

DBLP

by Avrim Blum , Shuchi Chawla

Citations:

203 - 5 self

BibTeX

@MISC{Blum01learningfrom,
    author = {Avrim Blum and Shuchi Chawla},
    title = {Learning from Labeled and Unlabeled Data using Graph Mincuts},
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Many application domains suffer from not having enough labeled training data for learning. However, large amounts of unlabeled examples can often be gathered cheaply. As a result, there has been a great deal of work in recent years on how unlabeled data can be used to aid classification. We consider an algorithm based on finding minimum cuts in graphs, that uses pairwise relationships among the examples in order to learn from both labeled and unlabeled data. Our algorithm

Citations

7320	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
1824	Normalized cuts and image segmentation - Shi, Malik - 2000
1229	A global geometric framework for nonlinear dimensionality reduction - Tenenbaum, Silva, et al. - 2000
1156	Nonlinear dimensionality reduction by locally linear embedding - Roweis, Saul - 2000
947	Combining labeled and unlabeled data with co-training - Blum, Mitchell - 1998
464	Inducing features of random fields - Pietra, S, et al. - 1997
233	Exact maximum a posteriori estimation for binary images - Greig, Porteous, et al. - 1989
200	An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation - Wu, Leahy - 1993
193	A maximum-flow formulation of the ncamera stereo correspondence problem - Roy, Cox - 1998
147	Semi-supervised support vector machines - Bennett, Demiriz - 1998
140	Learning to classify text from labeled and unlabeled documents - Nigam, McCallum, et al. - 1998
131	Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields - Kleinberg, Tardos - 1999
123	Markov Random Fields with efficient approximations - BOYKOV, VEKSLER, et al. - 1998
82	The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter - Castelli, Cover - 1996
63	Exact voxel occupancy with graph cuts - Snow, Viola, et al.
37	A new metric-based approach to model selection - Schuurmans - 1997
33	Learning from a mixture of labeled and unlabeled examples with parametric side information - Ratsaby, Venkatesh - 1995
22	Inducing features of random - Pietra, S, et al. - 1997
13	Markov random with ecient approximations - Boykov, Veksler, et al. - 1998
9	Approximation Algorithms for Classi Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields - Kleinberg - 1999
8	Text categorization with labeled and unlabeled data: A generative model approach - Hofmann - 1999
6	Repository of machine learning databases. http://www.ics.uci.edu/ mlearn/MLRepository.html - UCI - 2000
1	Text categorization with labeled and unlabeled data: A generatire model approach - Holmann - 1999