Data Mining and Knowledge Discovery

, Volume 14, Issue 1, pp 99–129

Compression-based data mining of sequential data


    • Department of Computer Science and EngineeringUniversity of California
  • Stefano Lonardi
    • Department of Computer Science and EngineeringUniversity of California
  • Chotirat Ann Ratanamahatana
    • Department of Computer EngineeringChulalongkorn University
  • Li Wei
    • Department of Computer Science and EngineeringUniversity of California
  • Sang-Hee Lee
    • Department of AnthropologyUniversity of California
  • John Handley
    • Xerox Innovation Group, Xerox Corporation

DOI: 10.1007/s10618-006-0049-3

Cite this article as:
Keogh, E., Lonardi, S., Ratanamahatana, C.A. et al. Data Min Knowl Disc (2007) 14: 99. doi:10.1007/s10618-006-0049-3


The vast majority of data mining algorithms require the setting of many input parameters. The dangers of working with parameter-laden algorithms are twofold. First, incorrect settings may cause an algorithm to fail in finding the true patterns. Second, a perhaps more insidious problem is that the algorithm may report spurious patterns that do not really exist, or greatly overestimate the significance of the reported patterns. This is especially likely when the user fails to understand the role of parameters in the data mining process. Data mining algorithms should have as few parameters as possible. A parameter-light algorithm would limit our ability to impose our prejudices, expectations, and presumptions on the problem at hand, and would let the data itself speak to us. In this work, we show that recent results in bioinformatics, learning, and computational theory hold great promise for a parameter-light data-mining paradigm. The results are strongly connected to Kolmogorov complexity theory. However, as a practical matter, they can be implemented using any off-the-shelf compression algorithm with the addition of just a dozen lines of code. We will show that this approach is competitive or superior to many of the state-of-the-art approaches in anomaly/interestingness detection, classification, and clustering with empirical tests on time series/DNA/text/XML/video datasets. As a further evidence of the advantages of our method, we will demonstrate its effectiveness to solve a real world classification problem in recommending printing services and products.


Kolmogorov complexityParameter-free data miningAnomaly detectionClustering

Copyright information

© Springer Science+Business Media, LLC 2007