用于共享单车系统流量预测的新型软聚类法

IF 3.1 3区 工程技术 Q2 ENVIRONMENTAL STUDIES
Kyoungok Kim
{"title":"用于共享单车系统流量预测的新型软聚类法","authors":"Kyoungok Kim","doi":"10.1080/15568318.2024.2356141","DOIUrl":null,"url":null,"abstract":"<div><p>For the efficient management of bike-sharing systems (BSSs), accurate demand predictions are crucial to address the uneven distribution of bikes at various stations. Recent studies have explored a hierarchical prediction framework using cluster-level models to more accurately estimate demand at the station level. However, in frameworks based on hard clustering, where each station is exclusively assigned to one of several clusters, prediction accuracy tends to be lower for stations at the cluster boundaries. To improve accuracy for such stations, this study proposes a novel soft clustering algorithm for BSSs. The key idea is to allow stations to belong to multiple clusters, calculating the membership degree for each station based on transitions between stations and clusters obtained through hard clustering. This study also investigated the impact of restricting clusters to which individual stations belong based on distance or usage history. Two approaches, distance- and usage-based, were employed to determine the clusters to which each station belongs. Experimental results using Seoul Bike data demonstrate the effectiveness of the proposed method in enhancing traffic prediction accuracy within the hierarchical prediction framework. Notably, excluding clusters with minimal usage for each station using the usage-based approach yielded the best performance.</p></div>","PeriodicalId":47824,"journal":{"name":"International Journal of Sustainable Transportation","volume":"18 6","pages":"Pages 492-504"},"PeriodicalIF":3.1000,"publicationDate":"2024-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new soft clustering method for traffic prediction in bike-sharing systems\",\"authors\":\"Kyoungok Kim\",\"doi\":\"10.1080/15568318.2024.2356141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>For the efficient management of bike-sharing systems (BSSs), accurate demand predictions are crucial to address the uneven distribution of bikes at various stations. Recent studies have explored a hierarchical prediction framework using cluster-level models to more accurately estimate demand at the station level. However, in frameworks based on hard clustering, where each station is exclusively assigned to one of several clusters, prediction accuracy tends to be lower for stations at the cluster boundaries. To improve accuracy for such stations, this study proposes a novel soft clustering algorithm for BSSs. The key idea is to allow stations to belong to multiple clusters, calculating the membership degree for each station based on transitions between stations and clusters obtained through hard clustering. This study also investigated the impact of restricting clusters to which individual stations belong based on distance or usage history. Two approaches, distance- and usage-based, were employed to determine the clusters to which each station belongs. Experimental results using Seoul Bike data demonstrate the effectiveness of the proposed method in enhancing traffic prediction accuracy within the hierarchical prediction framework. Notably, excluding clusters with minimal usage for each station using the usage-based approach yielded the best performance.</p></div>\",\"PeriodicalId\":47824,\"journal\":{\"name\":\"International Journal of Sustainable Transportation\",\"volume\":\"18 6\",\"pages\":\"Pages 492-504\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-06-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Sustainable Transportation\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/org/science/article/pii/S1556831824000145\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENVIRONMENTAL STUDIES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Sustainable Transportation","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/org/science/article/pii/S1556831824000145","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENVIRONMENTAL STUDIES","Score":null,"Total":0}
引用次数: 0

摘要

为了有效管理共享单车系统(BSS),准确的需求预测对于解决单车在不同站点分布不均的问题至关重要。最近的研究探索了一种分层预测框架,利用集群级模型来更准确地估计站点级的需求。然而,在基于硬聚类的框架中,每个站点都被专门分配到几个聚类中的一个,位于聚类边界的站点的预测精度往往较低。为了提高这类站点的预测精度,本研究提出了一种新颖的 BSS 软聚类算法。其主要思想是允许站点属于多个聚类,根据站点与通过硬聚类获得的聚类之间的转换来计算每个站点的成员度。这项研究还调查了根据距离或使用历史限制单个站点所属群组的影响。我们采用了基于距离和基于使用情况的两种方法来确定每个站点所属的聚类。使用首尔自行车数据的实验结果表明,在分层预测框架内,所提出的方法在提高交通预测准确性方面非常有效。值得注意的是,使用基于使用率的方法排除每个站点使用率最低的聚类,可获得最佳性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new soft clustering method for traffic prediction in bike-sharing systems

For the efficient management of bike-sharing systems (BSSs), accurate demand predictions are crucial to address the uneven distribution of bikes at various stations. Recent studies have explored a hierarchical prediction framework using cluster-level models to more accurately estimate demand at the station level. However, in frameworks based on hard clustering, where each station is exclusively assigned to one of several clusters, prediction accuracy tends to be lower for stations at the cluster boundaries. To improve accuracy for such stations, this study proposes a novel soft clustering algorithm for BSSs. The key idea is to allow stations to belong to multiple clusters, calculating the membership degree for each station based on transitions between stations and clusters obtained through hard clustering. This study also investigated the impact of restricting clusters to which individual stations belong based on distance or usage history. Two approaches, distance- and usage-based, were employed to determine the clusters to which each station belongs. Experimental results using Seoul Bike data demonstrate the effectiveness of the proposed method in enhancing traffic prediction accuracy within the hierarchical prediction framework. Notably, excluding clusters with minimal usage for each station using the usage-based approach yielded the best performance.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
8.90
自引率
2.60%
发文量
56
期刊介绍: The International Journal of Sustainable Transportation provides a discussion forum for the exchange of new and innovative ideas on sustainable transportation research in the context of environmental, economical, social, and engineering aspects, as well as current and future interactions of transportation systems and other urban subsystems. The scope includes the examination of overall sustainability of any transportation system, including its infrastructure, vehicle, operation, and maintenance; the integration of social science disciplines, engineering, and information technology with transportation; the understanding of the comparative aspects of different transportation systems from a global perspective; qualitative and quantitative transportation studies; and case studies, surveys, and expository papers in an international or local context. Equal emphasis is placed on the problems of sustainable transportation that are associated with passenger and freight transportation modes in both industrialized and non-industrialized areas. All submitted manuscripts are subject to initial evaluation by the Editors and, if found suitable for further consideration, to peer review by independent, anonymous expert reviewers. All peer review is single-blind. Submissions are made online via ScholarOne Manuscripts.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信