The normalized compression distance is resistant to noise

IEEE Transactions on Information Theory

Volumn 53, Issue 5, 2007, Pages 1895-1900

  Cebrián, Manuel ^a   Alfonseca, Manuel ^a   Ortega, Alfonso ^a  

^a UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

Author keywords

Clustering and noise resistance; Datafile corruption; Heterogeneous data analysis; Kolmogorov complexity; Noisy channel; Normalized compression distance; Universal similarity distance

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA REDUCTION; DIFFERENTIAL EQUATIONS;

DATAFILE CORRUPTION; HETEROGENEOUS DATA ANALYSIS; KOLMOGOROV COMPLEXITY; NORMALIZED COMPRESSION DISTANCE; UNIVERSAL SIMILARITY DISTANCE;

DATA COMPRESSION;

EID: 34248374466     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.894669     Document Type: Article

References (8)

1. Yale Face Database [Online]. Available: http://cvc.yale.edu/projects/ yalefaces/yalefaces.html
2. C. Bennett, P. Gacs, M. Li, P. Vitanyi, and W. Zurek, "Information distance," IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1407-1423, Jul. 1998.
3. R. Cilibrasi, A. L. Cruz, and S. de Rooijet, The CompLearn Toolkit [Online]. Available: http://www.complearn.org software available at
4. R. Cilibrasi and P. Vitanyi, "Clustering by compression," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1523-1545, Apr. 2005.
5. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
6. M. Hart, The Gutemberb Project [Online]. Available: http:// www.gutenberg.org free electronic books available at
7. M. Li, X. Chen, X. Li, B. Ma, and P. Vitányi, "The similarity metric," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3250-3264, Dec. 2004.
8. M. Li and P. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications. New York: Springer-Verlag, 1997.