Open AccessThis article is
- freely available
Algorithmic Relative Complexity
German Aerospace Centre (DLR), Münchnerstr. 20, 82234 Wessling, Germany
Télécom ParisTech, rue Barrault 20, Paris F-75634, France
* Author to whom correspondence should be addressed.
Received: 3 March 2011; in revised form: 31 March 2011 / Accepted: 1 April 2011 / Published: 19 April 2011
Abstract: Information content and compression are tightly related concepts that can be addressed through both classical and algorithmic information theories, on the basis of Shannon entropy and Kolmogorov complexity, respectively. The definition of several entities in Kolmogorov’s framework relies upon ideas from classical information theory, and these two approaches share many common traits. In this work, we expand the relations between these two frameworks by introducing algorithmic cross-complexity and relative complexity, counterparts of the cross-entropy and relative entropy (or Kullback-Leibler divergence) found in Shannon’s framework. We define the cross-complexity of an object x with respect to another object y as the amount of computational resources needed to specify x in terms of y, and the complexity of x related to y as the compression power which is lost when adopting such a description for x, compared to the shortest representation of x. Properties of analogous quantities in classical information theory hold for these new concepts. As these notions are incomputable, a suitable approximation based upon data compression is derived to enable the application to real data, yielding a divergence measure applicable to any pair of strings. Example applications are outlined, involving authorship attribution and satellite image classification, as well as a comparison to similar established techniques.
Keywords: Kolmogorov complexity; compression; relative entropy; Kullback-Leibler divergence; similarity measure; compression based distance
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Cerra, D.; Datcu, M. Algorithmic Relative Complexity. Entropy 2011, 13, 902-914.
Cerra D, Datcu M. Algorithmic Relative Complexity. Entropy. 2011; 13(4):902-914.
Cerra, Daniele; Datcu, Mihai. 2011. "Algorithmic Relative Complexity." Entropy 13, no. 4: 902-914.