Highway characteristic Classification using TwoStep Clustering Algorithm: Methodology and Case Study in Korea
- Authors
- CHO,JUNHAN; KIM, SEONG HO; KIM,WONCHUL
- Issue Date
- Nov-2009
- Publisher
- Eastern Asia Society for Transportation Studies
- Keywords
- Highway characteristic classification; Factor analysis; TwoStep clustering algorithm; Optimal number of clustering
- Citation
- Proceedings of the Eastern Asia Society for Transportation Studies, v.7, pp.1 - 14
- Indexed
- OTHER
- Journal Title
- Proceedings of the Eastern Asia Society for Transportation Studies
- Volume
- 7
- Start Page
- 1
- End Page
- 14
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/40695
- DOI
- 10.11175/eastpro.2009.0.288.0
- Abstract
- This paper reports reasonable methodology of the optimal solution for the highway classification and discusses the results of experiments comparing four different clustering methods. A new concept of highway characteristic classification (HCC) and its methodologies were applied to identify traffic patterns in highway segments. The HCC consists of four different steps, such as data preprocessing, clustering, characterization, and classification. This study evaluated the performance of four clustering methods: Ward's minimum variance clustering method, K-means clustering method, Kohonen self-organizing map, and the Two-step clustering algorithm. The TwoStep clustering algorithm provides the best performance in term of within-group errors. The four clusters in the TwoStep clustering algorithm were determined the acceptable number of cluster. The highway schemes based on procedure of HCC are four designated area types as urban, suburban, rural, and recreational area.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > DEPARTMENT OF TRANSPORTATION AND LOGISTICS ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/40695)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.