Towards parameter-free data mining

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 206-215

  Keogh, Eamonn ^a   Lonardi, Stefano ^a   Ratanamahatana, Chotirat Ann ^a  

^a University of California Riverside   (United States)

Author keywords

Anomaly Detection; Clustering; Parameter Free Data Mining

Indexed keywords

ALGORITHMS; BIOMEDICAL ENGINEERING; CODES (SYMBOLS); COMPUTATION THEORY; DATABASE SYSTEMS; DNA; TIME SERIES ANALYSIS;

ANOMALY DETECTION; CLUSTERING; DATA MINING ALGORITHM; PARAMETER-FREE DATA MINING;

DATA MINING;

EID: 10644281769     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014077     Document Type: Conference Paper

References (36)

1. Allison, L., Stern, L., Edgoose, T., Dix, T.I. Sequence Complexity for Biological Sequence Analysis. Computers & Chemistry 24(1): 43-55 (2000)
2. Benedetto, D., Caglioti, E., & Loreto, V. Language trees and zipping. Physical Review Letters 88, 048702, (2002).
3. Chen, X., Kwong, S., & Li, M. A compression algorithm for DNA sequences and its applications in genome comparison. In Proceedings of RECOMB 2000: 107
4. Dasgupta, D. & Forrest, S. Novelty Detection in Time Series Data using Ideas from Immunology." In Proc. of the International Conference on Intelligent Systems (1999).
5. Domingos, P. A process-oriented heuristic for model selection. In Machine Learning Proceedings of the Fifteenth International Conference, pages 127-135. San Francisco, CA, 1998.
6. Elkan, C. Using the triangle inequality to accelerate k-Means. In Proc. of ICML 2003. pp 147-153
7. Elkan, C. Magical thinking in data mining: lessons from CoIL challenge 2000. SIGKDD, 2001. pp 426-431.
8. Ergün, F., Muthukrishnan, S., & Sahinalp, S.C. Comparing Sequences with Segment Rearrangements. FSTTCS 2003:
9. Faloutsos, C., & Lin, K. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proc of 24th ACM SIGMOD, 1995.
10. Farach, M., Noordewier, M., Savari, S., Shepp, L., Wyner, A., & Ziv, J. On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence, Proc. of the Symp. on Discrete Algorithms, 1995. pp 48-57.
11. Flexer, A. Statistical evaluation of neural networks experiments: Minimum requirements and current practice. In Proc. of the 13th European Meeting on Cybernetics and Systems Research, vol. 2, pp 1005-1008, Austria, 1996
12. Gatlin, L. Information Theory and the Living Systems. Columbia University Press, 1972.
13. Gavrilov, M., Anguelov, D., Indyk, P., Motwahl, R. Mining the stock market: which measure is best? Proc. of the 6th ACM SIGKDD, 2000
14. Ge, X. & Smyth, P. Deformable Markov model templates for time-series pattern matching. In proceedings of the 6th ACM SIGKDD. Boston, MA, Aug 20-23, 2000. pp 81-90.
15. Goldberger, A.L., Amaral, L., Glass, L, Hausdorff, J.M., Ivanov, P.Ch., Mark, R.G., Mietus, J.E., Moody, G.B., Peng, C.K., Stanley, H.E. PhysioBank, PhysioToolkit, and PhysioNet: Circulation 101(23):e215-e220
16. Goodman, J. Comment on "Language Trees and Zipping", unpublished manuscript, 2002 (available at [http://research.microsoft.com/ ~joshuago/].
17. Kalpakis, K., Gada, D., & Puttagunta, V. Distance measures for effective clustering of ARIMA time-series. In proc. of the IEEE ICDM, 2001. San Jose, CA. pp 273-280.
18. Keogh, E. http://www.cs.ucr.edu/~eamonn/SIGKDD2004.
19. Keogh, E. & Folias, T. The UCR Time Series Data Mining Archive. Riverside CA. 2002. [http://www.cs.ucr.edu/~eamonn/TSDMA/index.html].
20. Keogh, E. & Kasetty, S. On the need for time series data mining benchmarks: A survey and empirical demonstration. In Proc. of SIGKDD, 2002.
21. Keogh, E., Lin, J., & Truppel, W. Clustering of Time Series Subsequences is Meaningless: Implications for Past and Future Research. In proc. of the 3rd IEEE ICDM, 2003. Melbourne, FL. Nov 19-22, 2003. pp 115-122.
22. Li, M., Badger, J.H., Chen, X., Kwong, S, Kearney, P., & Zhang, H. An information-based sequence distance and its application to whole mitochondrial genome phytogeny. Bioinformatics 17: 149-154, 2001.
23. Li, M., Chen, X., Li, X., Ma, B., Vitanyi, P. The similarity metric. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, 2003. Pages: 863-872
24. Li, M. & Vitanyi, P. An Introduction to Kolmogorov Complexity and Its Applications. Second Edition, Springer Verlag, 1997.
25. Lin, J., Keogh, E., Lonardi, S. & Chiu, B. A Symbolic Representation of Time Series, with Implications for Streaming Algorithms. In proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. San Diego, CA. June 13, 2003
26. Loewenstern, D., Hirsh, H., Yianilos, P., & Noordewier, M. DNA Sequence Classification using Compression-Based Induction, DIMACS Technical Report 95-04, April 1995.
27. Loewenstern, D., & Yianilos, P.N. Significantly lower entropy estimates for natural DNA sequences, Journal of Computational Biology, 6(1), 1999.
28. Ma, J. & Perkins, S. Online Novelty Detection on Temporal Sequences. Proc. International Conference on Knowledge Discovery and Data Mining, August 24-27, 2003.
29. Quinlan, J.R. & Rivest, R.L. Inferring Decision Trees Using the Minimum Description Length Principle. Information and Computation, 80:227-248, 1989.
30. Ratanamahatana, C.A. & Keogh, E. Making Time-series Classification More Accurate Using Learned Constraints. In proceedings of SIAM International Conference on Data Mining (SDM'04), Lake Buena Vista, Florida, April 22-24, 2004.
31. Rissanen, J. Modeling by shortest data description. Automatica, vol. 14 (1978), pp. 465-471.
32. Salzberg, S.L. On comparing classifiers: Pitfalls to avoid and a recommended approach. Data Mining and Knowledge Discovery, 1(3), 1997.
33. Shahabi, C., Tian, X., & Zhao, W. TSA-tree: A Wavelet-Based Approach to Improve the Efficiency of Multi-Level Surprise and Trend Queries The 12th Int'l Conf on Scientific and Statistical Database Management (SSDBM 2000)
34. Vlachos, M., Hadjieleftheriou, M., Gunopulos, D. & Keogh. E. Indexing Multi-Dimensional Time-Series with Support for Multiple Distance Measures. In the 9th ACM SIGKDD. August 24-27, 2003. Washington, DC, USA. pp 216-225.
35. Wang, C. & Wang, X. S. Supporting content-based searches on time series via approximation. In proceedings of the 12th Int'l Conference on Scientific and Statistical Database Management. Berlin, Germany, Jul 26-28, 2000. pp 69-81.
36. Yairi, T., Kato, Y., & Hori, K. Fault Detection by Mining Association Rules from House-keeping Data, Proc. of Int'l Sym. on AI, Robotics and Automation in Space, 2001.