Preference networks: Probabilistic models for recommendation systems

Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

8 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationData Mining and Analytics 2007 - 6th Australasian Data Mining Conference, AusDM 2007, Proceedings
Number of pages8
Publication statusPublished - 1 Dec 2007
Externally publishedYes
EventAustralasian Data Mining Conference 2007 - Gold Coast, Australia
Duration: 3 Dec 20074 Dec 2007
Conference number: 6th (Proceedings)

Publication series

NameConferences in Research and Practice in Information Technology Series
ISSN (Print)1445-1336


ConferenceAustralasian Data Mining Conference 2007
Abbreviated titleAusDM 2007
CityGold Coast
Internet address


  • Collaborative filtering
  • Conditional markov networks
  • Hybrid recommender systems
  • Movie rating
  • Preference networks

Cite this