Sciweavers

32 search results - page 1 / 7
» On data mining, compression, and Kolmogorov complexity
Sort
View
DATAMINE
2007
108views more  DATAMINE 2007»
13 years 4 months ago
On data mining, compression, and Kolmogorov complexity
Christos Faloutsos, Vasileios Megalooikonomou
ICALP
2007
Springer
13 years 11 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 4 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
DAGSTUHL
2006
13 years 6 months ago
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence fo
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
14 years 5 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...