Structural estimation for a route choice model with uncertain measurement

Size: px
Start display at page:

Download "Structural estimation for a route choice model with uncertain measurement"

Transcription

1 Structural estimation for a route choice model with uncertain measurement Yuki Oyama* & Eiji Hato *PhD student Behavior in Networks studies unit Department of Urban Engineering School of Engineering, The University of Tokyo September 25, 2016 Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Sep. 25, 2016

2 Outline Outline Outline 1. Introduction 2. Link-based route measurement model 3. Structural estimation method 4. Numerical examples 5. Conclusions Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

3 Outline Outline Outline 1. Introduction 2. Link-based route measurement model 3. Structural estimation method 4. Numerical examples 5. Conclusions Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

4 Motivation Route choice analysis Introduction Parameter estimation results largely depend on accuracy of route measurement GPS data Route measurement model Route choice data Route choice model Estimated parameters Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

5 Motivation Route choice analysis Introduction Parameter estimation results largely depend on accuracy of route measurement GPS data Route measurement model Route choice data Route choice model Estimated parameters Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

6 Motivation Introduction Pedestrian route choice analysis Measurement uncertainty; Dense and high-resolution network N Dense network Spatial dependence of Measurement errors ü Along river ü Wide street ü Narrow street ü With arcade (m) Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

7 Literature review Introduction Route measurement models (1) Sequential approach infers the true location at each data in chorological order : GPS data Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

8 Literature review Introduction Route measurement models (1) Sequential approach can output meaningless paths Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

9 Literature review Introduction Route measurement models (2) Path-based probabilistic approach evaluates path likelihood regarding all GPS data included in a trip Pyo et al. (2001); Bierlaire et al. (2013) Domain of Data Relevance Likelihood 10% 40% 50% Path 1 Path 2 Path 3 Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

10 Literature review Introduction Route measurement models (2) Path-based probabilistic approach suffers with trade-off between computational efficiency and measurement accuracy Pyo et al. (2001); Bierlaire et al. (2013) Large Small Path candidate set Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

11 Literature review Introduction Route measurement models (2) Assuming error variance constant on network distort measurement probabilities PDF of GPS measurement error: p( ˆx j x j ;σ ) = ˆx j x j σ 2 " exp$ ˆx j x j $ 2σ 2 # 2 % ' ' & σ : Large σ : Small Measurement probability ˆx t j x j = d σ =10 σ = 50 σ = Distance from the true location Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

12 Literature review Introduction Route measurement models (3) Bayesian approach incorporates behavioral models into measurement models Chen et al. (2013); Danalet et al. (2014) Prior (Route choice model) 25% 15% 60% Measurement 10% 40% 50% Posterior 16% 6% 78% Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

13 Literature review Introduction Route measurement models (3) Bayesian approach has a problem regarding parameter inconsistency Given parameters Arbitrary Previous study Other data GPS data Route measurement model Route choice model Prob. Route choice data Route choice model Estimated parameters Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

14 Literature review Introduction Route measurement models Challenges: Disconnected path Not suitable for route choice models Setting of the measurement parameter Possible to miss the true path Ignorance of spatial difference distorts path likelihood Parameter inconsistency of route choice model Estimated parameter includes biases regarding initial parameter Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

15 Framework Introduction Framework 1. Link-based route measurement model Matching each decomposed trip data to a link Estimating a measurement parameter for each link Incorporating a link-based route choice model as prior 2. Structural estimation method Parameters at convergence satisfy the parameter consistency of the route choice model Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

16 Outline Outline Outline 1. Introduction 2. Link-based route measurement model 3. Structural estimation method 4. Numerical examples 5. Conclusions Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

17 Problem & Notation Problem & Notation Link-based route measurement model Matching row GPS data to ˆm the transportation network G GPS data ˆm = ( ˆx, ˆ τ ) Pair of coordinateswith ˆx = ( ˆx lat, ˆx lon ) error variance Timestamp τˆ A given trip ˆm = ( ˆm 1,..., ˆm n,..., ˆm N ) Network G = (V, A) Node v V : the horizontal position x v = {x lat, x lon } Link: a = (v u, v d ) A the vector of spatial attributes Network connection δ(a' a) : 1/0 σ y a Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

18 Flow Link-based route measurement model Link-based route measurement Matching all data observed within a period to the same link ˆm 1 ˆm 2 ˆm n ˆm N t = T ˆm ˆm 1 J ˆm 1 ˆm J GPS data of a trip ˆm = ( ˆm 1,..., ˆm n,..., ˆm N ) ˆm n = ( ˆx n, ˆn) Data decompopsition ˆm = ( ˆm 1,..., ˆm t,..., ˆm T ) ˆm t = ( ˆm t 1,..., ˆm t j,..., ˆm t J ) Estimation: a 1 a 2 a T at p(a t ˆm t, a t 1 ) p( ˆm t a t ; a t )p(a t a t 1 ; ) Link probabilities a 1 Path inference: a 2 a T = [a 1,..., a t,..., a T ] p( ˆm t a t ) : Measurement probability of ˆm t given a t ; measurement equation p(a t a t 1 ) : Prior probability of a t given a t 1 ; system equation Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

19 Link probability a t Link probability Link-based route measurement model p(a t ˆm t, a t 1 ) The probability of given measurements and state Candidate set: A(a t 1 ) = {a t δ(a t a t 1 ) =1} Calculate link probabilities for all a t A(a t 1 ) ˆm t a t 1 ˆm 1 t 1 ˆm 3 t a t 1 ˆm 2 t 2 3 : GPS data ˆm t = { ˆm 1 t, ˆm 2 t, ˆm 3 t } Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

20 Measurement equation Measurement equation The probability of measurements ˆm t given a t Link-based route measurement model p( ˆm t a t ;σ at ) Assumption: τˆ Timestamp has no measurement error; p( ˆm t a t ) = p( ˆx t a t ) Measurement probability of data is independent from each other Traveler moves at the constant speed on the same link p( ˆx 1 t,..., ˆx J t a t ;σ at ) = p( ˆx j t J j=1 J x j a t a t ;σ at ) = p( ˆx j t j=1 x t j, a t ;σ at ) p(x j a t )dx j PDF of GPS measurement error: Rayleigh distribution (van Diggelen, 2007) p( ˆx j t x t j, a t ;σ at ) = ˆx t j x " j exp ˆx t 2 $ j x j 2 2 σ at $ 2σ # at % ' ' & Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

21 Measurement equation Link-based route measurement model Estimation of measurement parameter Link-based map matching can regard error variance as a link peculiar variable σ at Measurement likelihood maximization Where, p( ˆm t a t ;σ at ) = J j=1 σ at x j a t = argmax σ ) + *, + p( ˆm t a t ;σ ) ˆx t j x " j exp ˆx t 2 $ j x j 2 2 σ at $ 2σ # at % - ' ' p(x a ) + j t. dx j & / + Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

