A Novel K-medoids clustering recommendation algorithm based on probability distribution for collaborative filtering

Data sparsity is a widespread problem of collaborative filtering (CF) recommendation algorithms. However, some common CF methods cannot adequately utilize all user rating information; they are only able to use a small part of the rating data, depending on the co-rated items, which leads to low predi...

Ausführliche Beschreibung