Analytic approximations for computing probit choice probabilities
Analytic approximations for computing probit choice probabilities
复制标题
计算概率选择概率的解析近似
DOI:
10.1080/18128602.2012.702794
复制
发表时间:
2012
期刊:
影响因子:
--
通讯作者:
Connors R
中科院分区:
文献类型:
--
作者:
Connors R
The multinomial probit model has long been used in transport applications as the basis for mode- and route-choice in computing network flows, and in other choice contexts when estimating preference parameters. It is well known that computation of the probit choice probabilities presents a significant computational burden, since they are based on multivariate normal integrals. Various methods exist for computing these choice probabilities, though standard Monte Carlo is most commonly used. In this article we compare two analytical approximation methods (Mendell–Elston and Solow–Joe) with three Monte Carlo approaches for computing probit choice probabilities. We systematically investigate a wide range of parameter settings and report on the accuracy and computational efficiency of each method. The findings suggest that the accuracy and efficiency of an optimally ordered Mendell–Elston analytic approximation method offers great potential for wider use.
登录
查看更多内容
DOI:
--
发表时间:
2007
期刊:
影响因子:
--
作者:
Yamamoto;et al.
通讯作者:
et al.
影响因子:
0.8
作者:
Lung-fei Lee
通讯作者:
Lung-fei Lee
影响因子:
4.6
作者:
M. Langdon
通讯作者:
M. Langdon
影响因子:
--
作者:
K. Pearson
通讯作者:
K. Pearson
影响因子:
1.9
作者:
STIRATELLI, R;LAIRD, N;WARE, JH
通讯作者:
WARE, JH