Corpus ID: 15008961

Learning from labeled and unlabeled data with label propagation

@inproceedings{Zhu2002LearningFL,
  title={Learning from labeled and unlabeled data with label propagation},
  author={Xiaojin Zhu and Zoubin Ghahramani},
  year={2002}
}
We investigate the use of unlabeled data to help labeled data in cl ssification. We propose a simple iterative algorithm, label pro pagation, to propagate labels through the dataset along high density are as d fined by unlabeled data. We analyze the algorithm, show its solution , and its connection to several other algorithms. We also show how to lear n p ameters by minimum spanning tree heuristic and entropy minimiz ation, and the algorithm’s ability to perform feature selection. Expe riment… Expand
Combining active learning and graph-based semi-supervised learning
TLDR
Experimental results in artificial and real datasets indicate that the proposed approach requires significantly less labeled instances to reach the same performance of random label selection. Expand
Graph-Based Active Learning Based on Label Propagation
TLDR
This work proposes a graph-based active learning method, which can also handle multi-class problems, in the entropy reduction framework and outperforms the traditional sampling methods on selected datasets. Expand
Supervised Classification Leveraging Refined Unlabeled Data
TLDR
This thesis focuses on how unlabeled data can improve supervised learning classi-fiers in all contexts, for both scarce to abundant label situations, and recommends data-processing and algorithmic solutions appropriate to real-world situations. Expand
Semi-Supervised Learning Using Random Walk Limiting Probabilities
TLDR
A semi-supervised technique that uses random walk limiting probabilities to propagate label information through a network of unlabeled instances via a biased random walk. Expand
Relation Extraction Using Label Propagation Based Semi-Supervised Learning
TLDR
This paper investigates a graph based semi-supervised learning algorithm, a label propagation (LP) algorithm, for relation extraction that represents labeled and unlabeled examples and their distances as the nodes and the weights of edges of a graph, and tries to obtain a labeling function to satisfy two constraints. Expand
Robust Graph Hyperparameter Learning for Graph Based Semi-supervised Classification
TLDR
This work proposes a technique to learn the hyperparameters for graphs that yields low leave-one-out prediction error on labeled data while retaining high stability of the prediction on unlabeled data. Expand
Analysis of label noise in graph-based semi-supervised learning
TLDR
This work aims to perform an extensive empirical evaluation of existing graph-based semi-supervised algorithms, like Gaussian Fields and Harmonic Functions, Local and Global Consistency, Laplacian Eigenmaps, Graph Transduction Through Alternating Minimization, and so on, to compare the accuracy of classifiers while varying the amount of labeled data and label noise for many different samples. Expand
Fast Randomized Semi-Supervised Clustering
TLDR
An efficient local algorithm based on a power iteration of the non-backtracking operator is introduced and its performance on a simple model is studied. Expand
A Multi-Label Threshold Learning Framework for Propagation Algorithms on a Non-Feature Network
TLDR
A LPBC framework is proposed to allow a propagation algorithm to deal with multi-label classification problem on networks with a novel threshold training process that reduces the minority ignorance when the label information is propagated. Expand
Label Propagation through Linear Neighborhoods
TLDR
A novel graph-based semi supervised learning approach is proposed based on a linear neighborhood model, which assumes that each data point can be linearly reconstructed from its neighborhood, and can propagate the labels from the labeled points to the whole data set using these linear neighborhoods with sufficient smoothness. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
Learning from Labeled and Unlabeled Data using Graph Mincuts
TLDR
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 is considered. Expand
Partially labeled classification with Markov random walks
TLDR
This work combines a limited number of labeled examples with a Markov random walk representation over the unlabeled examples and develops and compares several estimation criteria/algorithms suited to this representation. Expand
IEEE transactions on pattern analysis and machine intelligence
TLDR
This special issue aims at gathering the recent advances in learning with shared information methods and their applications in computer vision and multimedia analysis and addressing interesting real-world computer Vision and multimedia applications. Expand
Link Analysis, Eigenvectors and Stability
TLDR
This paper addresses the question of when HITS and PageRank can be expected to give stable rankings under small perturbations to the hyperlink patterns, using tools from matrix perturbation theory and Markov chain theory. Expand
Diffusion Kernels on Graphs and Other Discrete Input Spaces
TLDR
This paper proposes a general method of constructing natural families of kernels over discrete structures, based on the matrix exponentiation idea, and focuses on generating kernels on graphs, for which a special class of exponential kernels called diffusion kernels are proposed. Expand
Handwritten Digit Recognition with a Back-Propagation Network
TLDR
Minimal preprocessing of the data was required, but architecture of the network was highly constrained and specifically designed for the task, and has 1% error rate and about a 9% reject rate on zipcode digits provided by the U.S. Postal Service. Expand
A Database for Handwritten Text Recognition Research
  • J. Hull
  • Computer Science
  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1994
TLDR
An image database for handwritten text recognition research is described that contains digital images of approximately 5000 city names, 5000 state names, 10000 ZIP Codes, and 50000 alphanumeric characters to overcome the limitations of earlier databases. Expand
On the shortest spanning subtree of a graph and the traveling salesman problem
7. A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J.Expand
A very short survey on semi-supervised lear ning
  • Technical report,
  • 2002
A very short survey on semi-supervised learning
  • A very short survey on semi-supervised learning
  • 2002
...
1
2
...