| 交通流时间序列分离方法 |
| |
| 引用本文： | 任江涛,谢琼琼,印鉴. 交通流时间序列分离方法[J]. 计算机应用, 2005, 25(4): 937-939. DOI: 10.3724/SP.J.1087.2005.0937 |
| |
| 作者姓名： | 任江涛 谢琼琼 印鉴 |
| |
| 作者单位： | 中山大学,计算机科学系,广东,广州,510275;中山大学,计算机科学系,广东,广州,510275;中山大学,计算机科学系,广东,广州,510275 |
| |
| 基金项目： | 国家自然科学基金资助项目(60374059)，广东省自然科学基金资助项目(04300462) |
| |
| 摘 要： | 采用聚类分析方法对交通流时间序列进行分析可以发现典型的交通流变化模式。通常 可采用欧式距离及K均值算法进行时间序列聚类,但经分析发现单凭此方法还难以实现不同变化趋 势的交通流时间序列的有效分离。针对此问题,提出了将动态时间弯曲及灰色关联度引入交通流时 间序列相似性度量,且结合层次化聚类方法对交通流时间序列进一步分离的方法。通过实验研究,发 现基于灰色关联度的层次化聚类方法能较好地实现交通流时间序列的进一步有效分离。
|
| 关 键 词： | 交通流 时间序列 分离 |
| 文章编号： | 1001-9081(2005)04-0937-03 |
Traffic flow time series separation methods |
| |
| REN Jiang-tao,XIE Qiong-qiong,YIN Jian. Traffic flow time series separation methods[J]. Journal of Computer Applications, 2005, 25(4): 937-939. DOI: 10.3724/SP.J.1087.2005.0937 |
| |
| Authors: | REN Jiang-tao XIE Qiong-qiong YIN Jian |
| |
| Affiliation: | Department of Computer Science,Zhongshan University |
| |
| Abstract: | By clustering of traffic flow time series, the typical traffic fluctuation patterns can be found. Generally, the euclidean distance and K-means algorithm can be used to clustering the time series, but it is hard to separate the time series with great different variability well. To solve this problem, fluctuation similarity measure, such as dynamic time warping and gray relation grade, and the hierarchical clustering algorithm were used to further separate the traffic flow time series. The experiments show that the proposed method can work and the gray relation grade measure is better suited for the problem than the dynamic time warping measure. |
| |
| Keywords: | traffic flow time series separation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
