An Efficient Subsequence Matching Method Based on Index Interpolation
نویسندگان
چکیده
منابع مشابه
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data space using different metrics. However, searching high-dimensional spaces using a hierarchical index is not always efficient because a large portion of the index might need to be accessed during search. We have revisit...
متن کاملAn Index-Based Method for Timestamped Event Sequence Matching
This paper addresses the problem of timestamped event sequence matching, a new type of sequence matching that retrieves the occurrences of interesting patterns from a timestamped event sequence. Timestamped event sequence matching is useful for discovering temporal causal relationships among timestamped events. In this paper, we first point out the shortcomings of prior approaches to this probl...
متن کاملMETA: An Efficient Matching-Based Method for Error-Tolerant Autocompletion
Autocompletion has been widely adopted in many computing systems because it can instantly provide users with results as users type in queries. Since the typing task is tedious and prone to error, especially on mobile devices, a recent trend is to tolerate errors in autocompletion. Existing error-tolerant autocompletion methods build a trie to index the data, utilize the trie index to compute th...
متن کاملAn Efficient Region Matching Method for Content-based Image Retrieval
Content-based image retrieval, which provides convenient ways to retrieve images from large image databases, has been studied actively. However, many previous image retrieval techniques do not look at regions in an image. In this paper, we present a novel region matching method for contentbased image retrieval. In this method, the region dependences in each image are first computed in order to ...
متن کاملMusic Matching Based on Rough Longest Common Subsequence
In this paper we proposed a music matching method, called the RLCS (rough longest common subsequence) method. It is an improved version of the LCS to avoid some problems occurring in global alignment matching. First a rough equality for two notes is defined for constructing the RLCS of two music fragments. The length of the RLCS of two music sequences defined in this work is a real number, call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartD
سال: 2005
ISSN: 1598-2866
DOI: 10.3745/kipstd.2005.12d.3.345