방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Bradley-Terry 모델× | 순위 통합 방법× | |
|---|---|---|
| 분야 | 의사결정 | 의사결정 |
| 계열≠ | Regression model | Machine learning |
| 기원 연도≠ | 1952 | 2001 |
| 창시자≠ | Ralph Bradley & Milton Terry | Dwork, Kumar, Naor & Sivakumar |
| 유형≠ | Probabilistic paired comparison model | Combinatorial ranking method |
| 원전≠ | Bradley, R. A., & Terry, M. E. (1952). Rank analysis of incomplete block designs: I. The method of paired comparisons. Biometrika, 39(3/4), 324–345. 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 ↗ |
| 별칭 | BT Model, Bradley-Terry-Luce Model, Paired Comparison Model, İkili Karşılaştırma Modeli | Rank Fusion, Order Aggregation, Preference Aggregation, Sıralama Birleştirme |
| 관련≠ | 3 | 2 |
| 요약≠ | The Bradley-Terry model is a probabilistic model for paired comparisons that assigns a latent strength parameter to each item and predicts the probability that one item beats another in a head-to-head contest. Introduced by Ralph A. Bradley and Milton E. Terry in 1952, it provides a principled statistical framework for ranking items from pairwise preference data, including incomplete comparison designs where not every pair is directly observed. | 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데이터셋 ↗ |
|
|