Pattern mining using Linked list (PML) mine the frequent patterns from transaction dataset using Linked list data structure

摘要

The Substantial amount of research has been done in the area of frequent pattern mining in the last few decades. Researchers have developed various algorithms to generate frequent patterns. We propose Pattern Mining using Linked list (PML) algorithm that generates frequent patterns using Linked list. It uses both horizontal and vertical data layout. To generate 1-itemsets, it uses horizontal data layout and for 2-itemsets and more, it uses vertical data layout. The important feature of vertical data layout is that it count the frequency fast using intersection operations on transaction ids (tids). It prunes automatically irrelevant data. The algorithm uses Linked list data structure due to which it takes less execution time to generate frequent patterns. It runs with efficient memory usage. It scans the dataset only two times. The experimental results of proposed algorithm have been compared with other algorithms.