Partial Elastic Matching of Time Series

Houston, Texas November 27-November 30

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.118

Fifth IEEE International Conference o ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Longin Jan Latecki Articles by Vasileios Megalooikonomou Articles by Qiang Wang Articles by Rolf Lakaemper Articles by C. A. Ratanamahatana Articles by E. Keogh

	ASCII Text	x
	Longin Jan Latecki, Vasileios Megalooikonomou, Qiang Wang, Rolf Lakaemper, C. A. Ratanamahatana, E. Keogh, "Partial Elastic Matching of Time Series," Data Mining, IEEE International Conference on, pp. 701-704, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005.

	BibTex	x
	@article{ 10.1109/ICDM.2005.118, author = {Longin Jan Latecki and Vasileios Megalooikonomou and Qiang Wang and Rolf Lakaemper and C. A. Ratanamahatana and E. Keogh}, title = {Partial Elastic Matching of Time Series}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2005}, issn = {1550-4786}, pages = {701-704}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.118}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining, IEEE International Conference on TI - Partial Elastic Matching of Time Series SN - 1550-4786 SP701 EP704 A1 - Longin Jan Latecki, A1 - Vasileios Megalooikonomou, A1 - Qiang Wang, A1 - Rolf Lakaemper, A1 - C. A. Ratanamahatana, A1 - E. Keogh, PY - 2005 KW - null VL - 0 JA - Data Mining, IEEE International Conference on ER -

Longin Jan Latecki, Temple University

Vasileios Megalooikonomou, Temple University

Qiang Wang, Temple University

Rolf Lakaemper, Temple University

C. A. Ratanamahatana, University of California at Riverside

E. Keogh, University of California at Riverside

We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a DAG (directed acyclic graph). The proposed approach allows us to also compute the optimal scale and translation of time series values, which is a nontrivial problem in the case of subsequence matching.

Citation:

Longin Jan Latecki, Vasileios Megalooikonomou, Qiang Wang, Rolf Lakaemper, C. A. Ratanamahatana, E. Keogh, "Partial Elastic Matching of Time Series," icdm, pp.701-704, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.