Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency
Published in arXiv (Cornell University) • Jun 12, 2012
NobleIDNI8P35W05R80S36
Authors:,,
David Novák
Petr Volný
Pavel Zezula
Abstract
Subsequence matching has appeared to be an ideal approach for solving many problems related to the fields of data mining and similarity retrieval. It has been shown that almost any data class (audio, image, biometrics, signals) is or can be represented by some kind of time series or string of symbol...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!