A Mixture Model-based Clustering Method for Fundamental Diagram Calibration Applied in Large Network Simulation

Ding Wang, K. Ozbay, Zilin Bian
{"title":"A Mixture Model-based Clustering Method for Fundamental Diagram Calibration Applied in Large Network Simulation","authors":"Ding Wang, K. Ozbay, Zilin Bian","doi":"10.1109/ITSC45102.2020.9294346","DOIUrl":null,"url":null,"abstract":"In traditional methods, fundamental diagrams (FDs) were calibrated offline with a limited number of links. Although few recent studies have paid attention to employing cluster techniques to calibrate link FDs for network level analysis, they were mainly focused on heuristic clustering methods, such as k-means and hierarchical clustering algorithm which might lead to poor performance when there are overlaps between clusters. This paper proposed a mixture model-based clustering framework to calibrate link FDs for network level simulation. This method can be applied to discover a relatively small number of representative link FDs when simulating very large networks with time and budget constraints. In addition, the proposed method can be used to investigate the spatial distribution of links with similar FDs. The proposed method is tested with 567 links using one year’s data from the Northern California.","PeriodicalId":394538,"journal":{"name":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","volume":"55 22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC45102.2020.9294346","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In traditional methods, fundamental diagrams (FDs) were calibrated offline with a limited number of links. Although few recent studies have paid attention to employing cluster techniques to calibrate link FDs for network level analysis, they were mainly focused on heuristic clustering methods, such as k-means and hierarchical clustering algorithm which might lead to poor performance when there are overlaps between clusters. This paper proposed a mixture model-based clustering framework to calibrate link FDs for network level simulation. This method can be applied to discover a relatively small number of representative link FDs when simulating very large networks with time and budget constraints. In addition, the proposed method can be used to investigate the spatial distribution of links with similar FDs. The proposed method is tested with 567 links using one year’s data from the Northern California.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于混合模型的聚类方法在大型网络仿真中的应用
在传统的方法中,基本图(fd)是用有限的链接离线校准的。虽然最近的研究很少关注使用聚类技术来校准网络级分析的链路fd,但它们主要集中在启发式聚类方法上,如k-means和分层聚类算法,这些方法在聚类之间存在重叠时可能导致性能不佳。本文提出了一种基于混合模型的聚类框架,用于校正网络级仿真中的链路fd。当模拟具有时间和预算约束的大型网络时,该方法可用于发现数量相对较少的具有代表性的链路fd。此外,该方法还可用于研究具有相似FDs的链接的空间分布。该方法使用北加州一年的数据对567个链接进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CR-TMS: Connected Vehicles enabled Road Traffic Congestion Mitigation System using Virtual Road Capacity Inflation A novel concept for validation of pre-crash perception sensor information using contact sensor Space-time Map based Path Planning Scheme in Large-scale Intelligent Warehouse System Weakly-supervised Road Condition Classification Using Automatically Generated Labels Studying the Impact of Public Transport on Disaster Evacuation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1