22 System equation The prior probability of given a state a t System equation Link-based route measurement model p(a t a t 1 ;θ) a t 1 Link-based route choice model Utility function: A(a t 1 ) u(a t a t 1 ) = v(a t a t 1 )+ε(a t ) =θy at a t 1 +ε(a t ) 1 a t 1 2 v( ) : Deterministic component of utility ε( ) : Probabilistic component of utility (i.i.d. gumbel distribution) 3 y at a t 1 θ : Vector of explanatory variables : Vector of parameters Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

23 System equation The prior probability of given a state a t System equation Link-based route measurement model p(a t a t 1 ;θ) a t 1 Link-based route choice model 1 A(a t 1 ) Choice probability option: Markov model p(a t a t 1 ) = a t A(a t 1 ) e v(a t a t 1 ) e v(a t a t 1 ) a t 1 2 Recursive logit model Fosgerau et al. (2013) 3 p(a t a t 1 ) = And others: e.g., a t A(a t 1 ) e v(a t a t 1 )+V d (a t ) e v(a t a t 1 )+V d (a t ) Mai et al. (2015); Mai (2016); Oyama et al. (2016) Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

24 Link inference Link inference Link-based route measurement model Link (posterior) probability: a t The probability of given measurements and a state ˆm t a t 1 p(a t ˆm t, a t 1 ) p( ˆm t a t ;σ at )p(a t a t 1 ;θ) Link inference: Link likelihood maximization subject to switching condition a t = argmax a t A(a t 1 ) p(a t ˆm t, a t 1 ) s.t., max p( ˆm t+1 a;σ a ) > γ a A(a t ) Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

25 Outline Outline Outline 1. Introduction 2. Link-based map matching algorithm 3. Structural estimation method 4. Numerical examples 5. Conclusions Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

26 A fixed point problem Methodology Structural estimation method Need to solve a fixed point problem of route measurement and estimation Route measurement Route choice probability p(a t a t 1 ;! θ ) Path ψ Measurement probability p( ˆm t a t ;σ at ) Where, # LL(θ;ψ) = ln% $ Route choice model θ = argmax θ s.t., i δ at T i LL(θ;ψ) θ! θ < ζ t=2 " = 1, if a i,t ψ i # $ 0, otherwise p(a t a t 1 ;θ) δ i at & ( ' Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

27 Methodology Structural estimation method Structural estimation A method for parameter estimation of models with fixed point problem NFXP (Nested Fixed Point) Rust (1987) NPL (Nested Pseudo Likelihood) Aguirregabiria and Mira (2002) MPEC (Mathematical Programming with Equilibrium Constraint) Su and Judd (2012) Structural estimation for route choice model with uncertain data Solving a fixed problem regarding parameter of route choice model Inner problem: Route measurement model Outer problem: Parameter estimation of route choice model Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

28 Structural estimation Methodology Structural estimation method A estimation method for solving a fixed point problem of route choice parameter h = 1, (h) = GPS data ˆm Measurement model p i (a t ˆm i t, a t 1 ) = a t a i,t = argmax a t p( ˆm i a t ; a t )p(a t a t 1 ; p( ˆm t i a t ; a t )p(a t a t 1 ; ˆm i = ( ˆm i 1,..., ˆm i t,..., ˆm i T ) p i (a t ˆm t i, a t 1 ; (h) i = [a i,1,..., a i,t,..., a i,t ] (h) ) (h) ) (h) ) (h) Behavior model max LL( ) = log I i t=2 (h) a i,t = 1, if a (h) i,t i 0, otherwise (h+1) = argmax LL( ; T (h ) p i (a t a t 1 ; ) a i,t (h) ) (h) h := h+1 No (h+1) (h) < Yes = (h), = (h) Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

29 Outline Outline Outline 1. Introduction 2. Link-based map matching algorithm 3. Structural estimation method 4. Numerical examples 5. Conclusions Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

30 Twins experiment Numerical examples Twins experiments Simulation y y = 90 (2/0/5) (2/0/5) (2/0/5) d D Settings y = 60 y = 30 O o (2/1/5) (2/1/5) (2/1/5) (3/1/5) (1/0/20) (1/0/20) (1/0/20) (3/1/5) (2/0/5) (2/1/5) (3/1/5) (2/1/10) (2/1/10) (2/1/10) (3/1/5) (3/1/5) (3/1/5) (2/1/5) (2/1/5) (1/1/5) (2/1/5) x = 40 x = 80 x = 120 *(continuous cost: CC a / discrete cost: xdc a / variance: ) v(a k) =θ 1 TT a +θ 2 CC a +θ 3 DC a +θ 4 UT a k True parameter: Period interval: Data generation: a! θ = [ 0.1, 2, 1.5, 4] t = 30s ˆ τ j ˆ τ j 1 =10s : True path : Measurement y y y x x x (a) (b) (c) Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

31 Twins experiment Numerical examples Twins experiments Measurement results Which model improves the route measurement accuracy? Table: Measurement accuracy and the difference of the parameter from the true value Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

32 Twins experiment Numerical examples Twins experiments Estimation results Does structural estimation method improve the parameter estimation results? Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

33 Real data Real data Numerical examples Matsuyama Probe Person data in 2007, 30 pedestrians, 729 locations N (m) Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

34 Real data Numerical examples Real data Model specification Route choice model: (static) Markov model Target: Pedestrian trip in city center Utility function: v(a k) =θ 1 TT a +θ 2 CU a +θ 3 DU a +θ 4 UT a k TT : Travel time (min.) CU : DU : Sidewalk width (m) Arcade dummy variable UT : U-turn dummy variable Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

35 Real data Numerical examples Real data Parameter estimation results Travel time ( θ 1 ) seems to be significant from the result of one-way model, however, Structural estimation results show that links with arcade ( θ 3 ) are the most likely to be passed by pedestrians; travel time ( θ 1 ) is not significant Other t-values and rho-square ( ρ 2 ) indicate that the structural estimation improves parameter estimation results Travel time (min.) Sidewalk width (m) With arcade U-turn Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

36 Real data Numerical examples Real data Estimation results of error variance Estimated measurement error variance is dependent on each link Estimation result of σ ~ 20 (or no measurement) 20 ~ ~ ~ ~ Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

37 Outline Outline Outline 1. Introduction 2. Link-based map matching algorithm 3. Structural estimation method 4. Numerical examples 5. Conclusions Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

38 Conclusions Conclusions Conclusions and Future work Conclusions A link-based measurement model with route choice model Estimation of measurement parameter for each link Structural estimation method for solving a fixed point problem regarding route choice parameters Future work Comparison of computational efficiency with previous measurement models Alternatives and utility of pedestrian link choice Characteristics of the fixed point problem Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

39 Thank you for attention! Questions? Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

40 References Reference Reference 1. Bierlaire, M., Chen, J., Newman, J., A probabilistic map matching method for smartphone GPS data. Transportation Research Part C: Emerging Technologies 26, Bierlaire, M., Frejinger, E., Route choice modeling with network-free data. Transportation Research Part C: Emerging Technologies 16(2), Chen, J., Bierlaire, M., Probabilistic multimodal map matching with rich smartphone data. Journal of Intelligent Transportation System 19(2), Danalet, A., Farooq, B., Bierlaire, M., A bayesian approach to detect pedestrian destination-sequences from WiFi signatures. Transportation Research Part C: Emerging Technologies 44, Fuse, T., Nakanishi, W., A study on multiple human tracking by integrating pedestrian behavior model (in Japanese). Journal of JSCE Series D3: Infrastructure Planning and Management 68(2), Fosgerau, M., Frejinger, E. and Karlstrm A., A link-based network route choice model with unrestricted choice set. Transportation Research Part B, 56, pp Hunter, T., Abbeel, P., Bayen, A., The path inference filter: model-based low-latency map matching of probe vehicle data. IEEE Transactions on Intelligent Transportation Systems 15(2), Pyo, J.S., Shin, D.H., Sung, T.K., Development of a map matching method using the multiple hypothesis technique. IEEE Proceedings on Intelligent Transportation Systems, Quddus, M.A., Noland, R.B., Ochieng, W.Y., Validation of map matching algorithms using high precision positioning with GPS. The Journal of Navigation 58(2), Quddus, M.A., Ochieng, W.Y., Noland, R.B., Current map-matching algorithms for transport applications: Stateof-the art and future research directions. Transportation Research Part C: Emerging Technologies 15(5), Quddus, M.A., Ochieng, W.Y., Zhao, L., Noland, R.B., A general mao matching algorithm for transport telematics applications. GPS Solutions 7(3), Quddus, M.A., Washington, S., Shortest path and vehicle trajectory aided mapmatching for low frequency GPS data. Transportation Research Part C: Emerging Technologies 55, van Diggelen, F., GNSS accuracy: lies, damn lies, and statistics. GPS World 18(1), Velaga, N.R., Quddus, M.A., Bistow, A.L., Developing an enhanced weight-based topological map-matching algorithm for intelligent transport systems. Transportation Research Part C: Emerging Technologies 17, White, C.E., Bernstein, D., Kornhauser, A.L., Some map matching algorithms for personal navigation assistants. Transportation Research Part C: Emerging Technologies 8, Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

41 Appendix Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

42 Literature review Introduction Previous route measurement models Geometric White et al. (2000) - Point-to-point - Point-to-curve - Curve-to-curve Topological Greenfield (2002) - Adjacency - Connectivity - Vehicle heading Probabilistic Ouchieng et al. (2004) Quddus et al. (2006) - Error region - Fuzzy logic Path-based - MHT Pyo et al. (2006) Bielraire et al. (2013) - Measurement equation 30% 70% Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

43 Methodology Link switching errors Link-based route measurement model Difficulties regarding link connectivity because of myopic optimization ˆm ˆm 2 1 ˆm 3 1 ˆm ˆm 3 2 ˆm ˆm ˆm : Estimated path ˆm 3 3 : More likely path Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

44 Link switching Link switching algorithm Link-based route measurement model STEP1: Calculating probabilities p( ˆm t p i (a t ˆm t i, a t 1 ) = i a t ; a t )p(a t a t 1 ; ) p( ˆm t i a t ; a t )p(a t a t 1 ; ) a t A(a t 1 ) STEP2: Sorting candidates by probabilities [a t,1,..., a t,r,..., a t, A(at 1 ) ] p(a t,1 ) p(a t,r ) p(a t, A(at 1 ) ) r = 1 STEP3: Calculating measurement equation at (t+1) where, a t+1 = argmax a ( ) LLm r = log p( ˆm t+1 a t+1 ; a t+1 ) p(a ˆm t+1, a t,r ) r := r+1 No LLm r J No < r = A(a t 1 ) Yes a t = a t,r r := 1 Yes Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

45 Real data Numerical examples Twins experiments iterations 100 Ave Link accuracy (%) Estimation error: a Sum #iteration Estimation error: : input : input : input = [ 1.5, 0.1, 2, 10] (wrong parameters) = [0,0,0,0] (no information) = [ 0.1, 2, 1.5, 4] (true parameters) Oyama, Y. (The University of Tokyo) 15 th Behavior Modeling summer course Jury Sep. 29, 25, 2016

A path choice approach to ac,vity modeling with a pedestrian case study

A path choice approach to ac,vity modeling with a pedestrian case study A path choice approach to ac,vity modeling with a pedestrian case study Antonin Danalet Sta,s,que, transport et ac,vités, Grenoble November 5, 2013 Presenta,on outline Motivation: Why pedestrian activities?

More information

A nested recursive logit model for route choice analysis

A nested recursive logit model for route choice analysis A nested recursive logit model for route choice analysis Tien Mai a, Mogens Fosgerau b and Emma Frejinger a a Department of Computer Science and Operational Research Université de Montréal and CIRRELT,

More information

Hiroshima University 2) Tokyo University of Science

Hiroshima University 2) Tokyo University of Science September 23-25, 2016 The 15th Summer course for Behavior Modeling in Transportation Networks @The University of Tokyo Advanced behavior models Recent development of discrete choice models Makoto Chikaraishi

More information

Map Matching Algorithms in GPS Navigating System and Their Functions

Map Matching Algorithms in GPS Navigating System and Their Functions Map Matching Algorithms in GPS Navigating System and Their Functions Abstract R.Kamalambal (M.Phil. Student) Department of computer science & Technology Kajamalai Campus, Bharathidasan University, Trichy,

More information

ANALYSIS OF CAR BEHAVIOR IN MATSUYAMA CITY

ANALYSIS OF CAR BEHAVIOR IN MATSUYAMA CITY ANALYSIS OF CAR BEHAVIOR IN MATSUYAMA CITY (USING PROBE PERSON DATA) TEAM G 16-Sep 2018 T h e U n i v e r s i t y o f To k yo, Jap a n & T h e U n i v e r s i t y o f C e n t r a l P u n j a b, L a h o

More information

Activity path size for correlation between activity paths

Activity path size for correlation between activity paths Workshop in Discrete Choice Models Activity path size for correlation between activity paths Antonin Danalet, Michel Bierlaire EPFL, Lausanne, Switzerland May 29, 2015 Outline Motivation: Activity-based

More information

WiFi- Based Marauder's Map, or where are members of a campus and why?

WiFi- Based Marauder's Map, or where are members of a campus and why? WiFi- Based Marauder's Map, or where are members of a campus and why? Antonin Danalet Workshop on pedestrian models 2014 April 11, 2014 Presenta=on outline Motivation: Why pedestrian activities? Detection:

More information

Capturing Correlation in Route Choice Models using Subnetworks

Capturing Correlation in Route Choice Models using Subnetworks Capturing Correlation in Route Choice Models using Subnetworks Emma Frejinger and Michel Bierlaire Transport and Mobility Laboratory (TRANSP-OR), EPFL Capturing Correlation with Subnetworks in Route Choice

More information

Estimating Single-Agent Dynamic Models

Estimating Single-Agent Dynamic Models Estimating Single-Agent Dynamic Models Paul T. Scott Empirical IO Fall, 2013 1 / 49 Why are dynamics important? The motivation for using dynamics is usually external validity: we want to simulate counterfactuals

More information

Urban Link Travel Time Estimation Using Large-scale Taxi Data with Partial Information

Urban Link Travel Time Estimation Using Large-scale Taxi Data with Partial Information Urban Link Travel Time Estimation Using Large-scale Taxi Data with Partial Information * Satish V. Ukkusuri * * Civil Engineering, Purdue University 24/04/2014 Outline Introduction Study Region Link Travel

More information

Estimating Dynamic Programming Models

Estimating Dynamic Programming Models Estimating Dynamic Programming Models Katsumi Shimotsu 1 Ken Yamada 2 1 Department of Economics Hitotsubashi University 2 School of Economics Singapore Management University Katsumi Shimotsu, Ken Yamada

More information

Auxiliary Particle Methods

Auxiliary Particle Methods Auxiliary Particle Methods Perspectives & Applications Adam M. Johansen 1 adam.johansen@bristol.ac.uk Oxford University Man Institute 29th May 2008 1 Collaborators include: Arnaud Doucet, Nick Whiteley

More information

A path choice approach to activity modeling with a pedestrian case study

A path choice approach to activity modeling with a pedestrian case study Waiting for the train Having a coffee Buying a ticket s e 7:35-7:40 7:40-7:45 7:45-7:50 7:50-7:55 7:55-8:00 8:00-8:05 8:05-8:10 8:10-8:15 A path choice approach to activity modeling with a pedestrian case

More information

DO TAXI DRIVERS CHOOSE THE SHORTEST ROUTES?

DO TAXI DRIVERS CHOOSE THE SHORTEST ROUTES? DO TAXI DRIVERS CHOOSE THE SHORTEST ROUTES? A Large-Scale Analysis of Route Choice Behavior of Taxi Drivers Using Floating Car Data in Shanghai Junyan Li Superviors: Juliane Cron M.Sc. (Technische Universität

More information

Route Choice Analysis: Data, Models, Algorithms and Applications Emma Frejinger Thesis Supervisor: Michel Bierlaire

Route Choice Analysis: Data, Models, Algorithms and Applications Emma Frejinger Thesis Supervisor: Michel Bierlaire p. 1/15 Emma Frejinger Thesis Supervisor: Michel Bierlaire p. 2/15 Which route would a given traveler take to go from one location to another in a transportation network? Car trips (uni-modal networks)

More information

Extracting mobility behavior from cell phone data DATA SIM Summer School 2013

Extracting mobility behavior from cell phone data DATA SIM Summer School 2013 Extracting mobility behavior from cell phone data DATA SIM Summer School 2013 PETER WIDHALM Mobility Department Dynamic Transportation Systems T +43(0) 50550-6655 F +43(0) 50550-6439 peter.widhalm@ait.ac.at

More information

A Dynamic Programming Approach for Quickly Estimating Large Scale MEV Models

A Dynamic Programming Approach for Quickly Estimating Large Scale MEV Models A Dynamic Programming Approach for Quickly Estimating Large Scale MEV Models Tien Mai Emma Frejinger Mogens Fosgerau Fabien Bastin June 2015 A Dynamic Programming Approach for Quickly Estimating Large

More information

Robotics. Mobile Robotics. Marc Toussaint U Stuttgart

Robotics. Mobile Robotics. Marc Toussaint U Stuttgart Robotics Mobile Robotics State estimation, Bayes filter, odometry, particle filter, Kalman filter, SLAM, joint Bayes filter, EKF SLAM, particle SLAM, graph-based SLAM Marc Toussaint U Stuttgart DARPA Grand

More information

Current map-matching algorithms for transport applications: State-of-the art and future research directions

Current map-matching algorithms for transport applications: State-of-the art and future research directions Transportation Research Part C 15 (2007) 312 328 www.elsevier.com/locate/trc Current map-matching algorithms for transport applications: State-of-the art and future research directions Mohammed A. Quddus

More information

A sampling of alternatives approach for route choice models

A sampling of alternatives approach for route choice models Seminar, Namur, February 2009, A sampling of alternatives approach for route choice models p. 1/34 A sampling of alternatives approach for route choice models Emma Frejinger Centre for Transport Studies,

More information

A nested recursive logit model for route choice analysis

A nested recursive logit model for route choice analysis Downloaded from orbit.dtu.dk on: Sep 09, 2018 A nested recursive logit model for route choice analysis Mai, Tien; Frejinger, Emma; Fosgerau, Mogens Published in: Transportation Research Part B: Methodological

More information

Switching Regime Estimation

Switching Regime Estimation Switching Regime Estimation Series de Tiempo BIrkbeck March 2013 Martin Sola (FE) Markov Switching models 01/13 1 / 52 The economy (the time series) often behaves very different in periods such as booms

More information

The Generalized Likelihood Uncertainty Estimation methodology

The Generalized Likelihood Uncertainty Estimation methodology CHAPTER 4 The Generalized Likelihood Uncertainty Estimation methodology Calibration and uncertainty estimation based upon a statistical framework is aimed at finding an optimal set of models, parameters

More information

Preferred citation style. Schüssler, N. (2009) Challenges of route choice models derived from GPS, Workshop on Discrete Choice Models, EPF

Preferred citation style. Schüssler, N. (2009) Challenges of route choice models derived from GPS, Workshop on Discrete Choice Models, EPF Preferred citation style Schüssler, N. (2009) Challenges of route choice models derived from GPS, Workshop on Discrete Choice Models, EPF Lausanne, Lausanne, August 2009. Challenges of route choice models

More information

DS-GA 1002 Lecture notes 11 Fall Bayesian statistics

DS-GA 1002 Lecture notes 11 Fall Bayesian statistics DS-GA 100 Lecture notes 11 Fall 016 Bayesian statistics In the frequentist paradigm we model the data as realizations from a distribution that depends on deterministic parameters. In contrast, in Bayesian

More information

Bayesian Methods in Positioning Applications

Bayesian Methods in Positioning Applications Bayesian Methods in Positioning Applications Vedran Dizdarević v.dizdarevic@tugraz.at Graz University of Technology, Austria 24. May 2006 Bayesian Methods in Positioning Applications p.1/21 Outline Problem

More information

The Path Inference Filter: Model-Based Low-Latency Map Matching of Probe Vehicle Data

The Path Inference Filter: Model-Based Low-Latency Map Matching of Probe Vehicle Data The Path Inference Filter: Model-Based Low-Latency Map Matching of Probe Vehicle Data Timothy Hunter, Pieter Abbeel, and Alexandre M. Bayen Abstract. We consider the problem of reconstructing vehicle trajectories

More information

Probabilistic numerics for deep learning

Probabilistic numerics for deep learning Presenter: Shijia Wang Department of Engineering Science, University of Oxford rning (RLSS) Summer School, Montreal 2017 Outline 1 Introduction Probabilistic Numerics 2 Components Probabilistic modeling

More information

Recursive Network MEV Model for Route Choice Analysis

Recursive Network MEV Model for Route Choice Analysis Recursive Networ MEV Model for Route Choice Analysis Tien Mai August 2015 Tien Mai * Interuniversity Research Centre on Enterprise Networs, Logistics and Transportation (CIRRELT) and Department of Computer

More information

Expectation. DS GA 1002 Statistical and Mathematical Models. Carlos Fernandez-Granda

Expectation. DS GA 1002 Statistical and Mathematical Models.   Carlos Fernandez-Granda Expectation DS GA 1002 Statistical and Mathematical Models http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall16 Carlos Fernandez-Granda Aim Describe random variables with a few numbers: mean, variance,

More information

A Probabilistic Framework for solving Inverse Problems. Lambros S. Katafygiotis, Ph.D.

A Probabilistic Framework for solving Inverse Problems. Lambros S. Katafygiotis, Ph.D. A Probabilistic Framework for solving Inverse Problems Lambros S. Katafygiotis, Ph.D. OUTLINE Introduction to basic concepts of Bayesian Statistics Inverse Problems in Civil Engineering Probabilistic Model

More information

Travel Time Calculation With GIS in Rail Station Location Optimization

Travel Time Calculation With GIS in Rail Station Location Optimization Travel Time Calculation With GIS in Rail Station Location Optimization Topic Scope: Transit II: Bus and Rail Stop Information and Analysis Paper: # UC8 by Sutapa Samanta Doctoral Student Department of

More information

Probability Map Building of Uncertain Dynamic Environments with Indistinguishable Obstacles

Probability Map Building of Uncertain Dynamic Environments with Indistinguishable Obstacles Probability Map Building of Uncertain Dynamic Environments with Indistinguishable Obstacles Myungsoo Jun and Raffaello D Andrea Sibley School of Mechanical and Aerospace Engineering Cornell University

More information

Dynamic Multipath Estimation by Sequential Monte Carlo Methods

Dynamic Multipath Estimation by Sequential Monte Carlo Methods Dynamic Multipath Estimation by Sequential Monte Carlo Methods M. Lentmaier, B. Krach, P. Robertson, and T. Thiasiriphet German Aerospace Center (DLR) Slide 1 Outline Multipath problem and signal model

More information

ENGR352 Problem Set 02

ENGR352 Problem Set 02 engr352/engr352p02 September 13, 2018) ENGR352 Problem Set 02 Transfer function of an estimator 1. Using Eq. (1.1.4-27) from the text, find the correct value of r ss (the result given in the text is incorrect).

