An algorithm for high-dimensional traffic data clustering


Zheng, Pengjun and McDonald, Mike (2006) An algorithm for high-dimensional traffic data clustering. In, Fuzzy Systems and Knowledge Discovery. Berlin / Heidelberg, Springer, 59-68. (Lecture Notes in Computer Science, 4223/2006). (doi:10.1007/11881599_8).

Download

Full text not available from this repository.

Original Publication URL: http://dx.doi.org/10.1007/11881599_8

Description/Abstract

High-dimensional fuzzy clustering may converge to a local optimum that is significantly inferior to the global optimal partition. In this paper, a two-stage fuzzy clustering method is proposed. In the first stage, clustering is applied on the compact data that is obtained by dimensionality reduction from the full-dimensional data. The optimal partition identified from the compact data is then used as the initial partition in the second stage clustering based on full-dimensional data, thus effectively reduces the possibility of local optimum. It is found that the proposed two-stage clustering method can generally avoid local optimum without computation overhead. The proposed method has been applied to identify optimal day groups for traffic profiling using operational traffic data. The identified day groups are found to be intuitively reasonable and meaningful.

Item Type: Book Section
Additional Information: Book Chapter: Fuzzy Systems and Knowledge Discovery, ISBN: 978-3-540-45916-3
ISBNs: 9783540459163 (hardback)
ISSNs: 0302-9743 (print)
Related URLs:
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
H Social Sciences > HE Transportation and Communications
T Technology > TA Engineering (General). Civil engineering (General)
Divisions: University Structure - Pre August 2011 > School of Civil Engineering and the Environment
ePrint ID: 53292
Date Deposited: 22 Jul 2008
Last Modified: 27 Mar 2014 18:36
URI: http://eprints.soton.ac.uk/id/eprint/53292

Actions (login required)

View Item View Item