Name
Abstract | ||
|---|---|---|
Multinomial logistic regression is a powerful tool to model choice from a finite set of alternatives, but it comes with an underlying model assumption called the independence of irrelevant alternatives, stating that any item added to the set of choices will decrease all other items' likelihood by an equal fraction. We perform statistical tests of this assumption across a variety of datasets and give results showing how often it is violated. When this axiom is violated, choice theorists will often invoke a richer model known as nested logistic regression, in which information about competition among items is encoded in a tree structure known as a nest. However, to our knowledge there are no known algorithms to induce the correct nest structure. We present the first such algorithm, which runs in quadratic time under an oracle model, and we pair it with a matching lower bound. We then perform experiments on synthetic and real datasets to validate the algorithm, and show that nested logit over learned nests outperforms traditional multinomial regression. Finally, in addition to automatically learning nests, we show how nests may be constructed by hand to test hypotheses about the data, and evaluated by their explanatory power. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2872427.2883025 | WWW |
Keywords | Field | DocType |
sequence mining, repeat consumption, boredom | Logit,Independence of irrelevant alternatives,Computer science,Multinomial logistic regression,Tree structure,Artificial intelligence,Discrete choice,Time complexity,Logistic regression,Statistical hypothesis testing,Machine learning | Conference |
ISBN | Citations | PageRank |
978-1-4503-4143-1 | 9 | 0.60 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Austin R. Benson | 1 | 318 | 26.05 |
| Ravi Kumar | 2 | 13932 | 1642.48 |
| Andrew Tomkins | 3 | 9388 | 1401.23 |