Probabilistic models over ordered partitions with applications in document ranking and collaborative filtering
Truyen, Tran The, Phung, Dinh Q. and Venkatesh, Svetha 2011, Probabilistic models over ordered partitions with applications in document ranking and collaborative filtering, in SDM 2011 : Proceedings of the 11th SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics, Philadelphia, Pa., pp. 426-437.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
Probabilistic models over ordered partitions with applications in document ranking and collaborative filtering
Ranking is an important task for handling a large amount of content. Ideally, training data for supervised ranking would include a complete rank of documents (or other objects such as images or videos) for a particular query. However, this is only possible for small sets of documents. In practice, one often resorts to document rating, in that a subset of documents is assigned with a small number indicating the degree of relevance. This poses a general problem of modelling and learning rank data with ties. In this paper, we propose a probabilistic generative model, that models the process as permutations over partitions. This results in super-exponential combinatorial state space with unknown numbers of partitions and unknown ordering among them. We approach the problem from the discrete choice theory, where subsets are chosen in a stagewise manner, reducing the state space per each stage significantly. Further, we show that with suitable parameterisation, we can still learn the models in linear time. We evaluate the proposed models on two application areas: (i) document ranking with the data from the recently held Yahoo! challenge, and (ii) collaborative filtering with movie data. The results demonstrate that the models are competitive against well-known rivals.
ISBN
9780898719925
Language
eng
Field of Research
089999 Information and Computing Sciences not elsewhere classified
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.