Abstract
Market Basket Analysis (MBA) is a popular technique to identify associations between products, which is crucial for business decision making. Previous studies typically adopt conventional frequent itemset mining algorithms to perform MBA. However, they generally fail to uncover rarely occurring associations among the products at their most granular level. Also, they have limited ability to capture temporal dynamics in associations between products. Hence, we propose OMBA, a novel representation learning technique for Online Market Basket Analysis. OMBA jointly learns representations for products and users such that they preserve the temporal dynamics of product-to-product and user-to-product associations. Subsequently, OMBA proposes a scalable yet effective online method to generate products’ associations using their representations. Our extensive experiments on three real-world datasets show that OMBA outperforms state-of-the-art methods by as much as 21%, while emphasizing rarely occurring strong associations and effectively capturing temporal changes in associations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
“Units” refers to the attribute values (could be products or users) of the baskets.
- 3.
- 4.
References
Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional space. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 420–434. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44503-X_27
Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of VLDB (1994)
Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of FOCS (2006)
Silva, A., Luo, L., Karunasekera, S., Leckie, C.: Supplementary Materials for OMBA: On Learning User-Guided Item Representations for Online Market Basket Analysis (2020). https://bit.ly/30yGMbx
Bai, T., Nie, J.Y., Zhao, W.X., Zhu, Y., Du, P., Wen, J.R.: An attribute-aware neural attentive model for next basket recommendation. In: Proceedings of SIGIR (2018)
Barkan, O., Koenigstein, N.: Item2vec: neural item embedding for collaborative filtering. In: Proceedings of MLSP (2016)
Deng, Z.H., Lv, S.L.: Fast mining frequent itemsets using nodesets. Expert Syst. Appl. 41, 4505 (2014)
Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. In: Proceedings of COLT (2010)
Fournier-Viger, P., Wu, C.-W., Tseng, V.S.: Mining top-K association rules. In: Kosseim, L., Inkpen, D. (eds.) AI 2012. LNCS (LNAI), vol. 7310, pp. 61–73. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30353-1_6
Grbovic, M., et al.: E-commerce in your inbox: product recommendations at scale. In: Proceedings of SIGKDD (2015)
Han, J., Fu, Y.: Discovery of Multiple-Level Association Large Databases. In: Proceedings of VLDB (1995)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Disc. 8, 53 (2004). https://doi.org/10.1023/B:DAMI.0000005258.31418.83
Hariharan, S., Kannan, M., Raguraman, P.: A seasonal approach for analysis of temporal trends in retail marketing using association rule mining. Int. J. Comput. Appl. 71, 10–15 (2013)
Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26, 189 (1984)
Le, D.T., Lauw, H.W., Fang, Y.: Basket-sensitive personalized item recommendation. In: Proceedings of IJCAI (2017)
Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Proceedings of NIPS (2001)
Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Proceedings of NIPS (2013)
Papavasileiou, V., Tsadiras, A.: Time variations of association rules in market basket analysis. In: Iliadis, L., Maglogiannis, I., Papadopoulos, H. (eds.) AIAI/EANN -2011. IAICT, vol. 364, pp. 36–44. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23960-1_5
Agarwal, R., Mittal, M.: Inventory classification using multilevel association rule mining. Int. J. Decis. Support Syst. Technol. 11(2), 1–12 (2019)
Silva, A., Karunasekera, S., Leckie, C., Luo, L.: USTAR: Online multimodal embedding for modeling user-guided spatiotemporal activity. In: Proceedings of IEEE-Big Data (2019)
Wan, M., Wang, D., Liu, J., Bennett, P., McAuley, J.: Representing and recommending shopping baskets with complementarity, compatibility and loyalty. In: Proceedings of CIKM (2018)
Yu, F., Liu, Q., Wu, S., Wang, L., Tan, T.: A dynamic recurrent model for next basket recommendation. In: Proceedings of SIGIR (2016)
Zhang, C., et al.: React: online multimodal embedding for recency-aware spatiotemporal activity modeling. In: Proceedings of SIGIR (2017)
Acknowledgment
This research was financially supported by Melbourne Graduate Research Scholarship and Rowden White Scholarship.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Silva, A., Luo, L., Karunasekera, S., Leckie, C. (2021). OMBA: User-Guided Product Representations for Online Market Basket Analysis. In: Hutter, F., Kersting, K., Lijffijt, J., Valera, I. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2020. Lecture Notes in Computer Science(), vol 12457. Springer, Cham. https://doi.org/10.1007/978-3-030-67658-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-67658-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67657-5
Online ISBN: 978-3-030-67658-2
eBook Packages: Computer ScienceComputer Science (R0)
