Large Margin Classification Using the Perceptron Algorithm
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Linear hinge loss and average margin
Proceedings of the 1998 conference on Advances in neural information processing systems II
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Query Learning with Large Margin Classifiers
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Support Vector Machine Active Learning with Application sto Text Classification
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Semi-Supervised Learning on Riemannian Manifolds
Machine Learning
Repairing self-confident active-transductive learners using systematic exploration
Pattern Recognition Letters
Exploiting Cluster-Structure to Predict the Labeling of a Graph
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Classifying networked entities with modularity kernels
Proceedings of the 17th ACM conference on Information and knowledge management
Online learning by ellipsoid method
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Learning Representation and Control in Markov Decision Processes: New Frontiers
Foundations and Trends® in Machine Learning
Semi-supervised learning by mixed label propagation
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Online co-localization in indoor wireless networks by dimension reduction
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Transductive Rademacher complexity and its applications
Journal of Artificial Intelligence Research
Short proofs for online multiclass prediction on graphs
Information Processing Letters
Transductive rademacher complexity and its applications
COLT'07 Proceedings of the 20th annual conference on Learning theory
Linear Algorithms for Online Multitask Classification
The Journal of Machine Learning Research
Predicting the labels of an unknown graph via adaptive exploration
Theoretical Computer Science
Online learning with multiple kernels: A review
Neural Computation
Selective sampling on graphs for classification
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Random spanning trees and the prediction ofweighted graphs
The Journal of Machine Learning Research
| Hi-index | 0.00 |
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simple algorithms and performance guarantees that we naturally interpret in terms of structural properties of the graph, such as the algebraic connectivity or the diameter of the graph. We also discuss how these methods can be modified to allow active learning on a graph. We present preliminary experiments with encouraging results.