Sciweavers

183 search results - page 16 / 37
» SQL Based Frequent Pattern Mining with FP-Growth
Sort
View
DASFAA
2007
IEEE
220views Database» more  DASFAA 2007»
14 years 1 months ago
LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases
Sequential pattern mining is very important because it is the basis of many applications. Although there has been a great deal of effort on sequential pattern mining in recent year...
Zhenglu Yang, Yitong Wang, Masaru Kitsuregawa
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
14 years 8 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy
PAKDD
2010
ACM
152views Data Mining» more  PAKDD 2010»
14 years 8 days ago
Mining Association Rules in Long Sequences
Abstract. Discovering interesting patterns in long sequences, and finding confident association rules within them, is a popular area in data mining. Most existing methods define...
Boris Cule, Bart Goethals
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
14 years 26 days ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 11 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...