Precomputed Clustering for Movie Recommendation System in Real Time. (25th June 2014)

• Record Type: Journal Article
• Authors: Li, Bo; Liao, Yibin; Qin, Zheng
• Other Names: Luo Guiming Academic Editor.
• Is Part Of: Journal of applied mathematics. Volume 2014(2014)
• Publication Date: 2014-06-25
• Subjects: Mathematics -- Periodicals; 519.05
• DOI: 10.1155/2014/742341
• Languages: English
• ISSNs: 1110-757X

Abstract

Abstract : A recommendation system delivers customized data (articles, news, images, music, movies, etc.) to its users. As the interest of recommendation systems grows, we started working on the movie recommendation systems. Most research efforts in the fields of movie recommendation system are focusing on discovering the most relevant features from users, or seeking out users who share same tastes as that of the given user as well as recommending the movies according to the liking of these sought users or seeking out users who share a connection with other people (friends, classmates, colleagues, etc.) and make recommendations based on those related people's tastes. However, little research has focused on recommending movies based on the movie's features. In this paper, we present a novel idea that applies machine learning techniques to construct a cluster for the movie by implementing a distance matrix based on the movie features and then make movie recommendation in real time. We implement some different clustering methods and evaluate their performance in a real movie forum website owned by one of our authors. This idea can also be used in other types of recommendation systems such as music, news, and articles.