Sciweavers

113 search results - page 7 / 23
» Efficient Discovery of Frequent Approximate Sequential Patte...
Sort
View
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
14 years 2 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 23 days ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
14 years 1 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni
EDBT
2009
ACM
170views Database» more  EDBT 2009»
13 years 11 months ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
AMW
2009
13 years 8 months ago
Temporal Support in Sequential Pattern Mining
In sequential pattern discovery, the support of a sequence is computed as the number of data-sequences satisfying a pattern with respect to the total number of data-sequences in th...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...