User collaborative filtering recommendation algorithm based on adaptive parametric optimisation SSPSO
by Xiuqin Pan; Wenmin Zhou; Yong Lu; Ruixiang Li
International Journal of Computing Science and Mathematics (IJCSM), Vol. 8, No. 6, 2017

Abstract: Recommendation algorithm is one of the hot issues in the field of computer science, and is widely used in many aspects. Various types of e-commerce systems and applications need to use recommendation system to support. Collaborative filtering recommendation algorithm has been widely used in e-commerce system for its high recommendation accuracy. In order to improve the performance of the process of clustering and selection of nearest neighbours in collaborative filtering, there are several optimisation proposals in this paper directly to the recommendation algorithm which is based on the adaptive parametric optimisation semi-supervised PSO clustering (APO_SSPSO). This paper uses MovieLens data sets to compare the performance of the proposed method and the traditional collaborative filtering recommendation algorithm. Simulation has proved that this recommendation algorithm has accuracy and effectiveness in enhancing the performance of user collaborative filtering recommendation system. And to some extent, the algorithm has minimised space consumption.

Online publication date: Wed, 03-Jan-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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