Short proofs for online multiclass prediction on graphs

Authors:
Jittat Fakcharoenphol;Boonserm Kijsirikul
Affiliations:
Department of Computer Engineering, Kasetsart University, Bangkok 10900, Thailand;Department of Computer Engineering, Chulalongkorn University, Bangkok 10330, Thailand
Venue:
Information Processing Letters
Year:
2010

Citing 2
Cited 0

Online learning over graphs

ICML '05 Proceedings of the 22nd international conference on Machine learning
Simple distributed algorithms for approximating minimum steiner trees

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present short proofs on the mistake bounds of the 1-nearest neighbor algorithm on an online prediction problem of path labels. The algorithm is one of key ingredients in the algorithm by Herbster, Lever, and Pontil for general graphs. Our proofs are combinatorial and naturally show that the algorithm works when the set of labels is not binary.