MARC보기
LDR00000nam u2200205 4500
001000000431644
00520200224103619
008200131s2019 ||||||||||||||||| ||eng d
020 ▼a 9781392319109
035 ▼a (MiAaPQ)AAI13917977
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 004
1001 ▼a Zhan, Hongyuan.
24510 ▼a Temporal and Structural Machine Learning from Transportation Data.
260 ▼a [S.l.]: ▼b The Pennsylvania State University., ▼c 2019.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2019.
300 ▼a 180 p.
500 ▼a Source: Dissertations Abstracts International, Volume: 80-12, Section: B.
500 ▼a Publisher info.: Dissertation/Thesis.
500 ▼a Advisor: Madduri, Kamesh.
5021 ▼a Thesis (Ph.D.)--The Pennsylvania State University, 2019.
520 ▼a Transportation is arguably speaking one of the most critical functions of human society. It has been an important societal problem since the ancient age, yet the solution is still far from perfect in the twenty-first century. The needs for efficient and safe transportation are ever-growing, due to prolonging life expectancy and diminishing reserves of fossil fuels which most transportation modes rely on in the present day.At the same time, we are facing unprecedented growth of data. Can the society utilize data, a cyber-resource, to solve the physical challenges in modern transportation needs? This question motivates the research in my dissertation. Machine learning, broadly speaking, are algorithms that aim to generalize a set of rules from existent data for describing the data generating process, predicting future events, and producing informed decision making. This dissertation studies previous machine learning methods, improves upon them, and develops new algorithms to contribute in essential aspects of transportation systems. Two important topics in transportation systems are addressed in this dissertation, traffic flow prediction and traffic safety analysis.Traffic flow prediction is a fundamental component in an intelligent transportation system. Accurate traffic predictions are building blocks to achieve efficient routing, smart city planing, reduced energy consumption and among others. Traffic flows are multi-modal and possibly non-stationary due to unusual events. Hence, the learning algorithms for traffic flow prediction need to be robust and adaptive. In addition, the models must be able to learn from latest traffic flow without severely comprising the computational efficiency, in order to meet real-time computation requirements during online deployment. Therefore, learning algorithms for traffic flow prediction developed in this dissertation are designed with the goal to achieve robustness, adaptiveness, and computational efficiency.Traffic safety in transportation systems is as important as efficiency. Rather than predicting the outcome of crashes, it is more valuable to prevent future accidents by learning from past experiences. The second theme in this dissertation studies machine learning models for analyzing factors contributing to the outcome of crashes. The same accident factor may have diverse degrees of influence on different people, due to the unobserved individual heterogeneity. Capturing heterogeneous effect is difficult in general. A viable approach is to impose structure on the unobserved heterogeneity of different individuals. Under some structural assumptions, it is possible to account for the individual differences with respect to accident factors.Temporal learning addressed problems arisen from traffic flow prediction. Structural learning is an approach for modeling individual heterogeneity, aiming to quantify the influence of accident factors.
590 ▼a School code: 0176.
650 4 ▼a Statistics.
650 4 ▼a Transportation.
650 4 ▼a Computer science.
690 ▼a 0463
690 ▼a 0709
690 ▼a 0984
71020 ▼a The Pennsylvania State University. ▼b Computer Science and Engineering.
7730 ▼t Dissertations Abstracts International ▼g 80-12B.
773 ▼t Dissertation Abstract International
790 ▼a 0176
791 ▼a Ph.D.
792 ▼a 2019
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T15492654 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 202002 ▼f 2020
990 ▼a ***1008102
991 ▼a E-BOOK