Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach
Learning preference models from human generated data is an important task in modern information processing systems. Its popular setting consists of simple input ratings, assigned with numerical values to indicate their relevancy with respect to a specific query. Since ratings are often specified wit...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Springer-Verlag London Ltd
2015
|
| Online Access: | http://hdl.handle.net/20.500.11937/35961 |
| _version_ | 1848754637667041280 |
|---|---|
| author | Tran, The Truyen Phung, D. Venkatesh, S. |
| author_facet | Tran, The Truyen Phung, D. Venkatesh, S. |
| author_sort | Tran, The Truyen |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Learning preference models from human generated data is an important task in modern information processing systems. Its popular setting consists of simple input ratings, assigned with numerical values to indicate their relevancy with respect to a specific query. Since ratings are often specified within a small range, several objects may have the same ratings, thus creating ties among objects for a given query. Dealing with this phenomena presents a general problem of modelling preferences in the presence of ties and being query-specific. To this end, we present in this paper a novel approach by constructing probabilistic models directly on the collection of objects exploiting the combinatorial structure induced by the ties among them. The proposed probabilistic setting allows exploration of a super-exponential combinatorial state-space with unknown numbers of partitions and unknown order among them. Learning and inference in such a large state-space are challenging, and yet we present in this paper efficient algorithms to perform these tasks. Our approach exploits discrete choice theory, imposing generative process such that the finite set of objects is partitioned into subsets in a stagewise procedure, and thus reducing the state-space at each stage significantly. Efficient Markov chain Monte Carlo algorithms are then presented for the proposed models. We demonstrate that the model can potentially be trained in a large-scale setting of hundreds of thousands objects using an ordinary computer. In fact, in some special cases with appropriate model specification, our models can be learned in linear time. We evaluate the models on two application areas: (i) document ranking with the data from the Yahoo! challenge and (ii) collaborative filtering with movie data. We demonstrate that the models are competitive against state-of-the-arts. |
| first_indexed | 2025-11-14T08:43:35Z |
| format | Journal Article |
| id | curtin-20.500.11937-35961 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:43:35Z |
| publishDate | 2015 |
| publisher | Springer-Verlag London Ltd |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-359612017-09-13T15:18:39Z Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach Tran, The Truyen Phung, D. Venkatesh, S. Learning preference models from human generated data is an important task in modern information processing systems. Its popular setting consists of simple input ratings, assigned with numerical values to indicate their relevancy with respect to a specific query. Since ratings are often specified within a small range, several objects may have the same ratings, thus creating ties among objects for a given query. Dealing with this phenomena presents a general problem of modelling preferences in the presence of ties and being query-specific. To this end, we present in this paper a novel approach by constructing probabilistic models directly on the collection of objects exploiting the combinatorial structure induced by the ties among them. The proposed probabilistic setting allows exploration of a super-exponential combinatorial state-space with unknown numbers of partitions and unknown order among them. Learning and inference in such a large state-space are challenging, and yet we present in this paper efficient algorithms to perform these tasks. Our approach exploits discrete choice theory, imposing generative process such that the finite set of objects is partitioned into subsets in a stagewise procedure, and thus reducing the state-space at each stage significantly. Efficient Markov chain Monte Carlo algorithms are then presented for the proposed models. We demonstrate that the model can potentially be trained in a large-scale setting of hundreds of thousands objects using an ordinary computer. In fact, in some special cases with appropriate model specification, our models can be learned in linear time. We evaluate the models on two application areas: (i) document ranking with the data from the Yahoo! challenge and (ii) collaborative filtering with movie data. We demonstrate that the models are competitive against state-of-the-arts. 2015 Journal Article http://hdl.handle.net/20.500.11937/35961 10.1007/s10115-015-0840-9 Springer-Verlag London Ltd restricted |
| spellingShingle | Tran, The Truyen Phung, D. Venkatesh, S. Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach |
| title | Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach |
| title_full | Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach |
| title_fullStr | Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach |
| title_full_unstemmed | Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach |
| title_short | Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach |
| title_sort | modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach |
| url | http://hdl.handle.net/20.500.11937/35961 |