388 search results - page 22 / 78 » Mining Frequent Itemsets Using Support Constraints |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
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...
IDA
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
CLA
2007
13 years 9 months ago
2007
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....