作者: Rahul Katarya , Om Prakash Verma
DOI: 10.1109/CCAA.2016.7813692
关键词: Similarity (network science) 、 Matrix decomposition 、 Mean absolute percentage error 、 Recommender system 、 Cosine similarity 、 Computer science 、 Data mining 、 Collaborative filtering 、 Cold start 、 Stochastic gradient descent
摘要: Recommender systems are becoming ubiquitous these days to advise important products users. Conventional collaborative filtering methods suffer from sparsity, scalability, and cold start problem. In this work, we have implemented a novel improved method of recommending movies by combining the asymmetric calculating similarity with matrix factorization Tyco (typicality-based filtering). The describes that user A B is not similar as A. Matrix shows items (movies) well users vectors factors derived rating pattern (movies). clusters same genre created, typicality degree (a measure how much movie belongs genre) each in cluster was considered subsequently calculated. between calculated using their genres rather than co-rated items. We had combined employed Pearson correlation coefficient calculate optimize results when compared cosine similarity, Linear Regression make predictions gave better results. research work stochastic gradient descent also used for optimization regularization avoid problem over fitting. All approaches together provide prediction handle problems start, scalability conventional methods. Experimental confirm our HYBRTyco gives regarding mean absolute error (MAE)and percentage (MAPE), especially on sparse dataset.