2020
DOI: 10.7782/jksr.2020.23.3.204
|View full text |Cite
|
Sign up to set email alerts
|

Generating Travel Patterns of Public Transportation Users Using a k-means Clustering Based on Smart Card Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Ten, only the travel records in which both the boarding and alighting area codes matched the codes of the 44 dongs in Seongnam were extracted; and there were 1,103,306 trips within Seongnam, suggesting that most trips occurred within the city. Next, to obtain the travel patterns, only the travel records of the elderly who traveled more than three days (10% of the analysis period) were extracted [39]. Finally, abnormal records with missing values or errors were eliminated.…”
Section: Data Preprocessing and Results Of Gmm Applicationmentioning
confidence: 99%
See 1 more Smart Citation
“…Ten, only the travel records in which both the boarding and alighting area codes matched the codes of the 44 dongs in Seongnam were extracted; and there were 1,103,306 trips within Seongnam, suggesting that most trips occurred within the city. Next, to obtain the travel patterns, only the travel records of the elderly who traveled more than three days (10% of the analysis period) were extracted [39]. Finally, abnormal records with missing values or errors were eliminated.…”
Section: Data Preprocessing and Results Of Gmm Applicationmentioning
confidence: 99%
“…As the partitioning clustering algorithm has a linear time complexity with respect to the data size, it can efciently process large datasets [38]. Consequently, it has been applied to various research felds and is widely used in studies involving large smart-card datasets [39,40]. Te most typical partitioning clustering algorithm, the k-means algorithm, rapidly determines cluster membership by minimizing the distance between the central point and the other data points in the cluster.…”
Section: Methodsmentioning
confidence: 99%