More information

Travel Time Estimation from Sparse Floating Car Data with Consistent Path Inference: A Fixed Point Approach

Travel Time Estimation from Sparse Floating Car Data with Consistent Path Inference: A Fixed Point Approach Travel Time Estimation from Sparse Floating Car Data with Consistent Path Inference: A Fixed Point Approach Mahmood Rahmani a, Haris N. Koutsopoulos a,b, Erik Jenelius a, a Department of Transport Science,

More information

Mobile Robot Localization

Mobile Robot Localization Mobile Robot Localization 1 The Problem of Robot Localization Given a map of the environment, how can a robot determine its pose (planar coordinates + orientation)? Two sources of uncertainty: - observations

More information

Route choice models: Introduction and recent developments

Route choice models: Introduction and recent developments Route choice models: Introduction and recent developments Michel Bierlaire transp-or.epfl.ch Transport and Mobility Laboratory, EPFL Route choice models: Introduction and recent developments p.1/40 Route

More information

Expectation. DS GA 1002 Probability and Statistics for Data Science. Carlos Fernandez-Granda

Expectation. DS GA 1002 Probability and Statistics for Data Science.   Carlos Fernandez-Granda Expectation DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Aim Describe random variables with a few numbers: mean,

More information

Path and travel time inference from GPS probe vehicle data

Path and travel time inference from GPS probe vehicle data Path and travel time inference from GPS probe vehicle data Timothy Hunter Department of Electrical Engineering and Computer Science University of California, Berkeley tjhunter@eecs.berkeley.edu Pieter

More information

Destination Choice Model including panel data using WiFi localization in a pedestrian facility

Destination Choice Model including panel data using WiFi localization in a pedestrian facility Destination Choice Model including panel data using WiFi localization in a pedestrian facility Loïc Tinguely, Antonin Danalet, Matthieu de Lapparent & Michel Bierlaire Transport and Mobility Laboratory

More information

Naïve Bayes classification

Naïve Bayes classification Naïve Bayes classification 1 Probability theory Random variable: a variable whose possible values are numerical outcomes of a random phenomenon. Examples: A person s height, the outcome of a coin toss

More information

EVALUATING SYMMETRIC INFORMATION GAP BETWEEN DYNAMICAL SYSTEMS USING PARTICLE FILTER

EVALUATING SYMMETRIC INFORMATION GAP BETWEEN DYNAMICAL SYSTEMS USING PARTICLE FILTER EVALUATING SYMMETRIC INFORMATION GAP BETWEEN DYNAMICAL SYSTEMS USING PARTICLE FILTER Zhen Zhen 1, Jun Young Lee 2, and Abdus Saboor 3 1 Mingde College, Guizhou University, China zhenz2000@21cn.com 2 Department

More information

Linear Dynamical Systems

Linear Dynamical Systems Linear Dynamical Systems Sargur N. srihari@cedar.buffalo.edu Machine Learning Course: http://www.cedar.buffalo.edu/~srihari/cse574/index.html Two Models Described by Same Graph Latent variables Observations

