Short proofs for online multiclass prediction on graphs
From MaRDI portal
Publication:991792
DOI10.1016/J.IPL.2010.02.008zbMATH Open1209.68366OpenAlexW1971132865MaRDI QIDQ991792FDOQ991792
Authors: Jittat Fakcharoenphol, Boonserm Kijsirikul
Publication date: 7 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.02.008
Recommendations
- Predicting a switching sequence of graph labelings
- The one-inclusion graph algorithm is near-optimal for the prediction model of learning
- scientific article; zbMATH DE number 1453050
- Exploiting Cluster-Structure to Predict the Labeling of a Graph
- New bounds on the price of bandit feedback for mistake-bounded online multiclass learning
Cites Work
Cited In (2)
This page was built for publication: Short proofs for online multiclass prediction on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991792)