|
| | | |
Preference Networks: Probabilistic Models for Recommendation Systems
Truyen, T.T., Phung, D.Q. and Venkatesh, S.
Recommender systems are important to help users select
relevant and personalised information over massive
amounts of data available. We propose an unified framework
called Preference Network (PN) that jointly models
various types of domain knowledge for the task of recommendation.
The PN is a probabilistic model that systematically
combines both content-based filtering and collaborative
filtering into a single conditional Markov random
field. Once estimated, it serves as a probabilistic database
that supports various useful queries such as rating prediction
and top-N recommendation. To handle the challenging
problem of learning large networks of users and
items, we employ a simple but effective pseudo-likelihood
with regularisation. Experiments on the movie rating data
demonstrate the merits of the PN. |
Cite as: Truyen, T.T., Phung, D.Q. and Venkatesh, S. (2007). Preference Networks: Probabilistic Models for Recommendation Systems. In Proc. Sixth Australasian Data Mining Conference (AusDM 2007), Gold Coast, Australia. CRPIT, 70. Christen, P., Kennedy, P. J., Li, J., Kolyshkina, I. and Williams, G. J., Eds. ACS. 195-202. |
(from crpit.com)
(local if available)
|
|