68 search results - page 8 / 14 » Quantizing Time Series for Efficient Subsequence Matching |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
CIVR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Video databases require that clips are represented in a compact and discriminative way, in order to perform efficient matching and retrieval of documents of interest. We ...
EVOW
2009
Springer
13 years 11 months ago
2009
Springer
In this paper the node-level decision unit of a self-learning anomaly detection mechanism for office monitoring with wireless sensor nodes is presented. The node-level decision uni...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
BMCBI
2007
13 years 7 months ago
2007
Background: Causal networks based on the vector autoregressive (VAR) process are a promising statistical tool for modeling regulatory interactions in a cell. However, learning the...