|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 187 - Issue 117 |
| Published: June 2026 |
| Authors: Surati Sandipkumar B., Desai Apurva A. |
10.5120/ijca648ae6370891
|
Surati Sandipkumar B., Desai Apurva A. . Performance Evaluation of the PML Algorithm based on Memory Usage and Execution Time. International Journal of Computer Applications. 187, 117 (June 2026), 28-34. DOI=10.5120/ijca648ae6370891
@article{ 10.5120/ijca648ae6370891,
author = { Surati Sandipkumar B.,Desai Apurva A. },
title = { Performance Evaluation of the PML Algorithm based on Memory Usage and Execution Time },
journal = { International Journal of Computer Applications },
year = { 2026 },
volume = { 187 },
number = { 117 },
pages = { 28-34 },
doi = { 10.5120/ijca648ae6370891 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2026
%A Surati Sandipkumar B.
%A Desai Apurva A.
%T Performance Evaluation of the PML Algorithm based on Memory Usage and Execution Time%T
%J International Journal of Computer Applications
%V 187
%N 117
%P 28-34
%R 10.5120/ijca648ae6370891
%I Foundation of Computer Science (FCS), NY, USA
Frequent pattern generation from transaction datasets is an important issue. This can be achieved through frequent pattern mining. There are many popular algorithms, such as Apriori, FP-Growth, and ECLAT, that are widely used for frequent pattern generation. In this paper, we discuss an innovative frequent pattern mining algorithm using a Linked List (PML). This paper also analyzes the performance of PML algorithm in comparison with other popular algorithms in terms of memory usage and time consumption for generating frequent patterns.