Berndt D. J.

Bertin-Mahieux T.

Ciaccia P.

Clarkson K. L.

Han W.-S.

Kim M.-S.

Krauthgamer R.

Levenshtein V. I.

Li C.

Litwin W.

Moon Y.-S.

Venkateswaran J.

Yianilos P. N.

English


            This paper proposes a general framework for matching similar subsequences in both time series and string databases. The matching results are pairs of query subsequences and database subsequences. The framework finds all possible pairs of similar subsequences if the distance measure satisfies the "consistency" property, which is a property introduced in this paper. We show that most popular distance functions, such as the Euclidean distance, DTW, ERP, the Frechét distance for time series, and the Hamming distance and Levenshtein distance for strings, are all "consistent". We also propose a generic index structure for metric spaces named "reference net". The reference net occupies
            O
            (
            n
            ) space, where
            n
            is the size of the dataset and is optimized to work well with our framework. The experiments demonstrate the ability of our method to improve retrieval performance when combined with diverse distance measures. The experiments also illustrate that the reference net scales well in terms of space overhead and query time.
          </jats:p

A generic framework for efficient and effective subsequence retrieval

Abstract

Similar works

Full text

Available Versions

Crossref