Part of Advances in Neural Information Processing Systems 21 (NIPS 2008)

*Mark Herbster, Guy Lever, Massimiliano Pontil*

Current on-line learning algorithms for predicting the labelling of a graph have an important limitation in the case of large diameter graphs; the number of mistakes made by such algorithms may be proportional to the square root of the number of vertices, even when tackling simple problems. We overcome this problem with an efficient algorithm which achieves a logarithmic mistake bound. Furthermore, current algorithms are optimised for data which exhibits cluster-structure; we give an additional algorithm which performs well locally in the presence of cluster structure and on large diameter graphs.

Do not remove: This comment is monitored to verify that the site is working properly