Abstract
We consider the over-fitting problem for multinomial probabilistic Latent Semantic Analysis (pLSA) in collaborative filtering, using a regularization approach. For big data applications, the computational complexity is at a premium and we, therefore, consider a maximum a posteriori approach based on conjugate priors that ensure that complexity of each step remains the same as compared to the un-regularized method. In the numerical section, we show that the proposed regularization method and training scheme yields an improvement on commonly used data sets, as compared to previously proposed heuristics.
Original language | English |
---|---|
Title of host publication | 25th European Signal Processing Conference, EUSIPCO 2017 |
Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
Pages | 2501-2505 |
Number of pages | 5 |
Volume | 2017-January |
ISBN (Electronic) | 9780992862671 |
DOIs | |
Publication status | Published - 2017 Oct 23 |
Event | 25th European Signal Processing Conference, EUSIPCO 2017 - Kos island, Kos, Greece Duration: 2017 Aug 28 → 2017 Sept 2 |
Conference
Conference | 25th European Signal Processing Conference, EUSIPCO 2017 |
---|---|
Country/Territory | Greece |
City | Kos |
Period | 2017/08/28 → 2017/09/02 |
Subject classification (UKÄ)
- Signal Processing
Free keywords
- Collaborative filtering
- Conjugate prior regularization
- Probabilistic latent semantic analysis
- Recommender systems