Construction of Driving Condition Based on Discrete Fourier Transform and Improved K-Means Clustering Algorithm

Shuping Xu, Yueqiu Huang
{"title":"Construction of Driving Condition Based on Discrete Fourier Transform and Improved K-Means Clustering Algorithm","authors":"Shuping Xu, Yueqiu Huang","doi":"10.2478/ijanmc-2023-0047","DOIUrl":null,"url":null,"abstract":"Abstract In view of the low execution efficiency and slow convergence speed of traditional clustering algorithms, the initial clustering center has a greater impact on the clustering results, which leads to the problem of reduced algorithm accuracy. This paper proposes an improved K-means algorithm (Grid-K-means), that is, the Grid density is used to determine the initial clustering center; According to the density, the grid points are sorted to eliminate the idea of noise grid points and invalid grid points, so as to improve the efficiency and accuracy of the algorithm. First, the discrete Fourier transform was used to filter the original data, and then the principal component analysis and the improved K-means clustering algorithm were used to reduce and classify the kinematics fragments respectively, so as to construct the driving conditions of the vehicle. The experimental results show that this method can effectively improve the construction accuracy and reduce the construction time, and the fitted driving conditions can effectively reflect the local actual traffic conditions.","PeriodicalId":193299,"journal":{"name":"International Journal of Advanced Network, Monitoring and Controls","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advanced Network, Monitoring and Controls","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ijanmc-2023-0047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract In view of the low execution efficiency and slow convergence speed of traditional clustering algorithms, the initial clustering center has a greater impact on the clustering results, which leads to the problem of reduced algorithm accuracy. This paper proposes an improved K-means algorithm (Grid-K-means), that is, the Grid density is used to determine the initial clustering center; According to the density, the grid points are sorted to eliminate the idea of noise grid points and invalid grid points, so as to improve the efficiency and accuracy of the algorithm. First, the discrete Fourier transform was used to filter the original data, and then the principal component analysis and the improved K-means clustering algorithm were used to reduce and classify the kinematics fragments respectively, so as to construct the driving conditions of the vehicle. The experimental results show that this method can effectively improve the construction accuracy and reduce the construction time, and the fitted driving conditions can effectively reflect the local actual traffic conditions.
基于离散傅里叶变换和改进k均值聚类算法的驾驶条件构建
摘要针对传统聚类算法执行效率低、收敛速度慢的问题,初始聚类中心对聚类结果的影响较大,从而导致算法精度降低的问题。本文提出了一种改进的K-means算法(Grid-K-means),即利用网格密度确定初始聚类中心;根据密度对网格点进行排序,消除了噪声网格点和无效网格点的思想,提高了算法的效率和精度。首先利用离散傅里叶变换对原始数据进行滤波,然后利用主成分分析和改进的K-means聚类算法分别对运动学碎片进行约简和分类,从而构建车辆的行驶工况。实验结果表明,该方法能有效提高施工精度,缩短施工时间,拟合的行驶条件能有效反映当地实际交通状况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信