ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Мултиномиална логистична регресия×Методи за агрегиране на рангове×
ОбластИконометрияВземане на решения
СемействоRegression modelMachine learning
Година на възникване19742001
СъздателMcFaddenDwork, Kumar, Naor & Sivakumar
ТипMultinomial logistic regressionCombinatorial ranking method
Основополагащ източникMcFadden, D. (1974). Conditional Logit Analysis of Qualitative Choice Behavior. In P. Zarembka (Ed.), Frontiers in Econometrics (pp. 105-142). Academic Press. ISBN: 978-0127761503Dwork, 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 ↗
Други названияmultinomial logistic regression, polytomous logistic regression, softmax regression, Çok Kategorili Lojistik RegresyonRank Fusion, Order Aggregation, Preference Aggregation, Sıralama Birleştirme
Свързани52
РезюмеMultinomial logistic regression is a maximum-likelihood method for a nominal (unordered) dependent variable with more than two categories. Building on McFadden's 1974 treatment of qualitative choice, it gives each category its own set of coefficients relative to a reference category.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Набор от данни
  1. v1
  2. 1 Източници
  3. PUBLISHED
  1. v1
  2. 1 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Multinomial Logit · Rank Aggregation. Извлечено на 2026-06-19 от https://scholargate.app/bg/compare