Sciweavers

2463 search results - page 145 / 493
» Compressing Pattern Databases
Sort
View
SIGMOD
2010
ACM
144views Database» more  SIGMOD 2010»
15 years 6 months ago
Interactive visual exploration of neighbor-based patterns in data streams
We will demonstrate our system, called V iStream, supporting interactive visual exploration of neighbor-based patterns [7] in data streams. V istream does not only apply innovativ...
Di Yang, Zhenyu Guo, Zaixian Xie, Elke A. Rundenst...
SIGMOD
2006
ACM
137views Database» more  SIGMOD 2006»
16 years 2 months ago
Optimal multi-scale patterns in time series streams
We introduce a method to discover optimal local patterns, which concisely describe the main trends in a time series. Our approach examines the time series at multiple time scales ...
Spiros Papadimitriou, Philip S. Yu
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
16 years 2 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
DASFAA
2006
IEEE
126views Database» more  DASFAA 2006»
15 years 8 months ago
An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patterns
Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
Jia-Ling Koh, Yu-Ting Kung
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
15 years 6 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel