Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

M<sup>2</sup>: Mixed Models With Preferences, Popularities and Transitions for Next-Basket Recommendation

Published: 01 April 2023 Publication History

Abstract

Next-basket recommendation considers the problem of recommending a set of items into the next basket that users will purchase as a whole. In this paper, we develop a novel mixed model with preferences, popularities and transitions (<inline-formula><tex-math notation="LaTeX">$\mathop {\mathtt {M^2}}\limits$</tex-math><alternatives><mml:math><mml:msup><mml:mi mathvariant="monospace">M</mml:mi><mml:mn mathvariant="monospace">2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="ning-ieq1-3142773.gif"/></alternatives></inline-formula>) for the next-basket recommendation. This method models three important factors in next-basket generation process: 1) users&#x2019; general preferences, 2) items&#x2019; global popularities and 3) transition patterns among items. Unlike existing recurrent neural network-based approaches, <inline-formula><tex-math notation="LaTeX">$\mathop {\mathtt {M^2}}\limits$</tex-math><alternatives><mml:math><mml:msup><mml:mi mathvariant="monospace">M</mml:mi><mml:mn mathvariant="monospace">2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="ning-ieq2-3142773.gif"/></alternatives></inline-formula> does not use the complicated networks to model the transitions among items, or generate embeddings for users. Instead, it has a simple encoder-decoder based approach (<inline-formula><tex-math notation="LaTeX">$\mathop {\mathtt {ed\text{-}Trans}}\limits$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant="monospace">ed</mml:mi><mml:mtext mathvariant="monospace">-</mml:mtext><mml:mi mathvariant="monospace">Trans</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="ning-ieq3-3142773.gif"/></alternatives></inline-formula>) to better model the transition patterns among items. We compared <inline-formula><tex-math notation="LaTeX">$\mathop {\mathtt {M^2}}\limits$</tex-math><alternatives><mml:math><mml:msup><mml:mi mathvariant="monospace">M</mml:mi><mml:mn mathvariant="monospace">2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="ning-ieq4-3142773.gif"/></alternatives></inline-formula> with different combinations of the factors with 5 state-of-the-art next-basket recommendation methods on 4 public benchmark datasets in recommending the first, second and third next basket. Our experimental results demonstrate that <inline-formula><tex-math notation="LaTeX">$\mathop {\mathtt {M^2}}\limits$</tex-math><alternatives><mml:math><mml:msup><mml:mi mathvariant="monospace">M</mml:mi><mml:mn mathvariant="monospace">2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="ning-ieq5-3142773.gif"/></alternatives></inline-formula> significantly outperforms the state-of-the-art methods on all the datasets in all the tasks, with an improvement of up to 22.1&#x0025;. In addition, our ablation study demonstrates that the <inline-formula><tex-math notation="LaTeX">$\mathop {\mathtt {ed\text{-}Trans}}\limits$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant="monospace">ed</mml:mi><mml:mtext mathvariant="monospace">-</mml:mtext><mml:mi mathvariant="monospace">Trans</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="ning-ieq6-3142773.gif"/></alternatives></inline-formula> is more effective than recurrent neural networks in terms of the recommendation performance. We also have a thorough discussion on various experimental protocols and evaluation metrics for next-basket recommendation evaluation.

References

