Sciweavers

376 search results - page 19 / 76
» Efficient Indexing Structures for Mining Frequent Patterns
Sort
View
JIIS
2007
154views more  JIIS 2007»
13 years 8 months ago
Constraint-based sequential pattern mining: the pattern-growth methods
Constraints are essential for many sequential pattern mining applications. However, there is no systematic study on constraint-based sequential pattern mining. In this paper, we in...
Jian Pei, Jiawei Han, Wei Wang
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 9 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
ADC
2008
Springer
156views Database» more  ADC 2008»
14 years 2 months ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 10 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou
CINQ
2004
Springer
180views Database» more  CINQ 2004»
14 years 7 days ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann