Implementation of the FP-Growth Algorithm in Sales Transactions for Menu Package Recommendations at Warung Oemah Tani

  • Triana L
  • Khoerida N
  • Widiawati N
  • et al.
N/ACitations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

Along with the rapid development of the culinary industry, business competition is also getting tougher. Warung Oemah Tani serves a variety of menus and drinks, but to provide satisfying service to customers, business people must try to develop new products. Under these circumstances, the menu recommendations for Warung Oemah Tani need to be analyzed so that the recommendations made are right on target. This study aims to analyze the sales of Warung Oemah Tani using the FP Growth algorithm. This algorithm identifies the data set with the highest frequency of concurrent sales (frequent itemset). The results of the association rules show that the highest support value is 0.520 and the highest confidence value is 0.929, with a minimum support of 30% and a minimum confidence of 80%. Obtained 14 rule associations that meet the minimum support and minimum confidence.

Cite

CITATION STYLE

APA

Triana, L. A., Khoerida, N. I., Widiawati, N. T., & Tahyudin, I. (2022). Implementation of the FP-Growth Algorithm in Sales Transactions for Menu Package Recommendations at Warung Oemah Tani. Internet of Things and Artificial Intelligence Journal, 2(2), 111–121. https://doi.org/10.31763/iota.v2i2.563

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free