More information

Kalman filtering and friends: Inference in time series models. Herke van Hoof slides mostly by Michael Rubinstein

Kalman filtering and friends: Inference in time series models. Herke van Hoof slides mostly by Michael Rubinstein Kalman filtering and friends: Inference in time series models Herke van Hoof slides mostly by Michael Rubinstein Problem overview Goal Estimate most probable state at time k using measurement up to time

More information

AUTOMOTIVE ENVIRONMENT SENSORS

AUTOMOTIVE ENVIRONMENT SENSORS AUTOMOTIVE ENVIRONMENT SENSORS Lecture 5. Localization BME KÖZLEKEDÉSMÉRNÖKI ÉS JÁRMŰMÉRNÖKI KAR 32708-2/2017/INTFIN SZÁMÚ EMMI ÁLTAL TÁMOGATOTT TANANYAG Related concepts Concepts related to vehicles moving

More information

Sequence labeling. Taking collective a set of interrelated instances x 1,, x T and jointly labeling them

Sequence labeling. Taking collective a set of interrelated instances x 1,, x T and jointly labeling them HMM, MEMM and CRF 40-957 Special opics in Artificial Intelligence: Probabilistic Graphical Models Sharif University of echnology Soleymani Spring 2014 Sequence labeling aking collective a set of interrelated

More information

Uncertainty. Jayakrishnan Unnikrishnan. CSL June PhD Defense ECE Department

Uncertainty. Jayakrishnan Unnikrishnan. CSL June PhD Defense ECE Department Decision-Making under Statistical Uncertainty Jayakrishnan Unnikrishnan PhD Defense ECE Department University of Illinois at Urbana-Champaign CSL 141 12 June 2010 Statistical Decision-Making Relevant in

More information

Physics 403. Segev BenZvi. Parameter Estimation, Correlations, and Error Bars. Department of Physics and Astronomy University of Rochester

Physics 403. Segev BenZvi. Parameter Estimation, Correlations, and Error Bars. Department of Physics and Astronomy University of Rochester Physics 403 Parameter Estimation, Correlations, and Error Bars Segev BenZvi Department of Physics and Astronomy University of Rochester Table of Contents 1 Review of Last Class Best Estimates and Reliability

More information

An HMM-based Map-Matching Method with Cumulative Proximity-Weight Formulations

An HMM-based Map-Matching Method with Cumulative Proximity-Weight Formulations An HMM-based Map-Matching Method with Cumulative Proximity-Weight Formulations Ali Oran Future Urban Mobility IRG Singapore-MIT Alliance for Research & Technology (SMART) Singapore, 138602 Email: aoran@smart.mit.edu

More information

Practice Problems Section Problems

Practice Problems Section Problems Practice Problems Section 4-4-3 4-4 4-5 4-6 4-7 4-8 4-10 Supplemental Problems 4-1 to 4-9 4-13, 14, 15, 17, 19, 0 4-3, 34, 36, 38 4-47, 49, 5, 54, 55 4-59, 60, 63 4-66, 68, 69, 70, 74 4-79, 81, 84 4-85,

More information

Data Analysis and Manifold Learning Lecture 6: Probabilistic PCA and Factor Analysis

Data Analysis and Manifold Learning Lecture 6: Probabilistic PCA and Factor Analysis Data Analysis and Manifold Learning Lecture 6: Probabilistic PCA and Factor Analysis Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture

More information

Probabilistic Graphical Models

Probabilistic Graphical Models Probabilistic Graphical Models Brown University CSCI 2950-P, Spring 2013 Prof. Erik Sudderth Lecture 12: Gaussian Belief Propagation, State Space Models and Kalman Filters Guest Kalman Filter Lecture by

More information

Hiroshima University 2) The University of Tokyo

Hiroshima University 2) The University of Tokyo September 25-27, 2015 The 14th Summer course for Behavior Modeling in Transportation Networks @The University of Tokyo Advanced behavior models Recent development of discrete choice models Makoto Chikaraishi

More information

SEQUENTIAL ESTIMATION OF DYNAMIC DISCRETE GAMES. Victor Aguirregabiria (Boston University) and. Pedro Mira (CEMFI) Applied Micro Workshop at Minnesota

SEQUENTIAL ESTIMATION OF DYNAMIC DISCRETE GAMES. Victor Aguirregabiria (Boston University) and. Pedro Mira (CEMFI) Applied Micro Workshop at Minnesota SEQUENTIAL ESTIMATION OF DYNAMIC DISCRETE GAMES Victor Aguirregabiria (Boston University) and Pedro Mira (CEMFI) Applied Micro Workshop at Minnesota February 16, 2006 CONTEXT AND MOTIVATION Many interesting

More information

Winter 2019 Math 106 Topics in Applied Mathematics. Lecture 8: Importance Sampling

Winter 2019 Math 106 Topics in Applied Mathematics. Lecture 8: Importance Sampling Winter 2019 Math 106 Topics in Applied Mathematics Data-driven Uncertainty Quantification Yoonsang Lee (yoonsang.lee@dartmouth.edu) Lecture 8: Importance Sampling 8.1 Importance Sampling Importance sampling

More information

2D Image Processing. Bayes filter implementation: Kalman filter

2D Image Processing. Bayes filter implementation: Kalman filter 2D Image Processing Bayes filter implementation: Kalman filter Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de

More information

Lecture 15: MCMC Sanjeev Arora Elad Hazan. COS 402 Machine Learning and Artificial Intelligence Fall 2016

Lecture 15: MCMC Sanjeev Arora Elad Hazan. COS 402 Machine Learning and Artificial Intelligence Fall 2016 Lecture 15: MCMC Sanjeev Arora Elad Hazan COS 402 Machine Learning and Artificial Intelligence Fall 2016 Course progress Learning from examples Definition + fundamental theorem of statistical learning,

More information

Binary choice. Michel Bierlaire

Binary choice. Michel Bierlaire Binary choice Michel Bierlaire Transport and Mobility Laboratory School of Architecture, Civil and Environmental Engineering Ecole Polytechnique Fédérale de Lausanne M. Bierlaire (TRANSP-OR ENAC EPFL)

More information

Sensor Tasking and Control

Sensor Tasking and Control Sensor Tasking and Control Sensing Networking Leonidas Guibas Stanford University Computation CS428 Sensor systems are about sensing, after all... System State Continuous and Discrete Variables The quantities

More information

PILCO: A Model-Based and Data-Efficient Approach to Policy Search

