Preference relation-based Markov random fields for recommender systems

Publication Type:
Conference Proceeding
Citation:
ACML 2015 - 7th Asian Conference on Machine Learning, 2015, pp. 157 - 172
Issue Date:
2015-01-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
liu15.pdfPublished version525.25 kB
Adobe PDF
© 2015 S. Liu, G. Li, T. Tran & Y. Jiang. A preference relation-based Top-N recommendation approach, PrefMRF, is proposed to capture both the second-order and the higher-order interactions among users and items. Traditionally Top-N recommendation was achieved by predicting the item ratings first, and then inferring the item rankings, based on the assumption of availability of explicit feedbacks such as ratings, and the assumption that optimizing the ratings is equivalent to optimizing the item rankings. Nevertheless, both assumptions are not always true in real world applications. The proposed PrefMRF approach drops these assumptions by explicitly exploiting the preference relations, a more practical user feedback. Comparing to related work, the proposed PrefMRF approach has the unique property of modeling both the second-order and the higher-order interactions among users and items. To the best of our knowledge, this is the first time both types of interactions have been captured in preference relation-based method. Experiment results on public datasets demonstrate that both types of interactions have been properly captured, and significantly improved Top-N recommendation performance has been achieved.
Please use this identifier to cite or link to this item: