On the choice of kernel and labelled data in semi-supervised learning methods

DOI10.1007/978-3-319-03536-9_5MaRDI QIDQ2938013zbMATH OpenOpenAlexFDO

Authors

Publication date 13 January 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03536-9_5

zbMATH Keywords

machine learning methodsP2P networkssemi-supervised learning methods

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On semi-supervised learning
• Semi-supervised learning with regularized Laplacian
• Graph-Based Semi-Supervised Learning and Spectral Kernel Design
• Generalization performance of graph-based semi-supervised classification
• Semi-supervised graph clustering: a kernel approach

Cited in

(8)

• An efficient kernel learning algorithm for semisupervised regression problems
• Similarities on graphs: kernels versus proximity measures
• Kernel-based transition probability toward similarity measure for semi-supervised learning
• On semi-supervised learning
• Graph-Based Semi-Supervised Learning and Spectral Kernel Design
• Statistical Clustering of a Random Network by Extremal Properties
• On tuning a mean-field model for semi-supervised classification
• Approximating single-source personalized pagerank with absolute error guarantees

This page was built for publication: On the choice of kernel and labelled data in semi-supervised learning methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938013)