Railway Station Clustering based on Origin-Destination Patterns using Graph Polishing
-
- Hosoe Mio
- Tottori University
-
- Kuwano Masashi
- Tottori University
-
- Moriyama Taku
- Tottori University
Bibliographic Information
- Other Title
-
- グラフ研磨を用いた乗降パターンによる駅のクラスタリング
Abstract
<p>With the development of ICT, interest in traffic policy planning by utilizing large varieties of accumulated big data has been increasing. In recent years, graph polishing has been proposed as a new methodology for graph clustering. Graph polishing is one of the graph clustering methods. This method can be used to extract groups that are similar or related to each other by clarifying the cluster structures in the data. This study classifies railway stations by applying the graph polishing to smart card data that has been introduced in Kagawa Prefecture, Japan. This study uses 9,008,709 data collected during the 15 months from December 1st, 2013 to February 28th, 2015, and prepares Origin-Destination network. Then, this study clarifies station groups and examines the usefulness of graph polishing to Origin-Destination network clustering.</p>
Journal
-
- Journal of the City Planning Institute of Japan
-
Journal of the City Planning Institute of Japan 55 (3), 690-696, 2020-10-25
The City Planning Institute of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1391693801396546432
-
- NII Article ID
- 130007930110
-
- ISSN
- 21850593
- 09160647
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed