Author
Abstract
The emerging paradigm of the modern city demands big data analytics in urban studies. Data mining techniques for big data have the potential to ascertain strategic insights for current and future cities. Clustering is increasingly growing in data mining, serving as a knowledge discovery tool. This article proposes a spatiotemporal clustering method, called spatiotemporal data-adaptive clustering (STDAC), to cope with clustering challenges, such as feature type, parameter setting, and treating spatial and temporal dimensions as equals. The proposed algorithm takes a dual-structure approach to obtain high-quality clusters and discover temporal changes not detected by other techniques. STDAC refers to the feature type and uses k-fold cross-validation (KCV) to replace the user-defined parameters with the data-driven values. The data-driven threshold from KCV performs as the endogenous variable, thus not requiring a priori assumptions or parameter settings. This article used the bus, taxi passengers, and de facto population data as illustrative case studies. The clustering performances were evaluated based on validation indexes, such as the Davies–Bouldin index (DBI) and Dunn index (DI), where STDAC generally had lower DBI and greater DI. The findings showed that STDAC could yield better clustering performances than other established algorithms. Hence, the proposed method would be promising to future studies requiring spatiotemporal big data analytics in urban studies, administrative management, and other fields.
Suggested Citation
Geonhwa You, 2022.
"Spatiotemporal Data-Adaptive Clustering Algorithm: An Intelligent Computational Technique for City Big Data,"
Annals of the American Association of Geographers, Taylor & Francis Journals, vol. 112(2), pages 602-619, February.
Handle:
RePEc:taf:raagxx:v:112:y:2022:i:2:p:602-619
DOI: 10.1080/24694452.2021.1935207
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:raagxx:v:112:y:2022:i:2:p:602-619. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/raag .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.