Graph Based Semi-Supervised Learning with Sharper Edges

Shin, H; Hill, NJ; Rätsch, G

doi:10.1007/11871842_39

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Graph Based Semi-Supervised Learning with Sharper Edges

MPS-Authors

/persons/resource/persons83968

Hill, NJ
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

https://link.springer.com/content/pdf/10.1007%2F11871842_39.pdf
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Shin, H., Hill, N., & Rätsch, G. (2006). Graph Based Semi-Supervised Learning with Sharper Edges. In J. Fürnkranz, T. Scheffer, & M. Spiliopoulou (Eds.), Machine Learning: ECML 2006: 17th European Conference on Machine Learning Berlin, Germany, September 18-22, 2006 (pp. 401-412). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-D047-A

Abstract

In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data pointsamp;amp;amp;amp;lsquo; (often symmetric)relationships in input space, without considering directionality.
However, relationships may be more informative in one direction (e.g. from labelled to unlabelled) than in the reverse direction, and some
relationships (e.g. strong weights between oppositely labelled points) are unhelpful in either direction. Undesirable edges may reduce the amount of influence an informative point can propagate to its neighbours -- the point and its outgoing edges have been ``blunted.amp;amp;amp;amp;lsquo;amp;amp;amp;amp;lsquo; We present an approach to ``sharpeningamp;amp;amp;amp;lsquo;amp;amp;amp;amp;lsquo; in which weights are adjusted to meet an optimization criterion
wherever they are directed towards labelled points. This principle can be applied to a wide variety of algorithms. In the current paper, we present one ad hoc solution satisfying the principle, in order to show that it can improve performance on a number of publicly available benchmark data sets.