Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems

PDF

Maximum likelihood estimation

Publication Year

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Tripdecoder: Study Travel Time Attributes And Route Preferences Of Metro Systems From Smart Card Data, Xiancai Tian, Baihua Zheng, Yazhe Wang, Hsao-Ting Huang, Chih-Cheng Hung May 2021

Tripdecoder: Study Travel Time Attributes And Route Preferences Of Metro Systems From Smart Card Data, Xiancai Tian, Baihua Zheng, Yazhe Wang, Hsao-Ting Huang, Chih-Cheng Hung

Research Collection School Of Computing and Information Systems

In this paper, we target at recovering the exact routes taken by commuters inside a metro system that are not captured by an Automated Fare Collection (AFC) system and hence remain unknown. We strategically propose two inference tasks to handle the recovering, one to infer the travel time of each travel link that contributes to the total duration of any trip inside a metro network and the other to infer the route preferences based on historical trip records and the travel time of each travel link inferred in the previous inference task. As these two inference tasks have interrelationship, most …


An Economic Analysis Of Consumer Learning On Entertainment Shopping Websites, Jin Li, Zhiling Guo, Geoffrey K.F. Tso Jan 2019

An Economic Analysis Of Consumer Learning On Entertainment Shopping Websites, Jin Li, Zhiling Guo, Geoffrey K.F. Tso

Research Collection School Of Computing and Information Systems

Online entertainment shopping, normally supported by the pay-to-bid auction mechanism, represents an innovative business model in e-commerce. Because the unique selling mechanism combines features of shopping and online auction, consumers expect both monetary return and entertainment value from their participation. We propose a dynamic structural model to analyze consumer behaviors on entertainment shopping websites. The model captures the consumer learning process, based both on individual participation experiences and also on observational learning of historical auction information. We estimate the model using a large data set from an online entertainment shopping website. Results show that consumers’ initial participation incentives mainly come …


A Method Of Integrating Correlation Structures For A Generalized Recursive Route Choice Model, Tien Mai Nov 2016

A Method Of Integrating Correlation Structures For A Generalized Recursive Route Choice Model, Tien Mai

Research Collection School Of Computing and Information Systems

We propose a way to estimate a generalized recursive route choice model. The model generalizes other existing recursive models in the literature, i.e., (Fosgerau et al., 2013b; Mai et al., 2015c), while being more flexible since it allows the choice at each stage to be any member of the network multivariate extreme value (network MEV) model (Daly and Bierlaire, 2006). The estimation of the generalized model requires defining a contraction mapping and performing contraction iterations to solve the Bellman’s equation. Given the fact that the contraction mapping is defined based on the choice probability generating functions (CPGF) (Fosgerau et al., …


A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger May 2015

A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger

Research Collection School Of Computing and Information Systems

We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination. The value …