46 search results - page 2 / 10 » Discovering of Frequent Itemsets with CP-mine Algorithm |
93
Voted
IEEEHPCS
2010
14 years 8 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
KES
2004
Springer
15 years 3 months ago
2004
Springer
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
109
click to vote
DAWAK
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
RCIS
2010
14 years 8 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,...
ICTAI
2003
IEEE
15 years 2 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...