Random spanning trees and the prediction of weighted graphs

zbMATH Open1317.68146arXiv1212.5637MaRDI QIDQ2933839FDOQ2933839

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

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

zbMATH Keywords

online learningrandom spanning treesgraph predictionlearning on graphs

Mathematics Subject Classification ID

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

Cited In (7)

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

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)