An Efficient Approach for Rational Next-Basket Recommendation

E-commerce is one of the most valuable and popular application scenarios of recommendation technology. In this context, making rational decisions is required due to the necessity of objectivity and decision rationale tracking. However, a significant number of irrational recommendations may be genera...

Full description

Bibliographic Details
Main Authors: Mohammed A. Fouad, Wedad Hussein, Sherine Rady, Philip S. Yu, Tarek F. Gharib
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9832906/
Description
Summary:E-commerce is one of the most valuable and popular application scenarios of recommendation technology. In this context, making rational decisions is required due to the necessity of objectivity and decision rationale tracking. However, a significant number of irrational recommendations may be generated as a result of using a narrow range of interestingness criteria, considering inconsistent user preferences, overlooking the temporal weights of items, and using outlier choices in making a prediction. In this paper, we propose an efficient approach called MONBR (Multi-Objective Next-Basket Recommendation) to improve the quality of recommendations. An approach promotes rational recommendations by measuring the temporal importance of items to the user using several interestingness criteria, namely utility, popularity, stability, frequency, occupancy, and novelty. Moreover, combining the multi-criteria weights of items obtained from the MONBR approach with the item-based collaborative filtering technique results in more accurate and reasonable recommendations. Experiment results on real-world datasets demonstrate the importance of adapting objectivity and rationality in the recommendation process to improve the quality of recommendations while meeting the needs of as many users as possible. The proposed approach generates recommendations that are up to 60.95 % more accurate than state-of-the-art algorithms, with recommended basket sizes ranging from 10 to 100. Furthermore, the average user-level performance is improved by up to 10.21 % on dense datasets.
ISSN:2169-3536