M. Sinthuja,D.Devikanniga,



Data Mining,Multiple Minimum Support, Minimum support, LP-Growth,Frequent Patterns,


Data mining is the process of discovering interesting patterns from the transactional database. In the past decade, numerous techniques have been proposed for mining frequent patterns using single minimum support threshold for all items from the transactional database which results in “rare item issue”. While fixing the minimum support to higher level, it results frequent patterns where rare item are missed. While fixing the minimum support to lower level, it results in too many frequent patterns which is known as combinatorial explosion. To confront the rare item problem, an effort has been made in the literature to find frequent patterns with “multiple minimum supports thresholds”. In this approach, minimum item support (MIS) is given to each item for mining frequent patterns. In this article, comparative analysis is done between MISFP-Growth and MISLP-Growth algorithm for mining frequent patterns using multiple minimum support threshold. In MISLP-Growth algorithm array based structure is adopted which is the major advantage and in MISFP-Growth algorithm pointer based structure is adopted which is the disadvantage. For this, the experiments are conducted using benchmark databases to find the efficient algorithm.From the results produced by these algorithms, it is found that the MISLP-Growth algorithm outperforms MISFP-Growth algorithm for all the databases in the criteria of consumption of runtime and memory.


I. Agrawal, R., and Srikant, R, (1994) ‘Fast algorithms for mining association rules in large databases’, In Proceedings of the 20th International Conference on Very Large Data Bases, VLDB ’94, pp.487–499.
II. Borah, A., and Nath, B, (2019) ‘Rare Pattern Mining: Challenges and Future Perspectives.’ Complex Intell. Syst. 5,pp. 1-23.
III. Chee, C., Jaafar, J., Aziz, I.A. (2019)’ Algorithm for Frequent Itemset Mining: A Literature Review’ Arificial Intelligence,52,pp.2603-2621.
IV. Han, J., Pei, Y., Yin, (2000) ‘Mining frequent patterns without candidate generation’, Proceedings ACM-SIGMOD International Conference on Management of Data (SIGMOD’ 00), Dallas.
V. Han, J., Pei, J., Yin, and Mao, R, (2004) ‘Mining frequent patterns without candidate generation: A frequent- pattern tree Approach, Data Mining in Knowledge Discovery 8(1): pp.53–87.
VI. Hoque, F.A., Easmin, N., and Rashed, K. (2012) ‘Frequent pattern mining for multiple minimum supports with support tuning and tree maintenance on incremental database’, Research of Information Technology J., 3(2): pp.79-90.
VII. Hu, Y.H., and Chen, Y, (2006) ‘Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism’, Decis. Support Syst., 42(1):pp.1–24.
VIII. Kiran, and Reddy, P.K. (2010) ‘Mining rare association rules in the datasets with widely varying items’ frequencies’, In DASFAA (1), pp. 49–62.
IX. Liu, B., Hsu, W., and Ma. Y. (1999) ‘Mining association rules with multiple minimum supports’. In KDD ’99: Proceedings of the Fifth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pages 337–341.
X. Sinthuja, M, Puviarasan, N, and Aruna, P, (2018) ‘Proposed Improved FP-Growth Algorithm with Multiple Minimum Support Threshold Value (MISIFP-Growth) For Mining Frequent Itemset’, International Journal of Research in Advent Technology, Vol.6, May, pp.471-476.
XI. Sinthuja, M, Puviarasan, N, and Aruna, P, (2018) ‘Mining frequent Itemsets Using Top Down Approach Based on Linear Prefix tree’, Springer, Lecture Tabs on Data Engineering and Communications Technologies, Vol.(15), September, pp.23-32.

XII. Sinthuja, M, Puviarasan, N, and Aruna, P, (2018) ‘Geo Map Visualization for Frequent Purchaser in Online Shopping Database Using an Algorithm LP-Growth for Mining Closed Frequent Itemsets’, Elsevier, procedia computer science, Vol.132, pp.1512-1522.
XIII. Sinthuja, M. Puviarasan, N. and Aruna, P, (2019) Frequent Itemset Mining using LP-Growth algorithm based on Multiple Minimum Support Threshold Value (MIS-LP-Growth), Journal of Computational and Theoretical Nanoscience,Volume 16, No(4), pp. 1365-1372(8).

View Download