Jun 24, 2020 · Recent research shows that N-list-based approaches are very efficient for mining frequent patterns (FPs). Therefore, in this paper, we propose ...
Recent research shows that N-list-based approaches are very efficient for mining frequent patterns (FPs). Therefore, in this paper, we propose an N-list-based ...
A pattern with k items is called a k- pattern and I1 is the set of frequent 1-patterns sorted in order of descending frequency. For convenience, pattern {A, C, ...
Missing: Inter- | Show results with:Inter-
This study proposes an N-list based algorithm, named NCITPs-Miner, for efficient mining FCITPs, which outperforms state-of-the-art algorithms and creates ...
Oct 22, 2024 · Identifying frequent itemsets in large transactional databases, known as frequent patterns (FP), and the FP of association rules can be valuable ...
In this paper, we propose an algorithm called PITP-Miner that utilizes a projection based approach to mine frequent inter-transaction patterns efficiently.
An N-list-based approach for mining frequent inter-transaction patterns. TN Nguyen, LTT Nguyen, B Vo, NT Nguyen, TDD Nguyen. IEEE Access 8, 116840-116855, 2020.
Two theorems for fast determining closed patterns based on N-list structure are presented.An N-list-based algorithm for mining closed patterns is then ...
Sep 1, 2007 · In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases.
An improved version of PrePost, the N-list and Subsume-based algorithm for mining Frequent Itemsets (NSFI) algorithm that uses a hash table to enhance the ...