Sciweavers

1217 search results - page 42 / 244
» On compressing frequent patterns
Sort
View
137
Voted
DAWAK
2004
Springer
15 years 7 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
199
Voted
FIMI
2004
279views Data Mining» more  FIMI 2004»
15 years 5 months ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
108
Voted
CIKM
2005
Springer
15 years 9 months ago
On the estimation of frequent itemsets for data streams: theory and experiments
In this paper, we devise a method for the estimation of the true support of itemsets on data streams, with the objective to maximize one chosen criterion among {precision, recall}...
Pierre-Alain Laur, Richard Nock, Jean-Emile Sympho...
146
Voted
CIKM
1998
Springer
15 years 7 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
158
Voted
AICCSA
2006
IEEE
218views Hardware» more  AICCSA 2006»
15 years 9 months ago
Performance Comparison of Pattern Discovery Methods on Web Log Data
One of the popular trends in computer science has been development of intelligent web-based systems. Demand for such systems forces designers to make use of knowledge discovery te...
Murat Ali Bayir, Ismail H. Toroslu, Ahmet Cosar