28 search results - page 2 / 6 » A Fast Algorithm for Mining Share-Frequent Itemsets |
APPINF
2003
13 years 6 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
SDM
2011
SIAM
12 years 7 months ago
2011
SIAM
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
DAWAK
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
KAIS
2006
13 years 4 months ago
2006
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
IDEAL
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...