In order to quickly mine hotspot areas from taxi trajectory data, so as to help taxi drivers improve the efficiency of passenger search and economic income, this paper proposes a grid-optimised DBSCAN algorithm. Firstly, the study area is divided into a number of grids of the same size, then the trajectory data is mapped to the grid by a function, and finally clusters are generated based on the width-first search, which reduces the search range of the boundary points of each point, and forms clustered hotspots based on the clustering of high-density grid cells. In this paper, we use taxi trajectory data in Chengdu city to conduct experiments and compare with three clustering algorithms, DBSCAN, GSCAN and K-DBSCAN, and the results show that the algorithm in this paper has a smaller time complexity, and the algorithm's DBI index is reduced by an average of 35.25%, and the average running time is reduced by 19.14%.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.