Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Prediction algorithms and confidence measures based on algorithmic randomness theory.

From MaRDI portal
Publication:1853465
Jump to:navigation, search

DOI10.1016/S0304-3975(02)00100-7zbMath1061.68126OpenAlexW2018127993WikidataQ62666528 ScholiaQ62666528MaRDI QIDQ1853465

Volodya Vovk, Alexander Gammerman

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00100-7

zbMATH Keywords

Machine learningRandomnessConfidenceTransduction


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)


Related Items

Learning model trees from evolving data streams, Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1853465&oldid=14238274"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki