Advertisement

A Comparative Analysis of Breadth First Search Approach in Mining Frequent Itemsets

  • M. SinthujaEmail author
  • N. Puviarasan
  • P. Aruna
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 65)

Abstract

The ensuing paper contrasts the algorithms using breadth first search technique of mining frequent itemset. The Apriori algorithm is a well-known algorithm which adopts breadth first search approach to mine frequent itemsets. The process of finding the frequent itemsets is simple for smaller database and complex for larger databases. Candidate itemset generation is a major disadvantage for Apriori algorithm. In this research paper, the proposed BFS-LP-Growth algorithm is compared with another breadth first search algorithm Apriori. The proposed BFS-LP-Growth algorithm overcomes the limitation of Apriori algorithm by processing the database twice and also avoids the exploration of candidate itemset. The structure of LP-Growth algorithm makes the proposed BFS-LP-Growth algorithm more advantageous. The breadth first search enhances the performance of the proposed BFS-LP-Growth algorithm by creating subheader table which avoids the necessity of conditional pattern base and conditional LP-tree. Standard databases used for comparison are Chess and Mushroom. Based on the results, we find that the proposed BFS-LP-Growth algorithm is more worthwhile than the Apriori algorithms as execution time is low and the need for candidate patterns is diminished.

Keywords

Association rule mining Depth first search approach Data mining Frequent itemset mining Linear tree Minimum support Pruning Breadth first search approach 

Notes

Acknowledgements

We gratefully acknowledge the funding agency, the University Grant Commission (UGC) of the Government of India, for providing financial support for doing this research work.

References

  1. 1.
    Agarwal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM-SIGMOD, pp 207–216Google Scholar
  2. 2.
    Agarwal R, Srikanth R (1995) Mining sequential patterns. ICDEGoogle Scholar
  3. 3.
    Pyun G, Yun U, Ryu KH (2014) Efficient frequent pattern mining based on Linear Prefix tree. Knowl-Based Syst 55:125–139CrossRefGoogle Scholar
  4. 4.
    Tanbeer SK, Ahmed CF, Jeong BS, Lee Y (2008) Efficient single pass frequent pattern mining using a prefix-tree. Inf Sci 179(5):559–583MathSciNetCrossRefGoogle Scholar
  5. 5.
    Sinthuja M, Puviarasan N, Aruna P (2016) Experimental evaluation of Apriori and equivalence class clustering and bottom up lattice traversal (ECLAT) algorithms. Pak J Biotechnol 13(2):77–82Google Scholar
  6. 6.
    Wang K, He Y, Han J (2000) Mining frequent pattern using support constraints. VLDB, pp 43–52Google Scholar
  7. 7.
    Lin K-C, Liao I-E, Chen Z-S (2011) An improved frequent pattern growth method for mining association rules. Expert Syst Appl 38:5154–5161CrossRefGoogle Scholar
  8. 8.
    Sinthuja M, Puviarasan N, Aruna P (2017) Comparative analysis of association rule mining algorithms in mining frequent patterns. Int J Adv Res Comput Sci 8(5)Google Scholar
  9. 9.
    Sinthuja M, Puviarasan N, Aruna P (2018) Research of improved FP-growth (IFP) algorithm in association rules mining. Int J Eng Sci Invent 24–31Google Scholar
  10. 10.
    Mannila H, Toivonen H (1997) Level wise search and borders of theories in knowledge discovery. Data Min Knowl Disc 1(3):241–258CrossRefGoogle Scholar
  11. 11.
    Sinthuja M, Puviarasan N, Aruna P (2018) Mining frequent Itemsets Using Top Down Approach Based on Linear Prefix tree, Springer. Lecture Notes on Data Eng Commun Technol 15:23–32Google Scholar
  12. 12.
    Agrawal R, Srikant R (1994) Fast algorithm for mining association rules in large databases. In: Proceedings of the 1994 international conference VLDB, Santiago, Chile, pp 487–499Google Scholar
  13. 13.
    Sinthuja M, Puviarasan N, Aruna P (2017) Evaluating the performance of association rule mining algorithms. World Appl Sci J 35(1):43–53. ISSN 1818-4952Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringAnnamalai UniversityChidambaramIndia
  2. 2.Department of Computer and Information ScienceAnnamalai UniversityChidambaramIndia

Personalised recommendations