Research on Taxi Operation Characteristics by Improved DBSCAN Density Clustering Algorithm and K-means Clustering Algorithm
Saisai Jian, Dongyi Li, Ya-Qi Yu
Abstract
Open-access reader
Saisai Jian, Dongyi Li, Ya-Qi Yu
Abstract
Open-access reader
Abstract With the development of urbanization, the problem of urban traffic congestion is becoming more and more serious. An improved k-means clustering algorithm was proposed to solve the problem that the traditional k-means clustering center could easily be affected by the clustering center and fall into the local optimal solution. Based on the big data of New York City taxis, the operational characteristics are analyzed. The experimental results show that the improved K-means clustering algorithm has a better clustering analysis effect in terms of hot demand for taxis.
OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract With the development of urbanization, the problem of urban traffic congestion is becoming more and more serious. An improved k-means clustering algorithm was proposed to solve the problem that the traditional k-means clustering center could easily be affected by the clustering center and fall into the local optimal solution. Based on the big data of New York City taxis, the operational characteristics are analyzed. The experimental results show that the improved K-means clustering algorithm has a better clustering analysis effect in terms of hot demand for taxis.
Key concepts: DBSCAN, Cluster analysis, Taxis, Computer science, CURE data clustering algorithm, Canopy clustering algorithm, Algorithm, Correlation clustering