Tree-building with complex cost structures ? A new algorithm for incorporation into transport demand models

1976 ◽  
Vol 5 (3) ◽  
pp. 309-329 ◽  
Author(s):  
Peter Bonsall
2011 ◽  
Vol 1 (7) ◽  
pp. 83-85
Author(s):  
Jasmine Jasmine ◽  
◽  
Pankaj Bhambri ◽  
Dr. O.P. Gupta Dr. O.P. Gupta

2013 ◽  
Vol 12 (3) ◽  
Author(s):  
Rusmadi Suyuti

Traffic information condition is a very useful  information for road user because road user can choose his best route for each trip from his origin to his destination. The final goal for this research is to develop real time traffic information system for road user using real time traffic volume. Main input for developing real time traffic information system is an origin-destination (O-D) matrix to represent the travel pattern. However, O-D matrices obtained through a large scale survey such as home or road side interviews, tend to be costly, labour intensive and time disruptive to trip makers. Therefore, the alternative of using traffic counts to estimate O-D matrices is particularly attractive. Models of transport demand have been used for many years to synthesize O-D matrices in study areas. A typical example of the approach is the gravity model; its functional form, plus the appropriate values for the parameters involved, is employed to produce acceptable matrices representing trip making behaviour for many trip purposes and time periods. The work reported in this paper has combined the advantages of acceptable travel demand models with the low cost and availability of traffic counts. Two types of demand models have been used: gravity (GR) and gravity-opportunity (GO) models. Four estimation methods have been analysed and tested to calibrate the transport demand models from traffic counts, namely: Non-Linear-Least-Squares (NLLS), Maximum-Likelihood (ML), Maximum-Entropy (ME) and Bayes-Inference (BI). The Bandung’s Urban Traffic Movement survey has been used to test the developed method. Based on several statistical tests, the estimation methods are found to perform satisfactorily since each calibrated model reproduced the observed matrix fairly closely. The tests were carried out using two assignment techniques, all-or-nothing and equilibrium assignment.  


2016 ◽  
Author(s):  
Win N.F. McLaughlin ◽  
◽  
Eva Marie Biedron ◽  
Edward Byrd Davis ◽  
Samantha S.B. Hopkins

2021 ◽  
Vol 184 ◽  
pp. 123-130
Author(s):  
Matthias Heinrichs ◽  
Rita Cyganski ◽  
Daniel Krajzewicz
Keyword(s):  

Author(s):  
Ferdinand Bollwein ◽  
Stephan Westphal

AbstractUnivariate decision tree induction methods for multiclass classification problems such as CART, C4.5 and ID3 continue to be very popular in the context of machine learning due to their major benefit of being easy to interpret. However, as these trees only consider a single attribute per node, they often get quite large which lowers their explanatory value. Oblique decision tree building algorithms, which divide the feature space by multidimensional hyperplanes, often produce much smaller trees but the individual splits are hard to interpret. Moreover, the effort of finding optimal oblique splits is very high such that heuristics have to be applied to determine local optimal solutions. In this work, we introduce an effective branch and bound procedure to determine global optimal bivariate oblique splits for concave impurity measures. Decision trees based on these bivariate oblique splits remain fairly interpretable due to the restriction to two attributes per split. The resulting trees are significantly smaller and more accurate than their univariate counterparts due to their ability of adapting better to the underlying data and capturing interactions of attribute pairs. Moreover, our evaluation shows that our algorithm even outperforms algorithms based on heuristically obtained multivariate oblique splits despite the fact that we are focusing on two attributes only.


Sign in / Sign up

Export Citation Format

Share Document