Pemanfaatan Algoritma Eclat Dalam Penemuan Pola Transaksi Penjualan Produk Haircare

Bangkit Ardi Nugroho, Sri Siswanti

Abstract


The professional haircare industry in Indonesia has experienced rapid growth, requiring companies to manage inventory more accurately and in a data-driven manner. Inefficient inventory management may lead to overstock or stockout conditions, resulting in operational inefficiencies and lost sales opportunities. This study aims to apply the Eclat algorithm to identify sales transaction patterns of professional haircare products at Inaura, to uncover significant product association patterns, and to formulate inventory management recommendations based on the analysis results. The research employs a quantitative data mining approach using market basket analysis. The dataset consists of sales transaction records of professional haircare products at  Inaura from January to December 2024. The Eclat algorithm is implemented with a minimum support threshold of 5% and a maximum itemset length of four items to generate frequent itemsets and meaningful association rules. The results indicate that the Eclat algorithm effectively and efficiently identifies sales transaction patterns that represent customer purchasing behavior. Products such as neutralizers, oxidising creams, and straightening systems exhibit the highest support values and form functional and complementary purchasing patterns. The extracted patterns can be utilized to support inventory planning, product prioritization, and data-driven bundling strategies. This study provides practical contributions to inventory optimization at Inaura and academic contributions by demonstrating the application of the Eclat algorithm in the underexplored domain of the professional haircare industry.


Keywords


data mining; market basket analysis; Eclat algorithm; sales transaction patterns; inventory management

Full Text:

References


M. Ferdinand and Wakhid Slamet Ciptono, “Assessing Cosmetic Industry Attractiveness,Competitiveness and Critical Success Factor in Indonesia,” J. Theor. Appl. Manag., vol. 15, no. 1, 2021.

IMARC, “Indonesia Hair Care Market Report 2024-2033,” Imarc Group. [Online]. Available: https://www.imarcgroup.com/indonesia-hair-care-market

T. O. Oktariani and A. Aulia, “Discover the Driving Forces behind Purchase Intention in Indonesia’s Beauty Industry,” TIJAB (The Int. J. Appl. Business), vol. 8, no. 2, pp. 226–241, 2024.

R. A. Putra, M. A. M. Putri, S. M. Sinaga, S. F. Octavia, and R. C. Rachman, “Implementation of Association Rules Algorithm to Identify Popular Topping Combinations in Orders,” Public Res. J. Eng. Data Technol. Comput. Sci., vol. 1, no. 2, pp. 95–101, 2024, doi: 10.57152/predatecs.v1i2.863.

M. Arifin, F. Helmi, and Iddrus, “Analisis Perbandingan Algoritma Asosiasi Data Mining pada Minimarket Adi Poday dengan Google Collab,” J. Algoritm., vol. 22, no. 1, pp. 103–114, 2025, doi: 10.33364/algoritma/v.22-1.2177.

R. L. Najmi, M. Irsyad, F. Insani, A. Nazir, and Pizaini, “Analisis Pola Asosiasi Data Transaksi Penjualan Minuman Menggunakan Algoritma FP-Growth dan Eclat,” Build. Informatics, Technol. Sci., vol. 5, no. 1, pp. 0–7, 2023, doi: 10.47065/bits.v5i1.3592.

L. Zahrotun and A. F. I. Robbani, “Penerapan Algoritma Eclat untuk Menemukan Pola Asosiasi Antar Barang di Aneka Sandang Collection,” JRST (Jurnal Ris. Sains dan Teknol., vol. 7, no. 1, p. 37, 2023, doi: 10.30595/jrst.v7i1.15298.

D. Erlina, D. Irfansyah, and I. Pratama, “Literatur Sistematis Perbandingan Kinerja Algoritma Apriori, ECLAT, dan FP-Growth dalam Analisis Pola Asosiasi,” Indones. J. Comput. Sci. Eng., vol. 02, no. 1, pp. 58–63, 2025.

Priyadharshini and Mahadevi, “Market Basket Analysis : An Overview of Association rule Mining,” J. Sci. Trans. Environ. Technov, vol. 17, no. 2, pp. 25–30, 2023.

H. Patil, T. Mukherjee, K. Pandit, H. Jani, P. K. Jha, and V. Agarwal, “Enhancing Retail Strategies through Apriori, ECLAT& FP Growth Algorithms in Market Basket Analysis,” Int. J. Recent Innov. Trends Comput. Commun., vol. 11, no. 9, pp. 3831–3838, 2023, doi: 10.17762/ijritcc.v11i9.9637.

Thariq, S. Martha, and H. Perdana, “Analisis Association Rules Menggunakan Algoritma Eclat Pada Toko Swalayan,” Bul. Ilm. Math. Stat. dan Ter., vol. 12, no. 2, pp. 171–178, 2023.

R. Wahyuningsih, A. Suharsono, and N. Iriawan, “Comparison of Market Basket Analysis Method Using Apriori Algorithm, Frequent Pattern Growth (Fp- Growth) and Equivalence Class Transformation (Eclat) (Case Study: Supermarket ‘X’ Transaction Data for 2021),” Bus. Financ. J., vol. 8, no. 2, pp. 192–201, 2023, doi: 10.33086/bfj.v8i2.5226.

L. Maysofa and K. U. Syaliman, “Implementasi Forecasting Pada Penjualan Inaura Hair Care Dengan Metode Single Exponential Smoothing,” J. Test. dan Implementasi Sist. Inf., vol. 1, no. 2, pp. 82–91, 2023.

N. N. Habibah and B. P. Adhi, “Proses Association Rule Untuk Mengetahui Kecenderungan Belanja Pada Kopma UNJ Menggunakan Algoritma Apriori Dan Eclat,” J. PINTER, vol. 6, no. 1, pp. 30–39, 2022, doi: https://doi.org/10.21009/pinter.6.1.5.

P. Thanathamathee and S. Sawangarreerak, “Discovering Future Earnings Patterns through FP-Growth and ECLAT Algorithms with Optimized Discretization,” Emerg. Sci. J., vol. 6, no. 6, pp. 1328–1345, Dec. 2022, doi: 10.28991/ESJ-2022-06-06-07.

L. Lisnawita and M. Devega, “Implementation of ECLAT Algorithm Technology: Determining Books Borrowing Pattern in University library,” in IOP Conference Series: Earth and Environmental Science, Institute of Physics Publishing, Apr. 2020. doi: 10.1088/1755-1315/469/1/012036.

A. R. Efrat, R. Gernowo, and Farikhin, “Consumer purchase patterns based on market basket analysis using apriori algorithms,” J. Phys. Conf. Ser., vol. 1524, no. 1, 2020, doi: 10.1088/1742-6596/1524/1/012109.




DOI: https://doi.org/10.30591/jpit.v11i2.10148

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

JPIT INDEXED BY

  
  

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.