文章基本信息

标题：{Algorithmic Minimal Sufficient Statistics: a New Definition
本地全文：下载
作者：Nikolay Vereshchagin
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2010
卷号：2010
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：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 has better properties.
关键词：algorithmic statistic, minimal sufficient statistic