Time-aware parallel collaborative filtering movie recommendation based on Spark
by Jing Zhang; Dan Yang
International Journal of Embedded Systems (IJES), Vol. 13, No. 4, 2020

Abstract: Most of the traditional collaborative filtering (CF) recommendation models mainly consider the users' ratings on items, often ignore the time context information of users. However this information is non-trivial to improve the effectiveness of recommender system. A time-aware parallel CF movie recommendation based on Spark is proposed in this paper. The CF algorithm based on matrix factorisation can associate users' interests with items through implicit features and solve the sparse matrix problem. The time-aware CF algorithm considers the dynamic features associated with the items and users, which improves the recommendation accuracy by introducing discrete time parameter into the matrix factorisation model. To solve the problem of the slow processing speed of high volume data, distributed computing based on Spark is used to achieve the parallelisation of the algorithm. The experimental results on real dataset MovieLens show that the proposed method performs significantly better than traditional CF recommendation, which can alleviate the problem of data sparsity and significantly improve the processing speed and recommendation accuracy.

Online publication date: Tue, 27-Oct-2020

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 Embedded Systems (IJES):
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 subs@inderscience.com