Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/4400
Title: Identifying decision structures underlying activity patterns: an exploration of data mining algorithms
Authors: WETS, Geert 
VANHOOF, Koen 
Arentze, T.
TIMMERMANS, Harry 
Issue Date: 2000
Publisher: NATL ACAD SCIENCES
Source: Transportation research record, 1718. p. 1-9
Abstract: The utility-maximizing framework - in particular, the logit model - is the dominantly used framework in transportation demand modeling. Computational process modeling has been introduced as an alternative approach to deal with the complexity of activity-based models of travel demand. Current rule-based systems, however, lack a methodology to derive rules from data. The relevance and performance of data-mining algorithms that potentially can provide the required methodology are explored. In particular, the C4 algorithm is applied to derive a decision tree for transport mode choice in the context of activity scheduling from a large activity diary data set. The algorithm is compared with both an alternative method of inducing decision trees (CHAID) and a logit model on the basis of goodness-of-fit on the same data set. The ratio of correctly predicted cases of a holdout sample is almost identical for the three methods. This suggests that for data sets of comparable complexity, the accuracy of predictions does not provide grounds for either rejecting or choosing the C4 method. However, the method may have advantages related to robustness. Future research is required to determine the ability of decision tree-based models in predicting behavioral change.
Document URI: http://hdl.handle.net/1942/4400
DOI: 10.3141/1718-01
ISI #: 000176424900001
Category: A1
Type: Journal Contribution
Validations: ecoom 2003
Appears in Collections:Research publications

Show full item record

SCOPUSTM   
Citations

43
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

46
checked on Apr 22, 2024

Page view(s)

102
checked on Nov 7, 2023

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.