<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/10173006> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/terms/title> "A new framework for assessing classification algorithms for\r\nmode choice prediction"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/ontology/bibo/abstract> "Predicting passenger mode choice is an essential task for transport network simulation and operations\r\nmanagement. Machine Learning (ML) classifiers trained on trip diary data are increasingly being investigated as an alternative to Discrete Choice Models (DCMs) for mode choice prediction.\r\nIn order to determine the suitability of a particular algorithm for predicting mode choice, it is crucial\r\nto be able to reliably quantify its predictive performance for unknown trips. In this paper we propose and\r\ntest a new framework for performance estimation of classification algorithms.\r\nFirstly, we address three key issues in the literature relating to a) performance metrics for model training, b) sampling methods for model validation, and c) hyperparameter selection for model optimisation.\r\nAlternative methods are proposed for each of these issues to form the new framework. The framework is\r\nthen used to compare the suitability of eight different ML classification algorithms for predicting mode\r\nchoice. Finally, the implications of the sampling method employed are then investigated experimentally."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/terms/date> "2018-09-07" .
<https://discovery.ucl.ac.uk/id/document/1619736> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/ontology/bibo/volume> "7" .
<https://discovery.ucl.ac.uk/id/org/ext-d024c84c9edf37a94d68f7c0f30418fb> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<https://discovery.ucl.ac.uk/id/org/ext-d024c84c9edf37a94d68f7c0f30418fb> <http://xmlns.com/foaf/0.1/name> "hEART"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/terms/publisher> <https://discovery.ucl.ac.uk/id/org/ext-d024c84c9edf37a94d68f7c0f30418fb> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-6ebc114711b0318e294cf597c3776421> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10173006#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10173006#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://discovery.ucl.ac.uk/id/person/ext-6ebc114711b0318e294cf597c3776421> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-1f94e6c00e2d08699e0b9b26ac599af1> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10173006#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10173006#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://discovery.ucl.ac.uk/id/person/ext-1f94e6c00e2d08699e0b9b26ac599af1> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-07f09f9ffbe8ae9c0f599cc2179c81ae> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10173006#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10173006#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_3> <https://discovery.ucl.ac.uk/id/person/ext-07f09f9ffbe8ae9c0f599cc2179c81ae> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-70b0727beda6c91c5729474447d9cadb> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10173006#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10173006#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_4> <https://discovery.ucl.ac.uk/id/person/ext-70b0727beda6c91c5729474447d9cadb> .
<https://discovery.ucl.ac.uk/id/person/ext-1f94e6c00e2d08699e0b9b26ac599af1> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-1f94e6c00e2d08699e0b9b26ac599af1> <http://xmlns.com/foaf/0.1/givenName> "Michel"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-1f94e6c00e2d08699e0b9b26ac599af1> <http://xmlns.com/foaf/0.1/familyName> "Bierlaire"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-1f94e6c00e2d08699e0b9b26ac599af1> <http://xmlns.com/foaf/0.1/name> "Michel Bierlaire"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-6ebc114711b0318e294cf597c3776421> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-6ebc114711b0318e294cf597c3776421> <http://xmlns.com/foaf/0.1/givenName> "Tim"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-6ebc114711b0318e294cf597c3776421> <http://xmlns.com/foaf/0.1/familyName> "Hillel"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-6ebc114711b0318e294cf597c3776421> <http://xmlns.com/foaf/0.1/name> "Tim Hillel"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-70b0727beda6c91c5729474447d9cadb> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-70b0727beda6c91c5729474447d9cadb> <http://xmlns.com/foaf/0.1/givenName> "Ying"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-70b0727beda6c91c5729474447d9cadb> <http://xmlns.com/foaf/0.1/familyName> "Jin"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-70b0727beda6c91c5729474447d9cadb> <http://xmlns.com/foaf/0.1/name> "Ying Jin"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-07f09f9ffbe8ae9c0f599cc2179c81ae> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-07f09f9ffbe8ae9c0f599cc2179c81ae> <http://xmlns.com/foaf/0.1/givenName> "Mohammed"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-07f09f9ffbe8ae9c0f599cc2179c81ae> <http://xmlns.com/foaf/0.1/familyName> "Elshafie"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-07f09f9ffbe8ae9c0f599cc2179c81ae> <http://xmlns.com/foaf/0.1/name> "Mohammed Elshafie"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/ontology/bibo/presentedAt> <https://discovery.ucl.ac.uk/id/event/ext-9f431864ecbf2d123e424d4ce2c8bc4b> .
<https://discovery.ucl.ac.uk/id/event/ext-9f431864ecbf2d123e424d4ce2c8bc4b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Conference> .
<https://discovery.ucl.ac.uk/id/event/ext-9f431864ecbf2d123e424d4ce2c8bc4b> <http://purl.org/dc/terms/title> "hEART 2018: 7th Symposium of the European Association for Research in Transportation"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/event/ext-9f431864ecbf2d123e424d4ce2c8bc4b> <http://purl.org/NET/c4dm/event.owl#place> <https://discovery.ucl.ac.uk/id/location/ext-1ce98b288bedf2e5ad79ba68309d0ea1> .
<https://discovery.ucl.ac.uk/id/event/ext-9f431864ecbf2d123e424d4ce2c8bc4b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/NET/c4dm/event.owl#Event> .
<https://discovery.ucl.ac.uk/id/event/ext-9f431864ecbf2d123e424d4ce2c8bc4b> <http://purl.org/NET/c4dm/event.owl#place> <https://discovery.ucl.ac.uk/id/location/ext-1ce98b288bedf2e5ad79ba68309d0ea1> .
<https://discovery.ucl.ac.uk/id/location/ext-1ce98b288bedf2e5ad79ba68309d0ea1> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2003/01/geo/wgs84_pos#SpatialThing> .
<https://discovery.ucl.ac.uk/id/location/ext-1ce98b288bedf2e5ad79ba68309d0ea1> <http://www.w3.org/2000/01/rdf-schema#label> "National Technical University of Athens, Greece"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ProceedingsSectionEPrint> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/repository> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1619736> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1619736> <http://www.w3.org/2000/01/rdf-schema#label> "A new framework for assessing classification algorithms for\r\nmode choice prediction (Text)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://purl.org/dc/elements/1.1/hasVersion> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://eprints.org/ontology/hasPublished> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1619736> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10173006/1/5446.pdf> .
<https://discovery.ucl.ac.uk/id/document/1619736> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10173006/1/5446.pdf> .
<https://discovery.ucl.ac.uk/id/eprint/10173006/1/5446.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "5446.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1651974> .
<https://discovery.ucl.ac.uk/id/document/1651974> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1651974> <http://www.w3.org/2000/01/rdf-schema#label> "A new framework for assessing classification algorithms for\r\nmode choice prediction (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1651974> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651974> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651974> <http://eprints.org/relation/isIndexCodesVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651974> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10173006/2/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/document/1651974> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10173006/2/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/eprint/10173006/2/indexcodes.txt> <http://www.w3.org/2000/01/rdf-schema#label> "indexcodes.txt"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1651975> .
<https://discovery.ucl.ac.uk/id/document/1651975> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1651975> <http://www.w3.org/2000/01/rdf-schema#label> "A new framework for assessing classification algorithms for\r\nmode choice prediction (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1651975> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651975> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651975> <http://eprints.org/relation/islightboxThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651975> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10173006/3/lightbox.jpg> .
<https://discovery.ucl.ac.uk/id/document/1651975> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10173006/3/lightbox.jpg> .
<https://discovery.ucl.ac.uk/id/eprint/10173006/3/lightbox.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "lightbox.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1651976> .
<https://discovery.ucl.ac.uk/id/document/1651976> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1651976> <http://www.w3.org/2000/01/rdf-schema#label> "A new framework for assessing classification algorithms for\r\nmode choice prediction (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1651976> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651976> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651976> <http://eprints.org/relation/ispreviewThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651976> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10173006/4/preview.jpg> .
<https://discovery.ucl.ac.uk/id/document/1651976> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10173006/4/preview.jpg> .
<https://discovery.ucl.ac.uk/id/eprint/10173006/4/preview.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "preview.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1651977> .
<https://discovery.ucl.ac.uk/id/document/1651977> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1651977> <http://www.w3.org/2000/01/rdf-schema#label> "A new framework for assessing classification algorithms for\r\nmode choice prediction (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1651977> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651977> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651977> <http://eprints.org/relation/ismediumThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651977> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10173006/5/medium.jpg> .
<https://discovery.ucl.ac.uk/id/document/1651977> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10173006/5/medium.jpg> .
<https://discovery.ucl.ac.uk/id/eprint/10173006/5/medium.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "medium.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1651978> .
<https://discovery.ucl.ac.uk/id/document/1651978> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1651978> <http://www.w3.org/2000/01/rdf-schema#label> "A new framework for assessing classification algorithms for\r\nmode choice prediction (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1651978> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651978> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651978> <http://eprints.org/relation/issmallThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/1619736> .
<https://discovery.ucl.ac.uk/id/document/1651978> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10173006/6/small.jpg> .
<https://discovery.ucl.ac.uk/id/document/1651978> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10173006/6/small.jpg> .
<https://discovery.ucl.ac.uk/id/eprint/10173006/6/small.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "small.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10173006> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://discovery.ucl.ac.uk/id/eprint/10173006/> .
<https://discovery.ucl.ac.uk/id/eprint/10173006/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #10173006 \n\nA new framework for assessing classification algorithms for&#13;\nmode choice prediction\n\n" .
<https://discovery.ucl.ac.uk/id/eprint/10173006/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://discovery.ucl.ac.uk/id/eprint/10173006/> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/10173006> .