基于粒子群优化算法的交通数据流聚类分析  

Clustering Analysis of Traffic Data Stream Based on Particle Swarm Optimization Algorithm

作　　者：潘云伟[1] 成卫[1] 肖海承[1] 赵明翠[1] 

机构地区：[1]昆明理工大学交通工程学院,昆明650224

出　　处：《科学技术与工程》2010年第28期7078-7081,共4页Science Technology and Engineering

基　　金：昆明理工大学学术科技创新基金课题(2010YC131)资助

摘　　要：针对交通数据流聚类分析过程中生成顺序的不确定性,提出了采用基于网格和密度的D-Stream算法对交通数据流进行聚类分析,并将粒子群优化算法引入聚类过程,从而对数据流聚类分析方法进行了改进,使数据聚类能够根据本身的密度极大值有序生成,增强了用户对聚类过程的控制能力。通过昆明市实测交通数据流进行聚类分析,得到了能够反映交通状况不同特征的聚类结果和动态的控制策略,并对交通数据流的相关研究工作提供决策支持。Aiming at the uncertainty of generating sequence in the traffic stream clustering analyzing process,D-Stream algorithm is employed,which is based on grid and density,to cluster traffic.And hybrid particle swarm optimization algorithm is introduced into the clustering.Then data stream clustering method is improved.It can make clustering generated in order according to the density maximum value itself.It strengthen the users to control the clustering process.At last it obtains some categories that are able to reflect the different traffic status and dynamic control tactics by analyzing the practical traffic data stream of Kunming.Then the result could offer the decision-making support to the related study of traffic data stream.

关 键 词：D-Stream算法 粒子群优化算法 交通数据流 

分 类 号：U491[交通运输工程—交通运输规划与管理]