Skip to main content
Article thumbnail
Location of Repository

Learning from Labeled and Unlabeled Data using Graph Mincuts

By Avrim Blum and Shuchi Chawla

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 algorith

Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.19.3957
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.aladdin.cs.cmu.edu/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.