Advertisement

TwoFold Frisky Algorithm (TFFA): A Fast Frequent Itemset Algorithm

  • Md. Abdul AzizEmail author
  • Lalam Rajesh
  • Saikiran Reddi
  • G. Durga Prasad
Conference paper
  • 15 Downloads
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1119)

Abstract

Finding frequent itemsets and generation of association rules by using frequent items plays an important role in the field of data mining. Many algorithms were proposed to get frequent itemsets, but the most popular algorithm is Apriori which is implemented on the horizontal database. In which the method frequently scans the database and returns the flood of candidates which are the significant disadvantages. A novel algorithm based on the vertical database was introduced, which overcomes the disadvantages of Apriori. The proposed algorithm discards the calculation of a few frequent itemsets by taking the next maximum itemset in the process of generating maximal frequent itemset. That means when the length of a frequent itemset with the higher value in powers of two appears then it neglects the lower valued itemsets though it is in powers of two. The simulation results were compared with Apriori and FP-Growth algorithms. It was shown that the novel implementation performed better than Apriori and FP-Growth.

Keywords

Frequent itemset Apriori algorithm FP growth algorithm Next maximum 

References

  1. 1.
    Gopalan, N.P.: Sivaselan book on data mining techniques and trends published by Asoke K. Ghosh. PHI Learning Private LimitedGoogle Scholar
  2. 2.
    Han, J., Kamber, M.: Data Mining—Concepts and Techniques, 2nd edn, Morgan Kaufmann (2006)Google Scholar
  3. 3.
    Road, H., Jose, S.: Fast algorithms for mining association. pp. 487–499Google Scholar
  4. 4.
    Dougherty, J., Kohavi, M., Sahami, M.: Supervised and unsupervised discretization of continuous features. In: International Conference on Machine Learning, pp. 194–202 (1995)Google Scholar
  5. 5.
    Guoxiang, L., Zhiheng, Q.: Data mining applications in marketing strategy. In: International Conference on Intelligent System Design and Engineering Application (ISDEA) (2013)Google Scholar
  6. 6.
    Shan, L., Xuefeng, Z.: The application of data mining in statistics of R&D. In: International Conference on Computer Science and Service System (2012)Google Scholar
  7. 7.
    Adriaans, P., Zantinge, D.: Data Mining. Addison Wesley, New York (1996)Google Scholar
  8. 8.
    Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD, pp. 207–216 (1993)Google Scholar
  9. 9.
    Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases.In: Proceedings of the ACM-SIGMOD Conference on Management of Data, ACM, New York, USA, pp. 207–216 (1993)Google Scholar
  10. 10.
    Kurant, M., Markopoulou, A., Thiran, P.: On the bias of BFS (Breadth First Search). In: 22nd International Teletraffic Congress (lTC 22) (2010)Google Scholar
  11. 11.
    Tarjan, R.E.: Depth-first search and linear graph algorithms. In: 12th Annual Symposium on Switching and Automata Theory (swat) (1971)Google Scholar
  12. 12.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of 2000 ACM-SIGMOD International Conference on Management of Data (SIGMOD’00), pp. 1–12, Dallas, TX (2000)Google Scholar
  13. 13.
    Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372–390 (2000)CrossRefGoogle Scholar
  14. 14.
    Yang, J., Zhang, Y., Wei, Y.: An improved vertical algorithm for frequent itemset mining from uncertain database. In: 9th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC) (2017)Google Scholar
  15. 15.
    Sathya, M., Thangadurai, K.: Frequent itemset mining in vertical layout with E-ACO algorithm: in super market. In: World Congress on Computing and Communication Technologies (WCCCT) (2017)Google Scholar
  16. 16.
    Guo, Y.-m., Wang, Z.-j.: A vertical format algorithm for mining frequent item sets. In: 2nd International Conference on Advanced Computer Control (2010)Google Scholar
  17. 17.
    Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. Technical report 01-1, RPI (2001)Google Scholar
  18. 18.
    Song, W., Liu, Y., Li, J.: Vertical mining for high utility itemsets. In: 2012 IEEE International Conference on Granular ComputingGoogle Scholar
  19. 19.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM-SIGMOD International Conference on Management of Data, pp. 1–12 (1999)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Md. Abdul Aziz
    • 1
    Email author
  • Lalam Rajesh
    • 1
  • Saikiran Reddi
    • 1
  • G. Durga Prasad
    • 1
  1. 1.CSE DepartmentRGUKT-RK ValleyKadapaIndia

Personalised recommendations