Probabilistic models over ordered partitions with applications in document ranking and collaborative filtering

Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh

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

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 11th SIAM International Conference on Data Mining, SDM 2011
Pages426-437
Number of pages12
Publication statusPublished - 1 Dec 2011
Externally publishedYes
Event11th SIAM International Conference on Data Mining, SDM 2011 - Mesa, United States of America
Duration: 28 Apr 201130 Apr 2011

Publication series

NameProceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

Conference

Conference11th SIAM International Conference on Data Mining, SDM 2011
CountryUnited States of America
CityMesa
Period28/04/1130/04/11

Cite this

Truyen, T. T., Phung, D. Q., & Venkatesh, S. (2011). Probabilistic models over ordered partitions with applications in document ranking and collaborative filtering. In Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011 (pp. 426-437). (Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011).