A data-fusion spatiotemporal matrix factorization approach for citywide traffic flow estimation and prediction under insufficient detection

IF 15.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Information Fusion Pub Date : 2025-06-01 Epub Date: 2025-01-13 DOI:10.1016/j.inffus.2025.102952
Zhengchao Zhang , Meng Li
{"title":"A data-fusion spatiotemporal matrix factorization approach for citywide traffic flow estimation and prediction under insufficient detection","authors":"Zhengchao Zhang ,&nbsp;Meng Li","doi":"10.1016/j.inffus.2025.102952","DOIUrl":null,"url":null,"abstract":"<div><div>Citywide traffic flow is essential for the urban traffic planning, traffic signal control, and automotive emission management. However, it is impractical to directly detect the traffic flow of each road segment due to the unaffordable costs of detector installment and maintenance. Under the insufficient detection, the traffic flows of road segments without detectors are totally unknown. Thus, it is imperative to estimate existing values and predict future values for traffic flows of unobserved road segments. To solve this conundrum, we propose a data-fusion spatiotemporal matrix factorization (DSTMF) approach. Firstly, the Gaussian priors are introduced to latent matrices of a matrix factorization model. Secondly, we develop an adaptive spatial regularization term, which models the dependencies of road segments through the knowledge from floating cars’ speed. Thirdly, a learnable autoregressive temporal regularization term is proposed to capture the temporal dependencies of traffic flow and predict future values. Finally, DSTMF is formulated as a quadratic programming and we design an optimization algorithm based on the alternating least squares to solve it. Validated on two real-world large-scale traffic datasets with almost 600 road segments, our method is consistently superior to well-known benchmark models for both the estimation and prediction tasks.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"118 ","pages":"Article 102952"},"PeriodicalIF":15.5000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Fusion","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1566253525000259","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/13 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Citywide traffic flow is essential for the urban traffic planning, traffic signal control, and automotive emission management. However, it is impractical to directly detect the traffic flow of each road segment due to the unaffordable costs of detector installment and maintenance. Under the insufficient detection, the traffic flows of road segments without detectors are totally unknown. Thus, it is imperative to estimate existing values and predict future values for traffic flows of unobserved road segments. To solve this conundrum, we propose a data-fusion spatiotemporal matrix factorization (DSTMF) approach. Firstly, the Gaussian priors are introduced to latent matrices of a matrix factorization model. Secondly, we develop an adaptive spatial regularization term, which models the dependencies of road segments through the knowledge from floating cars’ speed. Thirdly, a learnable autoregressive temporal regularization term is proposed to capture the temporal dependencies of traffic flow and predict future values. Finally, DSTMF is formulated as a quadratic programming and we design an optimization algorithm based on the alternating least squares to solve it. Validated on two real-world large-scale traffic datasets with almost 600 road segments, our method is consistently superior to well-known benchmark models for both the estimation and prediction tasks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于数据融合时空矩阵分解的城市交通流估计与预测
城市交通流是城市交通规划、交通信号控制和汽车尾气排放管理的重要内容。然而,由于检测器的安装和维护成本难以承受,直接检测每个路段的交通流量是不切实际的。在检测不足的情况下,没有检测的路段的交通流量是完全未知的。因此,必须对未观测路段的交通流进行现有值的估计和未来值的预测。为了解决这一难题,我们提出了一种数据融合时空矩阵分解(DSTMF)方法。首先,将高斯先验引入到矩阵分解模型的潜在矩阵中。其次,我们开发了一个自适应空间正则化项,该项通过浮动汽车的速度知识来建模路段之间的依赖关系。第三,提出了一种可学习的自回归时态正则化项,以捕获交通流的时间依赖性并预测未来值。最后,将DSTMF表述为二次规划,并设计了一种基于交替最小二乘的优化算法来求解。在两个包含近600个路段的真实世界大规模交通数据集上进行了验证,我们的方法在估计和预测任务方面始终优于知名的基准模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Fusion
Information Fusion 工程技术-计算机:理论方法
CiteScore
33.20
自引率
4.30%
发文量
161
审稿时长
7.9 months
期刊介绍: Information Fusion serves as a central platform for showcasing advancements in multi-sensor, multi-source, multi-process information fusion, fostering collaboration among diverse disciplines driving its progress. It is the leading outlet for sharing research and development in this field, focusing on architectures, algorithms, and applications. Papers dealing with fundamental theoretical analyses as well as those demonstrating their application to real-world problems will be welcome.
期刊最新文献
(a, b)-FG-functionals: a generalization of the Sugeno integral with floating domains in arbitrary closed real intervals and its applications FedCLIPOT: Federated CLIP model via parameter reusing and optimal transport Normalization-driven optimization of knowledge graph creation for semantically grounded information fusion Towards underwater image enhancement via meta-gated fusion strategy and domain adaptation Fast fuzzy clustering via sparse anchor graph with manifold and balance regularizations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1