Performance analysis of apriori and FP-growth algorithms on online-store data

Bhavya Sharma, Anuradha Rao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Mining frequent item sets from transaction datasets is always being one of the most important problems of data mining. Apriori is the most popular and simplest algorithm for frequent itemset mining. Transaction data is a set of recording data resulting in connections with sales-purchase activities at a particular online store. In recent years transaction data has been used in research for discovering new information. One of the possible attempts is to design an application that can be used to analyze the existing transaction data. This paper focuses on the performance comparison of Apriori and FP-growth algorithms with respect to the execution time.

Original languageEnglish
Title of host publication12th International Conference on Advances in Computing, Control, and Telecommunication Technologies, ACT 2021
PublisherGrenze Scientific Society
Pages654-660
Number of pages7
ISBN (Electronic)9780000000002
Publication statusPublished - 2021
Event12th International Conference on Advances in Computing, Control, and Telecommunication Technologies, ACT 2021 - Hyderabad, Virtual, India
Duration: 27-08-202128-08-2021

Publication series

Name12th International Conference on Advances in Computing, Control, and Telecommunication Technologies, ACT 2021
Volume2021-August

Conference

Conference12th International Conference on Advances in Computing, Control, and Telecommunication Technologies, ACT 2021
Country/TerritoryIndia
CityHyderabad, Virtual
Period27-08-2128-08-21

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Networks and Communications
  • Industrial and Manufacturing Engineering
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Performance analysis of apriori and FP-growth algorithms on online-store data'. Together they form a unique fingerprint.

Cite this