Data compression and learning in time sequences analysis (Q1870470): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4346204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure of relative entropy between individual sequences with application to universal classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of Shannon theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Symbolic Dynamics and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical systems and computable information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictability: a way to characterize complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using literal and grammatical statistics for authorship attribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new challenge for compression algorithms: Genetic sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3260837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy of the Lempel-Ziv string matching code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Information and Sufficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3260839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A diffusion limit for a class of randomly-growing binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average profile of the Lempel-Ziv parsing scheme for a Markovian source / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of random matrices in statistical physics / rank
 
Normal rank

Latest revision as of 16:14, 5 June 2024

scientific article
Language Label Description Also known as
English
Data compression and learning in time sequences analysis
scientific article

    Statements

    Data compression and learning in time sequences analysis (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 May 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    scaling function
    0 references
    cross-over length
    0 references
    relative entropy
    0 references
    0 references