Random spanning trees and the prediction of weighted graphs

MaRDI QIDQ2933839zbMATH OpenFDO

Authors Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella

Publication date 8 December 2014

Full work available at URL https://arxiv.org/abs/1212.5637, http://jmlr.csail.mit.edu/papers/v14/cesa-bianchi13a.html

zbMATH Keywords

graph predictionlearning on graphsonline learningrandom spanning trees

Mathematics Subject Classification ID

Trees (05C05) Signed and weighted graphs (05C22) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On an Online Spanning Tree Problem in Randomly Weighted Graphs
• Predicting a switching sequence of graph labelings
• Non-uniform random spanning trees on weighted graphs
• Predicting the labels of an unknown graph via adaptive exploration
• Sampling random spanning trees faster than matrix multiplication

Cited in

(8)

• Active exploration for large graphs
• Actively learning to infer social ties
• Synergy of multi-label hierarchical ensembles, data fusion, and cost-sensitive methods for gene functional inference
• The DFS fused Lasso: linear-time denoising over general graphs
• Active nearest-neighbor learning in metric spaces
• Using machine learning for decreasing state uncertainty in planning
• Predicting a switching sequence of graph labelings
• Quantum speedup for sampling random spanning trees

This page was built for publication: Random spanning trees and the prediction of weighted graphs

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