[1]
H. Hu and X. He, “Sets2sets: Learning from sequential sets with neural networks,” in Proc. 25th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2019, pp. 1491–1499.
[2]
S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme, “Factorizing personalized Markov chains for next-basket recommendation,” in Proc. 19th Int. Conf. World Wide Web, 2010, pp. 811–820.
[3]
F. Yu, Q. Liu, S. Wu, L. Wang, and T. Tan, “A dynamic recurrent model for next basket recommendation,” in Proc. 39th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2016, pp. 729–732.
[4]
T. Bai, J.-Y. Nie, W. X. Zhao, Y. Zhu, P. Du, and J.-R. Wen, “An attribute-aware neural attentive model for next basket recommendation,” in Proc. 41st Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2018, pp. 1201–1204.
[5]
J. Yang, J. Xu, J. Tong, S. Gao, J. Guo, and J. Wen, “Pre-training of context-aware item representation for next basket recommendation,” 2019,.
[6]
R. He and J. McAuley, “Fusing similarity models with Markov chains for sparse sequential recommendation,” in Proc. 16th IEEE Int. Conf. Data Mining, 2016, pp. 191–200.
[7]
D.-T. Le, H. W. Lauw, and Y. Fang, “Correlation-sensitive next-basket recommendation,” in Proc. 28th Int. Joint Conf. Artif. Intell., 2019, pp. 2808–2814.
[8]
M. Wan, D. Wang, J. Liu, P. Bennett, and J. McAuley, “Representing and recommending shopping baskets with complementarity, compatibility and loyalty,” in Proc. 27th ACM Int. Conf. Inf. Knowl. Manage., 2018, pp. 1133–1142.
[9]
W. Wang and L. Cao, “Interactive sequential basket recommendation by learning basket couplings and positive/negative feedback,” ACM Trans. Inf. Syst., vol. 39, no. 3, pp. 1–26, 2021.
[10]
T. Donkers, B. Loepp, and J. Ziegler, “Sequential user-based recurrent neural network recommendations,” in Proc. 8th ACM Conf. Recommender Syst., 2017, pp. 152–160.
[11]
O. Barkan and N. Koenigstein, “Item2Vec: Neural item embedding for collaborative filtering,” in Proc. 26th Int. Workshop Mach. Learn. Signal Process., 2016, pp. 1–6.
[12]
F. Vasile, E. Smirnova, and A. Conneau, “Meta-Prod2Vec: Product embeddings using side-information for recommendation,” in Proc. 10th ACM Conf. Recommender Syst., 2016, pp. 225–232.
[13]
T. Mikolov, I. Sutskever, K. Chen, G. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in Proc. 26th Int. Conf. Neural Inf. Process. Syst., 2013, pp. 3111–3119.
[14]
J. Tang and K. Wang, “Personalized top-n sequential recommendation via convolutional sequence embedding,” in Proc. 11th ACM Int. Conf. Web Search Data Mining, 2018, pp. 565–573.
[15]
W.-C. Kang and J. McAuley, “Self-attentive sequential recommendation,” in Proc. 18th IEEE Int. Conf. Data Mining, 2018, pp. 197–206.
[16]
F. Sunet al., “BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer,” in Proc. 28th ACM Int. Conf. Inf. Knowl. Manage., 2019, pp. 1441–1450.
[17]
C. Ma, P. Kang, and X. Liu, “Hierarchical gating networks for sequential recommendation,” in Proc. 25th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2019, pp. 825–833.
[18]
B. Peng, Z. Ren, S. Parthasarathy, and X. Ning, “HAM: Hybrid associations models for sequential recommendation,” IEEE Trans. Knowl. Data Eng., early access, Jan. 06, 2021.
[19]
S. Wang, L. Cao, Y. Wang, Q. Z. Sheng, M. A. Orgun, and D. Lian, “A survey on session-based recommender systems,” ACM Comput. Surv., vol. 54, no. 7, pp. 1–38, 2021.
[20]
B. Hidasi, A. Karatzoglou, L. Baltrunas, and D. Tikk, “Session-based recommendations with recurrent neural networks,” 2015,.
[21]
B. Hidasi and A. Karatzoglou, “Recurrent neural networks with top-k gains for session-based recommendations,” in Proc. 27th ACM Int. Conf. Inf. Knowl. Manage., 2018, pp. 843–852.
[22]
J. Li, P. Ren, Z. Chen, Z. Ren, T. Lian, and J. Ma, “Neural attentive session-based recommendation,” in Proc. ACM Int. Conf. Inf. Knowl. Manage., 2017, pp. 1419–1428.
[23]
Q. Liu, Y. Zeng, R. Mokhosi, and H. Zhang, “STAMP: Short-term attention/memory priority model for session-based recommendation,” in Proc. 24th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2018, pp. 1831–1839.
[24]
S. Wu, Y. Tang, Y. Zhu, L. Wang, X. Xie, and T. Tan, “Session-based recommendation with graph neural networks,” in Proc. AAAI Conf. Artif. Intell., 2019, pp. 346–353.
[25]
R. Qiu, J. Li, Z. Huang, and H. Yin, “Rethinking the item order in session-based recommendation with graph neural networks,” in Proc. 28th ACM Int. Conf. Inf. Knowl. Manage., 2019, pp. 579–588.
[26]
A. Pal, C. Eksombatchai, Y. Zhou, B. Zhao, C. Rosenberg, and J. Leskovec, “PinnerSage: Multi-modal user embedding framework for recommendations at Pinterest,” in Proc. 26th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2020, pp. 2311–2320.
[27]
Y. Koren, “Factorization meets the neighborhood: A multifaceted collaborative filtering model,” in Proc. 14th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2008, pp. 426–434.
[28]
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Item-based collaborative filtering recommendation algorithms,” in Proc. 10th Int. Conf. World Wide Web, 2001, pp. 285–295.
[29]
T. Kameda and R. Hastie, Herd Behavior. Atlanta, GA, USA: American Cancer Society, 2015, pp. 1–14.
[30]
J. Dean and S. Ghemawat, “MapReduce: Simplified data processing on large clusters,” Commun. ACM, vol. 51, no. 1, pp. 107–113, 2008.
[31]
J. Duchi, E. Hazan, and Y. Singer, “Adaptive subgradient methods for online learning and stochastic optimization,” J. Mach. Learn. Res., vol. 12, no. 7, pp. 2121–2159, 2011.
[32]
G. Guo, H. Wang, D. Bell, Y. Bi, and K. Greer, “KNN model-based approach in classification,” in Proc. OTM Confederated Int. Conf. Move Meaningful Internet Syst., 2003, pp. 986–996.
[33]
E. Cho, S. A. Myers, and J. Leskovec, “Friendship and mobility: User movement in location-based social networks,” in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2011, pp. 1082–1090.
[34]
H. Yinget al., “Sequential recommender system based on hierarchical attention networks,” in Proc. 27th Int. Joint Conf. Artif. Intell., 2018, pp. 3926–3932.
[35]
B. Lika, K. Kolomvatsos, and S. Hadjiefthymiades, “Facing the cold start problem in recommender systems,” Expert Syst. Appl., vol. 41, no. 4, pp. 2065–2073, 2014.
[36]
S. Wiegreffe and Y. Pinter, “Attention is not not explanation,” in Proc. Conf. Empir. Methods Natural Lang. Process. 9th Int. Joint Conf. Natural Lang. Proc., 2019, pp. 11–20.
[37]
M. F. Dacrema, P. Cremonesi, and D. Jannach, “Are we really making much progress? A worrying analysis of recent neural recommendation approaches,” in Proc. 13th ACM Conf. Recommender Syst., 2019, pp. 101–109.
[38]
L. van der Maaten and G. Hinton, “Visualizing data using t-SNE,” J. Mach. Learn. Res., vol. 9, no. 86, pp. 2579–2605, 2008.
[39]
Z. Fan, Z. Liu, L. Zheng, S. Wang, and P. S. Yu, “Modeling sequences as distributions with uncertainty for sequential recommendation,” in Proc. 30th ACM Int. Conf. Inf. Knowl. Manage., 2021, pp. 3019–3023.
[40]
C. C. Aggarwal, Recommender Systems: The Textbook, 1st ed. Berlin, Germany: Springer, 2016.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering  Volume 35, Issue 4
April 2023
1091 pages

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 April 2023

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Ranking on user–item heterogeneous graph for Ecommerce next basket recommendationsKnowledge-Based Systems10.1016/j.knosys.2024.111863296:COnline publication date: 19-Jul-2024
  • (2024)Online grocery shopping recommender systemsComputers in Human Behavior10.1016/j.chb.2024.108336159:COnline publication date: 1-Oct-2024
  • (2024)Intention enhanced mixed attentive model for session-based recommendationData Mining and Knowledge Discovery10.1007/s10618-024-01023-038:4(2032-2061)Online publication date: 1-Jul-2024
  • (2023)Attribute-enhanced Dual Channel Representation Learning for Session-based RecommendationProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3615245(3793-3797)Online publication date: 21-Oct-2023
  • (2023)Modeling Sequential Collaborative User Behaviors For Seller-Aware Next Basket RecommendationProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614973(1097-1106)Online publication date: 21-Oct-2023
  • (2023)Multi-view Multi-aspect Neural Networks for Next-basket RecommendationProceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3539618.3591738(1283-1292)Online publication date: 19-Jul-2023
  • (2023)Knowledge-enhanced Multi-View Graph Neural Networks for Session-based RecommendationProceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3539618.3591706(352-361)Online publication date: 19-Jul-2023

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media