Sciweavers

14 search results - page 1 / 3
» Algorithmic Minimal Sufficient Statistic Revisited
Sort
View
CIE
2009
Springer
13 years 8 months ago
Algorithmic Minimal Sufficient Statistic Revisited
Abstract. We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose anoth...
Nikolay K. Vereshchagin
ECCC
2010
107views more  ECCC 2010»
13 years 4 months ago
{Algorithmic Minimal Sufficient Statistics: a New Definition
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another defini...
Nikolay K. Vereshchagin
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
13 years 8 months ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 4 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
ARCS
2006
Springer
13 years 8 months ago
Safety, Liveness, and Information Flow: Dependability Revisited
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...
Zinaida Benenson, Felix C. Freiling, Thorsten Holz...