scholar.google.com › citations
PPC-Tree and N-list have been proven to be very efficient and been used in mining frequent itemsets widely. The main problem of the novel structures is that ...
In this paper, an efficient hybrid algorithm was designed using a unifying process of the algorithms Improved Apriori and FP-Growth. Results indicate that the ...
The main goal of SHFIM is to improve the execution time performance and reduce the search space to extract the frequent Itemset from big data.
Feb 8, 2018 · The dFIN algorithm (Deng, 2016) has been proposed for mining frequent itemsets based on the DiffNodeset data structure. Exper- imental results ...
Qibing Qin, Long Tan: An Effective Hybrid Algorithm for Fast Mining Frequent Itemsets. CyberC 2016: 91-95. a service of Schloss Dagstuhl - Leibniz Center ...
This paper proposes SO-Sets based on SO-Tree, a more efficient data structure, to mine frequent itemsets, and proposes a new algorithm called FISO, ...
Based on the NegNodeset data structure, we propose negFIN, which is an efficient algorithm for frequent itemset mining. ... Our extensive performance study on a ...
DiffNodesets: An Efficient Structure for Fast Mining Frequent Itemsets ... an efficient mining algorithm, PrePost, for mining all frequent itemsets.
In this paper, we propose an algorithm named dFIN for frequent itemset mining. ... dFIN achieves high performance by employing DiffNodesets to represent itemsets.
Feb 16, 2023 · This paper employs a tree-based data structure named as NegNodesets in collaboration with the list-based structure N-list for developing a novel Hybrid ...
Missing: Effective | Show results with:Effective