Model-based search in large time series databases

ACM International Conference Proceeding Series

Volumn , Issue , 2011, Pages

  Kotsifakos, Alexios ^a   Athitsos, Vassilis ^b   Papapetrou, Panagiotis ^c,d   Hollmén, Jaakko ^c,d   Gunopulos, Dimitrios ^a  

^a UNIVERSITY OF ATHENS   (Greece)

^b University of Texas at Arlington   (United States)

^c AALTO UNIVERSITY   (Finland)

^d HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Dynamic time warping; Hidden Markov models; Time series

Indexed keywords

DATABASE SYSTEMS; LARGE DATASET; TIME SERIES;

COMPARATIVE EVALUATIONS; DYNAMIC TIME WARPING; GENERATIVE MODEL; HIDDEN MARKOV MODELS (HMMS); LARGE TIME SERIES DATABASE; MODEL BASED APPROACH; MODEL-BASED SEARCH; TRAINING OBJECTS;

HIDDEN MARKOV MODELS;

EID: 84858033938     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2141622.2141666     Document Type: Conference Paper

References (16)

1. L. E. Baum, T. Petrie, G. Soules, and N. Weiss. A maximization technique occurring in the statistical analysis of probabilistic functions of markov chains. The Annals of Mathematical Statistics, 41(1):164.-171, 1970.
2. D. Berndt and J. Clifford. Using dynamic time warping to find patterns in time series. In AAAI-94 workshop on knowledge discovery in databases, pages 229.-248, 1994.
3. L. Chen and R. Ng. On the marriage of lp-norms and edit distance. In VLDB, pages 792.-803, 2004.
4. L. Chen and M. T. zsu. Robust and fast similarity search for moving object trajectories. In SIGMOD, pages 491.-502, 2005. (Pubitemid 43038952)
5. G. Forney Jr. The viterbi algorithm. Proceedings of the IEEE, 61(3):268.-278, 1973.
6. E. Keogh. Exact indexing of dynamic time warping. In VLDB, pages 406.-417, 2002.
7. E. Keogh, X. Xi, L. Wei, and C. A. Ratanamahatana. The UCR time series classification/clustering homepagehttp://www.cs.ucr.edu/.̃eamonn/ timeseriesdata/, 2006.
8. J. B. Kruskall and M. Liberman. The symmetric time warping algorithm: From continuous to discrete. In Time Warps. Addison-Wesley, 1983.
9. J. D. Lafferty, A. McCallum, and F. C. N. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In International Conference on Machine Learning (ICML), pages 282.-289, 2001.
10. S. Levinson, L. Rabiner, and M. Sondhi. An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition. The Bell System Technical Journal, 62(4):1035.-1074, 1983. (Pubitemid 13544158)
11. B. Pardo, J. Shifrin, and W. Birmingham. Name that tune: A pilot study in finding a melody from a sung query. Journal of the American Society for Information Science and Technology, 55(4):283.-300, 2004.
12. A. Pikrakis, S. Theodoridis, and D. Kamarotos. Classification of musical patterns using variable duration hidden Markov models. Transactions on Audio, Speech, and Language Processing, 14(5):1795.-1807, 2006. (Pubitemid 46547599)
13. L. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257.-286, 1989.
14. H. Sakoe and S. Chiba. Dynamic programming algorithm optimization for spoken word recognition. Transactions on ASSP, 26:43.-49, 1978. (Pubitemid 8601900)
15. E. Unal, E. Chew, P. Georgiou, and S. Narayanan. Challenging uncertainty in query by humming systems: a fingerprinting approach. Transactions on Audio Speech and Language Processing, 16(2):359.-371, 2008.
16. S. B. Wang, A. Quattoni, L.-P. Morency, D. Demirdjian, and T. Darrell. Hidden conditional random fields for gesture recognition. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), volume 2, pages 1521.-1527, 2006. (Pubitemid 44931500)