Sciweavers

295 search results - page 25 / 59
» Frequent regular itemset mining
Sort
View
IDA
2002
Springer
13 years 7 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 8 months ago
Identifying bridging rules between conceptual clusters
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
Shichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhan...
FIMI
2004
161views Data Mining» more  FIMI 2004»
13 years 9 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...
DKE
2007
105views more  DKE 2007»
13 years 7 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 8 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...