Name
Abstract | ||
|---|---|---|
Due to the sharply increasing number of users and venues in Location-Based Social Networks, it becomes a big challenge to provide recommendations which match users’ preferences. Furthermore, the sparse data and skew distribution (i.e., structural noise) also worsen the coverage and accuracy of recommendations. This problem is prevalent in traditional recommender methods since they assume that the collected data truly reflect users’ preferences. To overcome the limitation of current recommenders, it is imperative to explore an effective strategy, which can accurately provide recommendations while tolerating the structural noise. However, few study concentrates on the process of noisy data in the recommender system, even recent matrix-completion algorithms. In this paper, we cast the location recommendation as a mathematical matrix-completion problem and propose a robust algorithm named Linearized Bregman Iteration for Matrix Completion (LBIMC), which can effectively recover the user-location matrix considering structural noise and provide recommendations based solely on check-in records. Our experiments are conducted by an amount of check-in data from Foursquare, and the results demonstrate the effectiveness of LBIMC. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10618-017-0516-z | Data Min. Knowl. Discov. |
Keywords | Field | DocType |
LBSNs,Recommender system,Check-in,Structural noise,Bregman iteration | Recommender system,Data mining,Bregman iteration,Social network,Check-in,Matrix completion,Computer science,Matrix (mathematics),Artificial intelligence,Skew,Machine learning,Sparse matrix | Journal |
Volume | Issue | ISSN |
32 | 1 | 1384-5810 |
Citations | PageRank | References |
0 | 0.34 | 22 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Xia | 1 | 1 | 3.41 |
| Tao Li | 2 | 387 | 41.20 |
| Li Qian-Mu | 3 | 33 | 14.78 |
| Hong Zhang | 4 | 19 | 5.87 |