An optimal matching algorithm for e-commerce recommendation information based on matrix decomposition Online publication date: Tue, 14-Nov-2023
by Liming Wang; Wenxue Liu; Huichuan Liu
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 16, No. 6, 2023
Abstract: Aiming at the problems of data sparsity and cold start in traditional e-commerce recommendation information matching, an optimal matching algorithm for e-commerce recommendation information based on matrix decomposition is proposed. On the basis of e-commerce behaviour, the optimal user behaviour is obtained by decomposing the user's behaviour and the user's preference, and then the optimal user behaviour is obtained by decomposing the user's behaviour and the user's preference. The experimental results show that compared with the traditional optimal matching algorithm for recommendation information, the proposed optimal matching algorithm for e-commerce recommendation information based on matrix decomposition has a higher area under curve (AUC) value and a lower root-mean-square error (RMSE) value, and the performance of recommendation information matching is better.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook