Predicting a switching sequence of graph labelings

MaRDI QIDQ5744829zbMATH OpenFDO

Authors Mark Herbster, Stephen Pasteris, Massimiliano Pontil

Publication date 19 February 2016

Full work available at URL http://jmlr.csail.mit.edu/papers/v16/herbster15a.html

zbMATH Keywords

kernel methodsmatrix winnowonline learning over graphsswitching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Predicting the labels of an unknown graph via adaptive exploration
• Random spanning trees and the prediction of weighted graphs
• Short proofs for online multiclass prediction on graphs
• Learning unknown graphs
• Exploiting Cluster-Structure to Predict the Labeling of a Graph

Cited in

(6)

• On the theory of dynamic graph regression problem
• Sublinear update time randomized algorithms for dynamic graph regression
• Predicting the labels of an unknown graph via adaptive exploration
• Random spanning trees and the prediction of weighted graphs
• Exploiting Cluster-Structure to Predict the Labeling of a Graph
• Short proofs for online multiclass prediction on graphs

This page was built for publication: Predicting a switching sequence of graph labelings

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