Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 DetailsÜbersicht
  Graph Based Semi-Supervised Learning with Sharper Edges

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.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-D047-A Versions-Permalink: https://hdl.handle.net/21.11116/0000-0004-99C2-4
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:
ausblenden:
externe Referenz:
https://link.springer.com/content/pdf/10.1007%2F11871842_39.pdf (Verlagsversion)
Beschreibung:
-
OA-Status:
Keine Angabe

Urheber

einblenden:
ausblenden:
 Urheber:
Shin, H1, Autor           
Hill, NJ2, 3, Autor           
Rätsch, G1, Autor           
Affiliations:
1Friedrich Miescher Laboratory, Max Planck Society, Max-Planck-Ring 9, 72076 Tübingen, DE, ou_2575692              
2Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
3Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2006-09
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: DOI: 10.1007/11871842_39
BibTex Citekey: 4165
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 17th European Conference on Machine Learning (ECML 2006)
Veranstaltungsort: Berlin, Germany
Start-/Enddatum: 2006-09-18 - 2006-09-22

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Machine Learning: ECML 2006: 17th European Conference on Machine Learning Berlin, Germany, September 18-22, 2006
Genre der Quelle: Konferenzband
 Urheber:
Fürnkranz, J, Herausgeber
Scheffer, T, Herausgeber
Spiliopoulou, M, Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Berlin, Germany : Springer
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 401 - 412 Identifikator: ISBN: 978-3-540-45375-8

Quelle 2

einblenden:
ausblenden:
Titel: Lecture Notes in Computer Science
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 4212 Artikelnummer: - Start- / Endseite: - Identifikator: -