Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Модель Плaкетта-Льюса× | Методы агрегирования рангов× | |
|---|---|---|
| Область | Принятие решений | Принятие решений |
| Семейство≠ | Regression model | Machine learning |
| Год появления≠ | 1975 | 2001 |
| Автор метода≠ | Robin Plackett; R. Duncan Luce | Dwork, Kumar, Naor & Sivakumar |
| Тип≠ | Probabilistic ranking model | Combinatorial ranking method |
| Основополагающий источник≠ | Plackett, R. L. (1975). The analysis of permutations. Journal of the Royal Statistical Society: Series C, 24(2), 193–202. DOI ↗ | Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. Proceedings of the 10th International Conference on World Wide Web, 613–622. DOI ↗ |
| Другие названия | Luce's Choice Axiom Model, Rank-Ordered Logit Model, Exploded Logit Model, Sıralama Tercih Modeli | Rank Fusion, Order Aggregation, Preference Aggregation, Sıralama Birleştirme |
| Связанные≠ | 3 | 2 |
| Сводка≠ | The Plackett-Luce model is a probabilistic framework for analysing and predicting rank-ordered data. Introduced by Robin Plackett (1975) — building on R. Duncan Luce's earlier axiom of choice (1959) — it models the probability of any complete ranking of items as a sequential selection process, where each item's chance of being chosen at each position is proportional to its latent worth parameter. It is widely used in preference learning, recommender systems, and choice modelling. | Rank Aggregation is a family of methods that combine multiple ranked lists of alternatives into a single consensus ranking. Formally studied in the context of web search by Dwork, Kumar, Naor, and Sivakumar (2001), these methods address the problem of synthesizing divergent preference orderings from multiple sources — such as search engines, expert judges, or voter ballots — into one coherent, representative ordering that minimizes overall disagreement across the input rankings. |
| ScholarGateНабор данных ↗ |
|
|