A clustering algorithm for time series data

被引：0

作者：

Yin, Jian ^{[1
]}

Zhou, Duanning ^{[2
]}

Xie, Qiong-Qiong ^{[1
]}

机构：

[1] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Peoples R China

[2] Eastern Washington Univ, Dept Accounting & Informat Syst, Washington, DC USA

来源：

SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS | 2006年

基金：

中国国家自然科学基金;

关键词：

data mining; clustering; time series; traffic flow;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In the Intelligent Traffic System, the research about the analysis of time series of traffic flow is important and meaningful. Using clustering methods to analyze time series not only can find some typical patterns of traffic flow, but also can group the sections of highway by their different flow characteristics. In this paper, we propose an Encoded-Bitmap-approach-based swap method to improve the classic hierarchical method. Experiments show that the proposed method has a better performance on the change trend of time series than classic algorithm.

引用

页码：119 / +

页数：2

共 8 条

[1]

[Anonymous], 2004, Proceedings of the 17th international FLAIRS conference

[2]

Darvish A, 2004, 2004 IEEE COMPUTATIONAL SYSTEMS BIOINFORMATICS CONFERENCE, PROCEEDINGS, P602

[3]

DENTON A, 2004, 10 ACM SIGKDD INT C

[4] A min-max cut algorithm for graph partitioning and data clustering [J].

Ding, CHQ ;

He, XF ;

Zha, HY ;

Gu, M ;

Simon, HD .

2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, :107-114

[5]

Jiang DX, 2003, THIRD IEEE SYMPOSIUM ON BIOINFORMATICS AND BIOENGINEERING - BIBE 2003, PROCEEDINGS, P393

[6]

RODRIGUES P, 2004, 1 INT WORKSH KNOWL D

[7]

SHEKHAR S, 2001, 01015 TR U MINN

[8]

YOON J, 2000, SPIE C DAT MIN KNOWL, V2, P201

← 1 →