Name
Abstract | ||
|---|---|---|
As one of the most popular recommender technologies, Collaborative Filtering (CF) has been widely deployed in industry due to its simplicity and interpretability. However, it is facing great challenge to generate accurate similarities between users or items because of data sparsity. This will cause second order error in the process of using weighted sum as prediction. To alleviate this problem, we propose several methods to learn more accurate item similarities by minimizing the squared prediction error. This optimization problem is solved using Stochastic Gradient Descent. A comprehensive set of experiments on two real-world datasets at error and classification metrics indicate that the proposed methods can achieve comparable or even better performance than other state-of-the-art recommendation methods of Matrix Factorization, and greatly outperform traditional item based CF method. Besides, the proposed methods inherit the interpretability of item based CF, which makes the recommended results more accessible compared to competing methods of Matrix Factorization. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/AINA.2015.285 | AINA |
Keywords | Field | DocType |
correlation,optimization,accuracy,stochastic processes,stochastic gradient descent,prediction algorithms,matrix decomposition,collaborative filtering,matrix factorization,collaboration,recommender systems | Similarity learning,Recommender system,Data mining,Interpretability,Stochastic gradient descent,Mean squared prediction error,Collaborative filtering,Computer science,Matrix decomposition,Artificial intelligence,Optimization problem,Machine learning | Conference |
ISSN | Citations | PageRank |
1550-445X | 3 | 0.40 |
References | Authors | |
15 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feng Xie | 1 | 20 | 1.71 |
| Zhen Chen | 2 | 218 | 36.23 |
| Jiaxing Shang | 3 | 60 | 11.34 |
| Wen-Liang Huang | 4 | 3 | 0.40 |
| Jun Li | 5 | 338 | 38.15 |