PILCO: A Model-Based and Data-Efficient Approach to Policy Search PILCO: A Model-Based and Data-Efficient Approach to Policy Search (M.P. Deisenroth and C.E. Rasmussen) CSC2541 November 4, 2016 PILCO Graphical Model PILCO Probabilistic Inference for Learning COntrol

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Roman Barták Department of Theoretical Computer Science and Mathematical Logic Summary of last lecture We know how to do probabilistic reasoning over time transition model P(X t

More information

Sequential Monte Carlo Methods (for DSGE Models)

Sequential Monte Carlo Methods (for DSGE Models) Sequential Monte Carlo Methods (for DSGE Models) Frank Schorfheide University of Pennsylvania, PIER, CEPR, and NBER October 23, 2017 Some References These lectures use material from our joint work: Tempered

More information

Naïve Bayes classification. p ij 11/15/16. Probability theory. Probability theory. Probability theory. X P (X = x i )=1 i. Marginal Probability

Naïve Bayes classification. p ij 11/15/16. Probability theory. Probability theory. Probability theory. X P (X = x i )=1 i. Marginal Probability Probability theory Naïve Bayes classification Random variable: a variable whose possible values are numerical outcomes of a random phenomenon. s: A person s height, the outcome of a coin toss Distinguish

More information

Exponential Family and Maximum Likelihood, Gaussian Mixture Models and the EM Algorithm. by Korbinian Schwinger

Exponential Family and Maximum Likelihood, Gaussian Mixture Models and the EM Algorithm. by Korbinian Schwinger Exponential Family and Maximum Likelihood, Gaussian Mixture Models and the EM Algorithm by Korbinian Schwinger Overview Exponential Family Maximum Likelihood The EM Algorithm Gaussian Mixture Models Exponential

More information

An Brief Overview of Particle Filtering

An Brief Overview of Particle Filtering 1 An Brief Overview of Particle Filtering Adam M. Johansen a.m.johansen@warwick.ac.uk www2.warwick.ac.uk/fac/sci/statistics/staff/academic/johansen/talks/ May 11th, 2010 Warwick University Centre for Systems

More information

2D Image Processing. Bayes filter implementation: Kalman filter

2D Image Processing. Bayes filter implementation: Kalman filter 2D Image Processing Bayes filter implementation: Kalman filter Prof. Didier Stricker Dr. Gabriele Bleser Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche

More information

1. The Multivariate Classical Linear Regression Model

1. The Multivariate Classical Linear Regression Model Business School, Brunel University MSc. EC550/5509 Modelling Financial Decisions and Markets/Introduction to Quantitative Methods Prof. Menelaos Karanasos (Room SS69, Tel. 08956584) Lecture Notes 5. The

More information

Web Appendix for Hierarchical Adaptive Regression Kernels for Regression with Functional Predictors by D. B. Woodard, C. Crainiceanu, and D.

Web Appendix for Hierarchical Adaptive Regression Kernels for Regression with Functional Predictors by D. B. Woodard, C. Crainiceanu, and D. Web Appendix for Hierarchical Adaptive Regression Kernels for Regression with Functional Predictors by D. B. Woodard, C. Crainiceanu, and D. Ruppert A. EMPIRICAL ESTIMATE OF THE KERNEL MIXTURE Here we

More information

Covariance Matrix Simplification For Efficient Uncertainty Management

Covariance Matrix Simplification For Efficient Uncertainty Management PASEO MaxEnt 2007 Covariance Matrix Simplification For Efficient Uncertainty Management André Jalobeanu, Jorge A. Gutiérrez PASEO Research Group LSIIT (CNRS/ Univ. Strasbourg) - Illkirch, France *part

More information

17 : Markov Chain Monte Carlo

17 : Markov Chain Monte Carlo 10-708: Probabilistic Graphical Models, Spring 2015 17 : Markov Chain Monte Carlo Lecturer: Eric P. Xing Scribes: Heran Lin, Bin Deng, Yun Huang 1 Review of Monte Carlo Methods 1.1 Overview Monte Carlo

More information

Bayesian Learning in Undirected Graphical Models

Bayesian Learning in Undirected Graphical Models Bayesian Learning in Undirected Graphical Models Zoubin Ghahramani Gatsby Computational Neuroscience Unit University College London, UK http://www.gatsby.ucl.ac.uk/ Work with: Iain Murray and Hyun-Chul

More information

An Introduction to Statistical Machine Learning - Theoretical Aspects -

An Introduction to Statistical Machine Learning - Theoretical Aspects - An Introduction to Statistical Machine Learning - Theoretical Aspects - Samy Bengio bengio@idiap.ch Dalle Molle Institute for Perceptual Artificial Intelligence (IDIAP) CP 592, rue du Simplon 4 1920 Martigny,

More information

Reasoning with Uncertainty

Reasoning with Uncertainty Reasoning with Uncertainty Representing Uncertainty Manfred Huber 2005 1 Reasoning with Uncertainty The goal of reasoning is usually to: Determine the state of the world Determine what actions to take

More information

Mobility Analytics through Social and Personal Data. Pierre Senellart

Mobility Analytics through Social and Personal Data. Pierre Senellart Mobility Analytics through Social and Personal Data Pierre Senellart Session: Big Data & Transport Business Convention on Big Data Université Paris-Saclay, 25 novembre 2015 Analyzing Transportation and

More information

QUESTION ONE Let 7C = Total Cost MC = Marginal Cost AC = Average Cost

QUESTION ONE Let 7C = Total Cost MC = Marginal Cost AC = Average Cost ANSWER QUESTION ONE Let 7C = Total Cost MC = Marginal Cost AC = Average Cost Q = Number of units AC = 7C MC = Q d7c d7c 7C Q Derivation of average cost with respect to quantity is different from marginal

More information

Estimating Dynamic Discrete-Choice Games of Incomplete Information

Estimating Dynamic Discrete-Choice Games of Incomplete Information Estimating Dynamic Discrete-Choice Games of Incomplete Information Michael Egesdal Zhenyu Lai Che-Lin Su October 5, 2012 Abstract We investigate the estimation of models of dynamic discrete-choice games

More information

ROUTE CHOICE MODELING USING GPS DATA

ROUTE CHOICE MODELING USING GPS DATA ROUTE CHOICE MODELING USING GPS DATA By NAGENDRA S DHAKAR A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR

More information

Estimating Single-Agent Dynamic Models

Estimating Single-Agent Dynamic Models Estimating Single-Agent Dynamic Models Paul T. Scott New York University Empirical IO Course Fall 2016 1 / 34 Introduction Why dynamic estimation? External validity Famous example: Hendel and Nevo s (2006)

More information

(Extended) Kalman Filter

(Extended) Kalman Filter (Extended) Kalman Filter Brian Hunt 7 June 2013 Goals of Data Assimilation (DA) Estimate the state of a system based on both current and all past observations of the system, using a model for the system

More information

Lecture 4: State Estimation in Hidden Markov Models (cont.)

Lecture 4: State Estimation in Hidden Markov Models (cont.) EE378A Statistical Signal Processing Lecture 4-04/13/2017 Lecture 4: State Estimation in Hidden Markov Models (cont.) Lecturer: Tsachy Weissman Scribe: David Wugofski In this lecture we build on previous

More information

The Metropolis-Hastings Algorithm. June 8, 2012

The Metropolis-Hastings Algorithm. June 8, 2012 The Metropolis-Hastings Algorithm June 8, 22 The Plan. Understand what a simulated distribution is 2. Understand why the Metropolis-Hastings algorithm works 3. Learn how to apply the Metropolis-Hastings

More information

Course 495: Advanced Statistical Machine Learning/Pattern Recognition

Course 495: Advanced Statistical Machine Learning/Pattern Recognition Course 495: Advanced Statistical Machine Learning/Pattern Recognition Goal (Lecture): To present Probabilistic Principal Component Analysis (PPCA) using both Maximum Likelihood (ML) and Expectation Maximization

More information

5.3 METABOLIC NETWORKS 193. P (x i P a (x i )) (5.30) i=1

5.3 METABOLIC NETWORKS 193. P (x i P a (x i )) (5.30) i=1 5.3 METABOLIC NETWORKS 193 5.3 Metabolic Networks 5.4 Bayesian Networks Let G = (V, E) be a directed acyclic graph. We assume that the vertices i V (1 i n) represent for example genes and correspond to

More information

Course 495: Advanced Statistical Machine Learning/Pattern Recognition

Course 495: Advanced Statistical Machine Learning/Pattern Recognition Course 495: Advanced Statistical Machine Learning/Pattern Recognition Lecturer: Stefanos Zafeiriou Goal (Lectures): To present discrete and continuous valued probabilistic linear dynamical systems (HMMs

More information

Probability Theory for Machine Learning. Chris Cremer September 2015

Probability Theory for Machine Learning. Chris Cremer September 2015 Probability Theory for Machine Learning Chris Cremer September 2015 Outline Motivation Probability Definitions and Rules Probability Distributions MLE for Gaussian Parameter Estimation MLE and Least Squares

More information

eects of navigation sensors and spatial road network data quality on the performance matching algorithms

eects of navigation sensors and spatial road network data quality on the performance matching algorithms Loughborough University Institutional Repository The eects of navigation sensors and spatial road network data quality on the performance of map matching algorithms This item was submitted to Loughborough

More information

an introduction to bayesian inference

an introduction to bayesian inference with an application to network analysis http://jakehofman.com january 13, 2010 motivation would like models that: provide predictive and explanatory power are complex enough to describe observed phenomena

More information

Stochastic Spectral Approaches to Bayesian Inference

Stochastic Spectral Approaches to Bayesian Inference Stochastic Spectral Approaches to Bayesian Inference Prof. Nathan L. Gibson Department of Mathematics Applied Mathematics and Computation Seminar March 4, 2011 Prof. Gibson (OSU) Spectral Approaches to

More information

Statistics & Data Sciences: First Year Prelim Exam May 2018

Statistics & Data Sciences: First Year Prelim Exam May 2018 Statistics & Data Sciences: First Year Prelim Exam May 2018 Instructions: 1. Do not turn this page until instructed to do so. 2. Start each new question on a new sheet of paper. 3. This is a closed book

More information

Gibbs Sampling Methods for Multiple Sequence Alignment

Gibbs Sampling Methods for Multiple Sequence Alignment Gibbs Sampling Methods for Multiple Sequence Alignment Scott C. Schmidler 1 Jun S. Liu 2 1 Section on Medical Informatics and 2 Department of Statistics Stanford University 11/17/99 1 Outline Statistical

More information

Reinforcement Learning

Reinforcement Learning Reinforcement Learning Model-Based Reinforcement Learning Model-based, PAC-MDP, sample complexity, exploration/exploitation, RMAX, E3, Bayes-optimal, Bayesian RL, model learning Vien Ngo MLR, University

More information

Stat 451 Lecture Notes Monte Carlo Integration

Stat 451 Lecture Notes Monte Carlo Integration Stat 451 Lecture Notes 06 12 Monte Carlo Integration Ryan Martin UIC www.math.uic.edu/~rgmartin 1 Based on Chapter 6 in Givens & Hoeting, Chapter 23 in Lange, and Chapters 3 4 in Robert & Casella 2 Updated:

More information

Learning in Bayesian Networks

Learning in Bayesian Networks Learning in Bayesian Networks Florian Markowetz Max-Planck-Institute for Molecular Genetics Computational Molecular Biology Berlin Berlin: 20.06.2002 1 Overview 1. Bayesian Networks Stochastic Networks

More information

Mobile Robot Localization

Mobile Robot Localization Mobile Robot Localization 1 The Problem of Robot Localization Given a map of the environment, how can a robot determine its pose (planar coordinates + orientation)? Two sources of uncertainty: - observations

More information

A Note on Auxiliary Particle Filters

A Note on Auxiliary Particle Filters A Note on Auxiliary Particle Filters Adam M. Johansen a,, Arnaud Doucet b a Department of Mathematics, University of Bristol, UK b Departments of Statistics & Computer Science, University of British Columbia,

More information

Lecture Outline. Target Tracking: Lecture 3 Maneuvering Target Tracking Issues. Maneuver Illustration. Maneuver Illustration. Maneuver Detection

Lecture Outline. Target Tracking: Lecture 3 Maneuvering Target Tracking Issues. Maneuver Illustration. Maneuver Illustration. Maneuver Detection REGLERTEKNIK Lecture Outline AUTOMATIC CONTROL Target Tracking: Lecture 3 Maneuvering Target Tracking Issues Maneuver Detection Emre Özkan emre@isy.liu.se Division of Automatic Control Department of Electrical

More information

Lecture 2: From Linear Regression to Kalman Filter and Beyond

Lecture 2: From Linear Regression to Kalman Filter and Beyond Lecture 2: From Linear Regression to Kalman Filter and Beyond Department of Biomedical Engineering and Computational Science Aalto University January 26, 2012 Contents 1 Batch and Recursive Estimation

More information

What is (certain) Spatio-Temporal Data?

What is (certain) Spatio-Temporal Data? What is (certain) Spatio-Temporal Data? A spatio-temporal database stores triples (oid, time, loc) In the best case, this allows to look up the location of an object at any time 2 What is (certain) Spatio-Temporal

More information

Econometrics I, Estimation

Econometrics I, Estimation Econometrics I, Estimation Department of Economics Stanford University September, 2008 Part I Parameter, Estimator, Estimate A parametric is a feature of the population. An estimator is a function of the

More information