[PDF][PDF] Fuzzy Longest Common Subsequence Matching With FCM

I Ozkan, IB Türkşen - CoRR, 2015 - researchgate.net
Capturing the interdependencies between real valued time series can be achieved by
finding common similar patterns. The abstraction of time series makes the process of finding
similarities closer to the way as humans do. Therefore, the abstraction by means of a
symbolic levels and finding the common patterns attracts researchers. One particular
algorithm, Longest Common Subsequence, has been used successfully as a similarity
measure between two sequences including real valued time series. In this paper, we …

Fuzzy longest common subsequence matching with FCM using R

I Ozkan, IB Turksen - arXiv preprint arXiv:1508.03671, 2015 - arxiv.org
Capturing the interdependencies between real valued time series can be achieved by
finding common similar patterns. The abstraction of time series makes the process of finding
similarities closer to the way as humans do. Therefore, the abstraction by means of a
symbolic levels and finding the common patterns attracts researchers. One particular
algorithm, Longest Common Subsequence, has been used successfully as a similarity
measure between two sequences including real valued time series. In this paper, we …
Showing the best results for this search. See all results