19 search results - page 2 / 4 » FIT: A Fast Algorithm for Discovering Frequent Itemsets in L... |
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...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
RCIS
2010
13 years 3 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
ADBIS
1998
Springer
13 years 9 months ago
1998
Springer
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...