Computing and Informatics

Collaborative filtering is a popular recommendation algorithm. It predicts user's interests according to the ratings or behaviour of other users in the system. However, the collaborative filtering recommender system suffers from several major limitations including scalability, sparsity, and cold start. In this paper, a collaborative filtering recommendation approach using radial basis function (RBF) network and power method is proposed. The proposed system has offline and online phases. In the offline phase, the sparse user-item rating matrix is completed by using RBF network based on Cover's theorem on the separability of patterns. RBF network learning is done by unsupervised kernel-based fuzzy c-means clustering algorithm for selecting RBF centers, and supervised gradient descend method for selecting RBF weights. In the offline phase, we predict non-rated items of a user. Then the full rating matrix is used to rank all the users. The ranking is done by solving an eigenvalue problem. This paper overcomes the scalability problem by clustering the users, the sparsity problem by completing the sparse rating matrix, and the new user cold start problem by recommending the top rated items of the high-ranked user. The results of the experiments, on the benchmark data sets, show that the proposed system produces high quality recommendation, in terms of accuracy and quality.