Sales Transaction Data Analysis using Apriori Algorithm to Determine the Layout of the Goods

Article Sidebar

PDF
Published: Sep 1, 2018
DOI: https://doi.org/10.47738/ijiis.v1i1.19
Keywords:
Algorithm, Apriori, Association Rule

Main Article Content

Taqwa Hariguna
Amikom University Purwokerto, Indonesia
Uswatun Hasanah
Metro State Islamic Institute, Indonesia
Nindi Nofi Susanti
Amikom University Purwokerto, Indonesia

Abstract

In a shop, usually apply a sales strategy in order. The sales strategy can be in the form of determining the layout of goods so that they are close to one another. Determining the layout of items can be based on items that are often purchased simultaneously. Searching for items that are often purchased together can be done using data mining techniques, which is processing data to become more useful information. Sales transaction data processing can be done using apriori algorithm. Apriori algorithm is the most famous algorithm for finding high-frequency patterns and generating association rules. From the results of the discussion and data analysis, there were 3 (three) association rules formed, namely "If you buy Milo Active 18 grm, then buy ABC Kopi Susu 31G" with support 0.36% and 75% confidence, "If you buy Dancow 1 + Honey 200 grm, then buy Ice Cream Corneto" wit H Support 0.36% and confidence 60%, "If you buy SIIP Roasted 6.5 grm, then buy Davos Strong 10 grm" with support 0.36% and 75% confidence. From the association's rules can be used as decision making to determine the layout of goods that are likely to be purchased simultaneously by the buyer

Article Details

Issue
Vol. 1 No. 1: September 2018
Section
Articles

Authors who publish with IJIIS : International Journal on Informatics and Information Systems agree to the following terms: Authors retain copyright and grant the IJIIS : International Journal on Informatics and Information Systems right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share (copy and redistribute the material in any medium or format) and adapt (remix, transform, and build upon the material) the work for any purpose, even commercially with an acknowledgement of the work's authorship and initial publication in IJIIS : International Journal on Informatics and Information Systems. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in IJIIS : International Journal on Informatics and Information Systems. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

References

L.Wang et al., “Efficient Mining of Frequent Item Sets on Large Uncertain Databases, â€IEEE Transactions on Knowledge and Data Engineering, vol.24, no. 12, pp. 2170 –2183,Dec. 2012.

V.S.Tseng, “Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases,†IEEE Transactions on Knowledge and Data Engineering, vol.25 , no. 8, pp. 1772-1786,Aug. 2013.

Tassa T., “Secure Mining of Association Rules in Horizontally Distributed Databases, â€IEEE Transactions on Knowledge and Data Engineering, vol. 26 , no. 4,pp.970-983,April2014.

W.cao, “Research of The Mining Algorithm Based on Distributed Database,†IEEE 2011 Eighth International Conference on FuzzySystems and Knowledge Discovery (FSKD), pp.1252-1256, 2011.

F. Giannotti et al., “Privacy-Preserving Mining of Association Rules from Outsourced Transaction Databases,â€IEEE Systems Journal, vol.7, no.3, pp.385-395, SEPTEMBER 2013.

Z. Zhao, D. Yan, and W. Ng, “Mining Probabilistically Frequent Sequential Patterns in Large Uncertain Databases, â€IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 5, pp. 1171-1181, May 2014.

S.Barua and J.Sander, “Mining Statistically Significant Co-location and Segregation Patterns,†IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 5, pp. 1185-1199, May 2014.

N. Liet al.,“Implementation of Apriori Algorithm Based on MapReduce,â€13th IEEE-ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, pp. 236-241, 2012.

S. Bhatnagar, “Algorithm for Finding Association Rules in Distributed Databases,â€2nd IEEE International Conference on Parallel, Distributed and Grid Computing, pp. 915-920, 2012.

Z.Zong and Z. ping, “A parallel algorithm of frequent itemsets mining based on bit matrix,â€IEEE International Conference on Industrial Control and Electronics Engineering, pp. 1210-1213, 2012.

K. Shah and S.Mahajan, “Maximizing the Efficiency of ParallelApriori Algorithm,†IEEE International Conference on AdvancesinRecent Technologies in Communication and Computing, pp.107-109, 2009.

S.Einakian andM. Ghanbari, “Parallel Implementation of Association Rule in Data Mining,â€Proceedings of the 38th Southeastern Symposium onSystem Theory Tennessee Technological University Cookeville, TN, USA, March 2006,pp. 21-26.