Temporal data mining using hidden Markov-local polynomial models

9Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This study proposes a data mining framework to discover qualitative and quantitative patterns in discrete-valued time series (DTS). In our method, there are three levels for mining similarity and periodicity patterns. At the first level, a structural-based search based on distance measure models is employed to find pattern structures; the second level performs a value-based search on the discovered patterns using local polynomial analysis; and then the third level based on hidden Markov-local polynomial models (HMLPMs), finds global patterns from a DTS set.We demonstrate our method on the analysis of "Exchange Rates Patterns" between the U.S. dollar and the United Kingdom Pound.

Cite

CITATION STYLE

APA

Lin, W., Orgun, M. A., & Williams, G. J. (2001). Temporal data mining using hidden Markov-local polynomial models. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2035, pp. 324–335). Springer Verlag. https://doi.org/10.1007/3-540-45357-1_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free