Abstract
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another definition, which might have better properties. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
APA
Vereshchagin, N. (2009). Algorithmic minimal sufficient statistic revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 478–487). https://doi.org/10.1007/978-3-642-03073-4_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free