Abstract

In the machine learning model, intelligent recommendation system can select valuable information from a lot of data to help users find the products or services they need, which has been more and more widely used in recent years. However, there are still many problems in machine learning recommender systems, such as data sparsity, natural noise, and cold start, which leads to the fact that machine learning recommender systems cannot obtain accurate user preferences. When a project is rated, the quality of the recommendation is greatly affected. In order to solve the problem that the existing recommendation algorithms have poor recommendation results in sparse data sets, this paper proposes a machine learning method for recommendation rating prediction based on user interest concept lattice. Firstly, the nearest neighbors are divided into direct nearest neighbors and indirect nearest neighbors by user interest concept lattice. Then, different methods are used to calculate the similarity between the direct “nearest neighbor” and the target user, and the similarity between the indirect “nearest neighbor” and the target user. Finally, the invisible item score of the target user is calculated by the similarity value. Experiments are carried out on real data sets, and the experimental results show that the CFCNN-CL algorithm and RRP-UI CL algorithm proposed in this paper have high recommendation accuracy and still have good performance in the case of sparse data.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call