Name
Abstract | ||
|---|---|---|
An N-list structure is used to compress the dataset for mining Maximal Frequent Patterns.A pruning technique is then proposed and used in INLA-MFP algorithm to improve the runtime and memory usage.Experiments were conducted to show that INLA-MFP outperforms well-known algorithms. Mining maximal frequent patterns (MFPs) is an approach that limits the number of frequent patterns (FPs) to help intelligent systems operate efficiently. Many approaches have been proposed for mining MFPs, but the complexity of the problem is enormous. Therefore, the run time and memory usage are still large. Recently, the N-list structure has been proposed and verified to be very effective for mining FPs, frequent closed patterns, and top-rank-k FPs. Therefore, this paper uses the N-list structure for mining MFPs. A pruning technique is also proposed to prune branches to reduce the search space. This technique is applied to an algorithm called INLA-MFP (improved N-list-based algorithm for mining maximal frequent patterns) for mining MFPs. Experiments were conducted to evaluate the effectiveness of the proposed algorithm. The experimental results show that INLA-MFP outperforms two state-of-the-art algorithms for mining MFPs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.eswa.2016.12.023 | Expert Syst. Appl. |
Keywords | Field | DocType |
Data mining,Pattern mining,Maximal frequent patterns,N-list structure,Pruning technique | Data mining,Intelligent decision support system,Computer science,Artificial intelligence,Machine learning | Journal |
Volume | Issue | ISSN |
73 | C | 0957-4174 |
Citations | PageRank | References |
11 | 0.49 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bay Vo | 1 | 764 | 60.13 |
| Sang Pham | 2 | 11 | 0.49 |
| Tuong Le | 3 | 212 | 15.89 |
| Zhi-Hong Deng | 4 | 185 | 23.33 |