An Algorithm for High-Dimensional Traffic Data Clustering
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.
KeywordsDiscrete Fourier Transform Traffic Data Optimal Partition Initial Partition Partition Matrix
Unable to display preview. Download preview PDF.
- 9.Jones, D., Beltramo, M.A.: Solving Partitioning Problems with Genetic Algorithms. In: Proceedings of Fourth International Conference of Genetic Algorithms, pp. 442–449 (1991)Google Scholar
- 13.Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K., Suel, T.: Optimal Histograms with Quality Guarantees. In: Proceedings of the 24th VLDB Conference, New York, USA (1998)Google Scholar