Similarity search over stream time series has a wide spectrum of applications. Most previous work in static time-series databases and stream time series aim at retrieving the exact answer to a similarity search. However, little work considers the approximate similarity search in stream time series. In this paper, we propose a weighted locality-sensitive hashing (WLSH) technique, which is adaptive to characteristics of stream data, to answer approximate similarity search over stream time series. Due to the unique requirement of stream processing, we present an efficient method to update hash functions adaptive to stream data and maintain hash files incrementally at a low cost. Extensive experiments demonstrate the effectiveness of WLSH, as well as the efficiency of approximate similarity search via hashing on stream time series. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Lian, X., Chen, L., & Wang, B. (2007). Approximate similarity search over multiple stream time series. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4443 LNCS, pp. 962–968). Springer Verlag. https://doi.org/10.1007/978-3-540-71703-4_86
Mendeley helps you to discover research relevant for your work.