Temporal-based approach to solve item decay problem in recommendation system
The rating matrix of a recommendation system contains a high percentage of data sparsity which lowers the prediction accuracy of the collaborative filtering technique (CF). Recently, the temporal based factorization approaches have been used to solve the sparsity problem, but these approaches have a...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Scientific Publishers
2018
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/64654/1/Temporal-based%20approach%20to%20solve%20item%20decay%20problem%20in%20recommendation%20system.pdf http://psasir.upm.edu.my/id/eprint/64654/ https://www.ingentaconnect.com/contentone/asp/asl/2018/00000024/00000002/art00136 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The rating matrix of a recommendation system contains a high percentage of data sparsity which lowers the prediction accuracy of the collaborative filtering technique (CF). Recently, the temporal based factorization approaches have been used to solve the sparsity problem, but these approaches have a weakness in terms of learning the popularity decay of items during the long-term which lowers the prediction accuracy of the CF technique. The LongTemporalMF approach has been proposed to solve these problems. The x-means algorithm and the bacterial foraging optimization algorithm have been integrated within the LongTemporalMF approach to generate and optimize the genres weights which are integrated with the factorization features and the long-term preferences in terms of personality. The experimental results show that the LongTemporalMF approach has the accurate prediction performance compared to the benchmark approaches. |
|---|