SPMF: A Social Trust and Preference Segmentation-based Matrix Factorization Recommendation Algorithm

March 11, 2019 Β· Declared Dead Β· πŸ› EURASIP Journal on Wireless Communications and Networking

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Wei Peng, Baogui Xin arXiv ID 1903.04489 Category cs.IR: Information Retrieval Cross-listed cs.LG, stat.ML Citations 12 Venue EURASIP Journal on Wireless Communications and Networking Last Checked 4 months ago
Abstract
The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be limited to specific areas. A social trust and preference segmentation-based matrix factorization (SPMF) recommendation system is proposed to solve the above-mentioned problems. Experimental results based on the Ciao and Epinions datasets show that the accuracy of the SPMF algorithm is significantly higher than that of some state-of-the-art recommendation algorithms. The proposed SPMF algorithm is a more accurate and effective recommendation algorithm based on distinguishing the difference of trust relations and preference domain, which can support commercial activities such as product marketing.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted