The Computer Journal Advance Access first published online on October 9, 2007
This version published online on December 14, 2007
The Computer Journal, doi:10.1093/comjnl/bxm084
| ||||||||||||||||||||||||||||||||||||||||||||||||||
On Ultrametric Algorithmic Information
Department of Computer Science, Royal Holloway, University of London, Egham TW20 0EX, UK
* Corresponding author: fmurtagh{at}acm.org
Received 19 May 2007; revised 18 August 2007
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By giving an appropriate representation to our objects, based on a hierarchical coding of information, we exemplify how it is remarkably easy to compute complex objects. Our algorithmic complexity is related to the length of the class of objects, rather than to the length of the object.
Key Words: Data mining multivariate data analysis hierarchical clustering compression information entropy wavelet transform computability topology ultrametric
The original version was incorrect. The display of numbers on pages 7 and 9 were not correclty displayed; reference 5 had an incorrect title and page span.