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 pp. 59-68. (Lecture Notes in Computer Science, 4223/2006). (doi:10.1007/11881599_8).


Full text not available from this repository.


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
Digital Object Identifier (DOI): doi:10.1007/11881599_8
Additional Information: Book Chapter: Fuzzy Systems and Knowledge Discovery, ISBN: 978-3-540-45916-3
ISBNs: 9783540459163 (print)
ISSNs: 0302-9743 (print)

ePrint ID: 53292
Date :
Date Event
28 September 2006Published
Date Deposited: 22 Jul 2008
Last Modified: 16 Apr 2017 17:50
Further Information:Google Scholar

Actions (login required)

View Item View Item