2021
DOI: 10.1016/j.trc.2021.103370
|View full text |Cite
|
Sign up to set email alerts
|

A DBSCAN-based framework to mine travel patterns from origin-destination matrices: Proof-of-concept on proxy static OD from Brisbane

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(11 citation statements)
references
References 49 publications
0
11
0
Order By: Relevance
“…These time series were used as inputs for the DBSCAN to complete the clustering, and a total of 3 HSR station classification clusters were finally generated. As opposed to k-means (Laharotte et al, 2015), DBSCAN does not require one to specify the number of clusters in the data the prior (Behara et al, 2021), in which the resulting number of clusters is the optimal result. Therefore, the classes of HSR stations in this study are determined to be 3.…”
Section: Classification Results and Spatiotemporal Characteristics Of...mentioning
confidence: 99%
“…These time series were used as inputs for the DBSCAN to complete the clustering, and a total of 3 HSR station classification clusters were finally generated. As opposed to k-means (Laharotte et al, 2015), DBSCAN does not require one to specify the number of clusters in the data the prior (Behara et al, 2021), in which the resulting number of clusters is the optimal result. Therefore, the classes of HSR stations in this study are determined to be 3.…”
Section: Classification Results and Spatiotemporal Characteristics Of...mentioning
confidence: 99%
“…(3) Outliers: A sample that is neither a core point nor a border point [54,57]. Figure 4 illustrates the process of the DBSCAN clustering algorithm [31,58,59], where A is a randomly selected point in the sample points. First, set the radius and the minimum number of sample points contained within the circle and draw a circle around A.…”
Section: Density-based Clusteringmentioning
confidence: 99%
“…The DBSCAN algorithm has been proven effective for extracting meaningful spatial clusters and performs better than other similar algorithms in the presence of data noise, which is often seen in traffic datasets. 20 Denote N min as the minimum number threshold of data samples required to be considered as a cluster and 饾渶 as the distance threshold for two data samples being in the same cluster. The basic process of the DBSCAN clustering algorithm is stated as follows.…”
Section: Spatial Clusteringmentioning
confidence: 99%
“…The destination coordinates in the training subset are used as the input for the DBSCAN clustering and the test subset is used for prediction performance evaluation. We adjust the threshold parameter of the minimum number of data samples required to be considered as a cluster in the DBSCAN clustering algorithm with values from (3,5,10,20), to obtain different cluster numbers for comparison. There are approximately 5800 vehicles in the dataset.…”
Section: Dataset Descriptionmentioning
confidence: 99%