An Empirical Study on Budget-Aware Online Kernel Algorithms for Streams of Graphs.

Giovanni Da San Martino Nicolò Navarin Alessandro Sperduti

Published in: CoRR (2015)

Keyphrases

graph theory
computational cost
computational complexity
significant improvement
online learning
real time
learning algorithm
theoretical analysis
graph embedding
support vector
worst case
computationally efficient
graph theoretic
limited memory
online algorithms
graph properties