Dec 12, 2007 · In this paper, we propose two parallel algorithms for mining maximal frequent itemsets from databases.
Dec 12, 2007 · Abstract In this paper, we propose two parallel algorithms for mining maximal frequent itemsets from databases. A frequent itemset is ...
In this paper, we propose a new algorithm, named Distributed Max-Miner (DMM), for mining maximal frequent itemsets from databases. A frequent itemset is ...
Nov 3, 2003 · In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of ...
People also ask
What is the maximal frequent itemset in data mining?
Which of the following algorithms is used for mining maximal frequent itemsets?
Which algorithm is used for frequent itemset mining?
What is a closed frequent itemset in data mining?
In this paper, we study the important problem of extracting frequent itemsets from a large uncertain database, interpreted under the Possible World Semantics.
The FPMAX algorithm [38] based on FP-Tree was one of the most efficient and stable mining algorithms for maximum frequent itemsets.
A new algorithm, named MSPX, which mines maximal sequential patterns by using multiple samples to effectively exclude infrequent candidates, which has very ...
A New Dynamic Distributed Algorithm for Frequent Itemsets Mining
ijcaonline.org › volume67 › number15
Chung, S. M. ,Congnan, L. 2008. Efficient mining of maximal frequent itemsets from databases on a cluster of workstations, Knowledge Information System, 16(3) ...
This paper describes new parallel association mining algorithms that use novel itemset clustering techniques to approximate the set of potentially maximal ...
Chung SM, Luo C (2008) Efficient mining of maximal frequent itemsets fromdatabases on a cluster of workstations. Knowl Inf Syst 16:359–391 https://doi.org ...