Hybrid Apriori–MST Framework for Revealing the Structural Backbone of Consumer Purchase Patterns
DOI:
https://doi.org/10.51903/elkom.v18i2.3300Keywords:
Market Basket Analysis, Association Rules, Minimum Spanning Tree, Hybrid Model, Consumer Purchase PatternsAbstract
Traditional association rule analysis is effective at uncovering co-purchase patterns but fails to provide a global structural view of the market, which often results in fragmented and isolated insights. This study proposes a hybrid framework that integrates the Apriori algorithm with a Minimum Spanning Tree (MST) in order to validate and contextualize association rules within a single structural backbone. Transaction data from a retail store are transformed into a weighted, undirected product graph using an inverse-support function, and an MST is then extracted to represent the market backbone, while frequent itemsets and strong rules are obtained using Apriori. Experimental results on 236 multi-item transactions show that the MST backbone comprises 10 products and 9 fundamental links, with 66.67% of these links being confirmed by strong association rules, indicating a substantial coherence between statistical and structural evidence. The proposed model identifies 41 Apriori patterns that can be embedded in the MST and ranks them using a new metric, Structural Distance, which enables the categorization of Core Patterns, Bridge Patterns, and Complex Patterns according to their structural tightness. This hybrid perspective distinguishes dense, strategically meaningful bundles from anomalous but frequent combinations that are structurally peripheral, thereby offering a more holistic and actionable alternative to conventional Market Basket Analysis. The validated framework can support various applications, including store layout optimization, cross-selling strategies, and the design of path-based recommender systems, and it opens avenues for future extensions based on dynamic graphs and Graph Neural Networks.
References
[1] R. Agrawal and R. Srikant, “Fast algorithms for mining association rules,” in Proceedings of the 20th International Conference on Very Large Data Bases (VLDB ’94), San Francisco, CA: Morgan Kaufmann, 1994, pp. 487–499.
[2] B. Apriyanto and S. Sitio, “Penerapan k-means dalam menganalisis pola pembelian pelanggan pada data transaksi e-commerce,” Bit-Tech, vol. 7, no. 3, pp. 790–797, 2025, doi: 10.32877/bt.v7i3.2195.
[3] S. Fuaddah, “Dampak perubahan sosial dan ekonomi terhadap pola konsumsi masyarakat urban di era digital,” OSF Preprints, 2023, doi: 10.31219/osf.io/8npaq.
[4] R. Fadillah, L. Qadriah, and M. Rizal, “Market basket analisis data mining untuk mengetahui pola penjualan pada Cerry Mart Beureunueun menggunakan algoritma apriori,” JRR, vol. 5, no. 1, pp. 234–239, 2023, doi: 10.47647/jrr.v5i1.1152.
[5] A. Pramudita, Y. Hardianto, M. Marcellino, F. Thiodoris, and C. Kristi, “Analisis dataset estimasi penjualan produk pada Café For Good Luck menggunakan algoritma apriori,” JCSIT, vol. 2, no. 1, pp. 116–125, 2024, doi: 10.70248/jcsit.v2i1.1739.
[6] R. Campos and M. Ricardo, “A fast algorithm for computing minimum routing cost spanning trees,” Computer Networks, vol. 52, no. 17, pp. 3229–3247, 2008.
[7] R. L. Graham and P. Hell, “On the history of the minimum spanning tree problem,” IEEE Annals of the History of Computing, vol. 7, no. 1, pp. 43–57, 1985.
[8] Z. Huang, D. D. Zeng, and H. Chen, “Analyzing consumer–product graphs: Empirical findings and applications in recommender systems,” Manage Sci, vol. 53, no. 7, pp. 1146–1164, 2007.
[9] S. Shah, “Analysis of e-commerce product graphs,” TechRxiv, 2020, doi: 10.36227/techrxiv.12814244.
[10] Wamiliana, “Solving the degree constrained minimum spanning tree problem using Tabu and modified penalty search methods,” Jurnal Teknik Industri, vol. 6, no. 1, pp. 1–9, 2004.
[11] Wamiliana, Minimum spanning tree dan desain jaringan. Bandarlampung, Indonesia: Pusaka Media, 2022.
[12] E. Özdemir and Ç. Gündüz-Demir, “A hybrid classification model for digital pathology using structural and statistical pattern recognition,” IEEE Trans Med Imaging, vol. 32, no. 2, pp. 474–483, 2013.
[13] V. Deshmukh, C. Cannings, and A. Thomas, “Estimating the parameters of a model for protein–protein interaction graphs,” Mathematical Medicine and Biology, vol. 23, no. 4, pp. 279–295, 2006.
[14] S. Rachmat and A. Antoni, “Analisis pola pembelian secara online: Pendekatan kuantitatif untuk memahami perilaku konsumen dan pengaruhnya pada pasar e-commerce,” PESHUM, vol. 4, no. 3, pp. 4300–4310, 2025, doi: 10.56799/peshum.v4i3.8929.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Elkom: Jurnal Elektronika dan Komputer

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






