30 search results - page 1 / 6 » Finding Maximal Fully-Correlated Itemsets in Large Databases |
ICDM
2009
IEEE
13 years 11 months ago
2009
IEEE
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
FIMI
2004
13 years 6 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
ICTAI
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
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...
PODS
1998
ACM
13 years 9 months ago
1998
ACM
The problem of finding association rules in a large database of sales transactions has been widely studied in the literature, We discuss some of the weaknessesof the large itemset...