Efficient algorithms for sequence segmentation

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 316-327

  Terzi, Evimaria ^a   Tsaparas, Panayiotis ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER PROGRAMMING; DATA MINING; DATA STORAGE EQUIPMENT; HEURISTIC METHODS; PROBLEM SOLVING;

CONSTANT-FACTOR APPROXIMATION ALGORITHM; QUADRATIC ALGORITHMS; SEQUENCE SEGMENTATION; STREAM SETTING;

IMAGE SEGMENTATION;

EID: 33745477829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.28     Document Type: Conference Paper

References (18)

1. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-medians and related problems. In STOC, pages 106-113, 1998.
2. V. Arya, N. Garg, R. Khandekar, K. Munagala, and V. Pandit. Local search heuristic for k-median and facility location problems. In STOC, pages 21-29. ACM Press, 2001.
3. R. Bellman. On the approximation of curves by line segments using dynamic programming. Communications of the ACM, 4(6), 1961.
4. P. Bernaola-Galvan, R. R.-R. R, and J. Oliver. Compositional segmentation and long-range fractal correlations in dna sequences. Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics, 53(5):5181-5189, 1996.
5. H. J. Bussemaker, H. Li, and E. D. Siggia. Regulatory element detection using a probabilistic segmentation model. In ISMB, pages 67-74, 2000.
6. D. Douglas and T. Peucker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canadian Cartographer, 10(2): 112-122, 1973.
7. A. Gionis and H. Mannila. Finding recurrent sources in sequences. In RECOMB, pages 115-122, Berlin, Germany, 2003.
8. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In STOC, pages 471-475, 2001.
9. N. Haiminen and A. Gionis. Unimodal segmentation of sequences. In ICDM, pages 106-113, 2004.
10. J. Himberg, K. Korpiaho, H. Mannila, J. Tikanmäki, and H. Toivonen. Time series segmentation for context recognition in mobile devices. In ICDM, pages 203-210, 2001.
11. E. Keogh, S. Chu, D. Hart, and M. Pazzani. An online algorithm for segmenting time series. In ICDM, pages 289-296, 2001.
12. E. Keogh and T. Folias. The UCR time series data mining archive, 2002.
13. A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1+ε) -approximation algorithm for k-means clustering in any dimensions. In FOCS, pages 454-462, 2004.
14. V. Lavrenko, M. Schmill, D. Lawrie, P. Ogilvie, D. Jensen, and J. Allan. Mining concurrent text and time series. In In proceedings of the 6th ACM SIGKDD Int'l Conference on Knowledge Discovery and Data Mining Workshop on Text Mining, pages 37-14, 2000.
15. W. Li. DNA segmentation as a model selection process. In RECOMB, pages 204-210, 2001.
16. T. Palpanas, M. Vlachos, E. J. Keogh, D. Gunopulos, and W. Truppel. Online amnesic approximation of streaming time series. In ICDE, pages 338-349, 2004.
17. M. Salmenkivi, J. Kere, and H. Mannila. Genome segmentation using piecewise constant intensity models and reversible jump MCMC. In ECCB, pages 211-218, 2002.
18. H. Shatkay and S. B. Zdonik. Approximate queries and representations for large data sequences. In ICDE '96: Proceedings of the Twelfth International Conference on Data Engineering, pages 536-545, 1996.