抄録
Given a set of rating data for a set of items, determining preference levels of items is amatter of importance. Various probability models have been proposed to solve this task. One such model is the Plackett-Luce model, which parameterizes the preference level of each item by a real value. In this letter, the Plackett-Luce model is generalized to cope with grouped ranking observations such as movie or restaurant ratings. Since it is difficult to maximize the likelihood of the proposed model directly, a feasible approximation is derived, and the em algorithm is adopted to find the model parameter by maximizing the approximate likelihood which is easily evaluated. The proposed model is extended to a mixture model, and two applications are proposed. To show the effectiveness of the proposed model, numerical experiments with real-world data are carried out.
本文言語 | English |
---|---|
ページ(範囲) | 2417-2451 |
ページ数 | 35 |
ジャーナル | Neural Computation |
巻 | 22 |
号 | 9 |
DOI | |
出版ステータス | Published - 2010 9月 |
ASJC Scopus subject areas
- 人文科学(その他)
- 認知神経科学