Graph-Based Transduction with Confidence
Abstract
We present a new multi-class graph-based transduction algorithm. Examples are associated with vertices in an undirected weighted graph and edge weights correspond to a similarity measure between examples. Typical algorithms in such a setting perform label propagation between neighbours, ignoring the quality, or estimated quality, in the labeling of various nodes. We introduce an additional quantity of confidence in label assignments, and learn them jointly with the weights, while using them to dynamically tune the influence of each vertex on its neighbours. We cast learning as a convex optimization problem, and derive an efficient iterative algorithm for solving it. Empirical evaluations on seven NLP data sets demonstrate our algorithm improves over other state-of-the-art graph-based transduction algorithms.
Cite
Text
Orbach and Crammer. "Graph-Based Transduction with Confidence." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2012. doi:10.1007/978-3-642-33486-3_21Markdown
[Orbach and Crammer. "Graph-Based Transduction with Confidence." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2012.](https://mlanthology.org/ecmlpkdd/2012/orbach2012ecmlpkdd-graphbased/) doi:10.1007/978-3-642-33486-3_21BibTeX
@inproceedings{orbach2012ecmlpkdd-graphbased,
title = {{Graph-Based Transduction with Confidence}},
author = {Orbach, Matan and Crammer, Koby},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2012},
pages = {323-338},
doi = {10.1007/978-3-642-33486-3_21},
url = {https://mlanthology.org/ecmlpkdd/2012/orbach2012ecmlpkdd-graphbased/}
}