Classification of Markov Sources Through Joint String Complexity: Theory and Experiments - École polytechnique
Conference Papers Year : 2013

Classification of Markov Sources Through Joint String Complexity: Theory and Experiments

Abstract

We propose a classification test to discriminate Markov sources based on the joint string complexity. String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we define the joint string complexity as the cardinality of the set of words which both strings have in common. In this paper we analyze the average joint complexity when both strings are generated by two Markov sources. We provide fast converging asymptotic expansions and present some experimental results showing usefulness of the joint complexity to text discrimination.
No file

Dates and versions

hal-00904144 , version 1 (13-11-2013)

Identifiers

  • HAL Id : hal-00904144 , version 1

Cite

Philippe Jacquet, Dimitrios Milioris, Wojciech Szpankowski. Classification of Markov Sources Through Joint String Complexity: Theory and Experiments. IEEE International Symposium on Information Theory, Jul 2013, Istanbul, Turkey. ⟨hal-00904144⟩
402 View
0 Download

Share

More