IMPROVEMENT OF SVD ALGORITHM TO INCREASE THE EFFICIENCY OF RECOMMENDATION SYSTEMS
Main Article Content
Abstract
Many existing websites use recommendation systems for their users. They generate various offers for them, for example, similar products or recommend the people registered on this site with similar interests. Such referral mechanisms process vast amounts of information to identify potential user preferences. Recommendation systems are programs that try to determine what users want to find, what might interest them, and recommend it to them. These mechanisms have improved the interaction between the user and the site. Instead of static information, they provide dynamic information that changes: recommendations are generated separately for each user, based on his previous activity on this web resource. Information from other visitors may also be taken into account. The methods of collecting information provided by the Internet have greatly simplified the use of human thought through collaborative filtering. But, on the other hand, the large amount of information complicates the implementation of this possibility. For example, the behavior of some people is quite clearly amenable to modeling, while others behave completely unpredictably. And it is the latter that affect the shift of the results of the recommendation system and reduce its effectiveness. An analysis of Internet resources has shown that most of the recommendation systems do not provide recommendations to users, and the part that does, for example, offers products to the user, selects recommendations manually. Therefore, the task of developing methods for automated generation of recommendations for a limited set of input data is quite relevant. The problems of data sparseness, new user problem, scalability of the widely used SVD algorithm for the development of such recommendation systems are proposed to be eliminated by improving this algorithm by the method of the nearest k-neighbors. This method will allow you to easily segment and cluster system data, which will save system resources.
Article Details
References
Roisner, M. (2020), How recommender systems work, available at: https://habrahabr.ru/company/yandex/blog/241455/
Goncharov, M. (2020), Data Mining: Recommender Systems, available at: http://kek.ksu.ru/EOS/WM/50_132-670.pdf.
Koroleva, D. (2020), Analysis of recommendation systems learning algorithms, available at:
http://engjournal.ru/articles/816/816.pdf.
(2021), Singular value decomposition, available at: http://www.machinelearning.ru/wiki/index.php?title=%D0%A1% D0%B8%D0%BD%D0%B3%D1%83%D0%BB%D1%8F%D1%80%D0%BD%D0%BE%D0%B5_%D1%80%D0%B0%D0%B7%D0%BB%D0%BE%D0%B6%D0%B5%D0%BD%D0%B8%D0%B5
(2021), Gradient descent: everything you need to know, available at: https://neurohive.io/ru/osnovy-data-science/gradient-descent/
(2021), The method of k-nearest neighbors, available at: http://om.univ.kiev.ua/users_upload/15/upload/file/pr_lecture_03.pdf
Krepych, S.Ya., Dzhulii, M.V. (2017), “Software system to support the selection of books on fuzzy criteria”, Modern computer information technologies: Proceedings of the All-Ukrainian conference with inte. participation ASIT’2017, Ternopil: TNEU, р. 144-145.