title: Similarity and denoising.
abstract: We can discover the effective similarity among pairs of finite objects and denoise a finite object using the Kolmogorov complexity of these objects. The drawback is that the Kolmogorov complexity is not computable. If we approximate it, using a good real-world compressor, then it turns out that on natural data the processes give adequate results in practice. The methodology is parameter-free, alignment-free and works on individual data. We illustrate both methods with examples.
authors.affiliation: National Research Center for Mathematics and Computer Science in the Netherlands, Science Park 123, 1098XG Amsterdam, The Netherlands. paul.vitanyi@cwi.nl
authors.forename: Paul M B
authors.initials: PM
authors.lastname: Vitányi