Network-wide Crowd Flow Prediction of Sydney Trains via customized Online Non-negative Matrix Factorization

被引:52
作者
Gong, Yongshun [1 ]
Li, Zhibin [1 ]
Zhang, Jian [1 ]
Liu, Wei [1 ]
Zheng, Yu [2 ]
Kirsch, Christina [3 ]
机构
[1] Univ Technol Sydney, Sydney, NSW, Australia
[2] JD Finance, Urban Comp Business Unit, Beijing, Peoples R China
[3] Sydney Trains Operat Technol, Sydney, NSW, Australia
来源
CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT | 2018年
关键词
Crowd flow prediction; online non-negative matrix factorization; city trains network; PASSENGER FLOW;
D O I
10.1145/3269206.3271757
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Crowd Flow Prediction (CFP) is one major challenge in the intelligent transportation systems of the Sydney Trains Network. However, most advanced CFP methods only focus on entrance and exit flows at the major stations or a few subway lines, neglecting Crowd Flow Distribution (CFD) forecasting problem across the entire city network. CFD prediction plays an irreplaceable role in metro management as a tool that can help authorities plan route schedules and avoid congestion. In this paper, we propose three online non-negative matrix factorization (ONMF) models. ONMF-AO incorporates an Average Optimization strategy that adapts to stable passenger flows. ONMF-MR captures the Most Recent trends to achieve better performance when sudden changes in crowd flow occur. The Hybrid model, ONMF-H, integrates both ONMF-AO and ONMF-MR to exploit the strengths of each model in different scenarios and enhance the models' applicability to real-world situations. Given a series of CFD snapshots, both models learn the latent attributes of the train stations and, therefore, are able to capture transition patterns from one timestamp to the next by combining historic guidance. Intensive experiments on a large-scale, real-world dataset containing transactional data demonstrate the superiority of our ONMF models.
引用
收藏
页码:1243 / 1252
页数:10
相关论文
共 31 条
[1]  
[Anonymous], 2018, ARXIV180208714
[2]  
[Anonymous], 2011, Proceedings of the 2011 SIAM International Conference on Data Mining
[3]  
[Anonymous], 2012, 91 TRANSP RES BOARD
[4]  
Atluri G., 2017, ARXIV171104710
[5]  
Blondel M, 2014, JMLR WORKSH CONF PRO, V33, P96
[6]  
Cao B, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2689
[7]  
Ceapa I., 2012, Proc. of the ACM SIGKDD Intl. Workshop on Urban Computing, Beijing, P134
[8]   Exploring time variants for short-term passenger flow [J].
Chen, Mu-Chen ;
Wei, Yu .
JOURNAL OF TRANSPORT GEOGRAPHY, 2011, 19 (04) :488-498
[9]   Modeling Temporal Adoptions Using Dynamic Matrix Factorization [J].
Chua, Freddy Chong Tat ;
Oentaryo, Richard J. ;
Lim, Ee-Peng .
2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2013, :91-100
[10]   Latent Space Model for Road Networks to Predict Time-Varying Traffic [J].
Deng, Dingxiong ;
Shahabi, Cyrus ;
Demiryurek, Ugur ;
Zhu, Linhong ;
Yu, Rose ;
Liu, Yan .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :1525-1534