{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T17:54:08Z","timestamp":1787162048942,"version":"build-2736575974"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T00:00:00Z","timestamp":1583107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71271034, 51939001 and 61976033"],"award-info":[{"award-number":["71271034, 51939001 and 61976033"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Social Science Foundation of China","award":["15CGL031"],"award-info":[{"award-number":["15CGL031"]}]},{"DOI":"10.13039\/501100018617","name":"Liaoning Revitalization Talents Program","doi-asserted-by":"publisher","award":["XLYC1907084"],"award-info":[{"award-number":["XLYC1907084"]}],"id":[{"id":"10.13039\/501100018617","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"publisher","award":["20180550307"],"award-info":[{"award-number":["20180550307"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science &amp; Technology Innovation Funds of Dalian","award":["2018J11CY022"],"award-info":[{"award-number":["2018J11CY022"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["3132019353 and 3132019345"],"award-info":[{"award-number":["3132019353 and 3132019345"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>An increasing number of automobiles have led to a serious shortage of parking spaces and a serious imbalance of parking supply and demand. The best way to solve these problems is to achieve the reasonable planning and classify management of car parks, guide the intelligent parking, and then promote its marketization and industrialization. Therefore, we aim to adopt clustering method to classify car parks. Owing to the time series characteristics of car park data, a time series clustering framework, including preprocessing, distance measurement, clustering and evaluation, is first developed for classifying car parks. Then, in view of the randomness of existing clustering models, a new time series clustering model based on dynamic time warping (DTW) is proposed, which contains distance radius calculation, obtaining density of the neighbor area, k centers initialization, and clustering. Finally, some UCR datasets and data of 27 car parks are employed to evaluate the performance of the models and results show that the proposed model performs obviously better results than those clustering models based on Euclidean distance (ED) and traditional clustering models based on DTW.<\/jats:p>","DOI":"10.3390\/a13030057","type":"journal-article","created":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T07:50:53Z","timestamp":1583135453000},"page":"57","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Time Series Clustering Model based on DTW for Classifying Car Parks"],"prefix":"10.3390","volume":"13","author":[{"given":"Taoying","family":"Li","sequence":"first","affiliation":[{"name":"School of Maritime Economics and Management, Dalian Maritime University, Dalian 116026, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xu","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Maritime Economics and Management, Dalian Maritime University, Dalian 116026, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junhe","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Maritime Economics and Management, Dalian Maritime University, Dalian 116026, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2020,3,2]]},"reference":[{"key":"ref_1","first-page":"479","article-title":"DC tests new parking technology to help drivers find space, pay more easily","volume":"13","year":"2010","journal-title":"Wash. Post."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"101608","DOI":"10.1016\/j.scs.2019.101608","article-title":"Smart parking in IoT-enabled cities: A survey","volume":"49","author":"Malekloo","year":"2019","journal-title":"Sustain. Cities Soc."},{"key":"ref_3","first-page":"549","article-title":"Cluster analysis of car parking data, and development of their web applications","volume":"18","author":"Kubota","year":"2011","journal-title":"Commun. Stat. Appl. Methods"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.adhoc.2012.03.002","article-title":"Finding available parking spaces made easy","volume":"12","author":"Klappenecker","year":"2014","journal-title":"Ad Hoc Netw."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"7281","DOI":"10.1016\/j.eswa.2012.01.091","article-title":"Prediction of parking space availability in real time","volume":"39","author":"Caicedo","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"04018027","DOI":"10.1061\/JTEPBS.0000153","article-title":"Designing a time limited-parking management plan for large-scale parking lots","volume":"144","author":"Cheng","year":"2018","journal-title":"J. Transp. Eng. Pt A Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","article-title":"A review on time series data mining","volume":"24","author":"Fu","year":"2011","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2379776.2379788","article-title":"Time-series data mining","volume":"45","author":"Esling","year":"2012","journal-title":"ACM Comput. Surv."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tourman.2019.04.015","article-title":"Spurious patterns in google trends data-an analysis of the effects on tourism demand forecasting in Germany","volume":"75","author":"Bokelmann","year":"2019","journal-title":"Tour. Manag."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1109\/ACCESS.2017.2779939","article-title":"LSTM fully convolutional networks for time series classification","volume":"6","author":"Karim","year":"2017","journal-title":"IEEE Access."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1016\/j.asoc.2009.08.036","article-title":"Application of a fuzzy TOPSIS method base on modified preference ratio and fuzzy distance measurement in assessment of traffic police centers performance","volume":"10","author":"Damghani","year":"2010","journal-title":"Appl. Soft Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","article-title":"Survey of clustering algorithms","volume":"16","author":"Xu","year":"2005","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1016\/j.patcog.2005.01.025","article-title":"Clustering of time series data\u2014A survey","volume":"38","author":"Liao","year":"2005","journal-title":"Pattern Recognit."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1016\/j.patrec.2004.06.006","article-title":"Similarity measures of intuitionistic fuzzy sets based on Hausdorff distance","volume":"25","author":"Hung","year":"2004","journal-title":"Pattern Recognit. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"3968","DOI":"10.1109\/TCYB.2018.2856208","article-title":"An evolutionary algorithm based on Minkowski distance for many-objective optimization","volume":"49","author":"Xu","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.ibmb.2014.06.004","article-title":"CutProtFam-Pred: Detection and classification of putative structural cuticular proteins from sequence alone, based on profile hidden Markov models","volume":"52","author":"Ioannidou","year":"2014","journal-title":"Insect Biochem. Mol. Biol."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2012","DOI":"10.1080\/00207721.2012.760669","article-title":"Failure mode and effects analysis using intuitionistic fuzzy hybrid weighted Euclidean distance operator","volume":"45","author":"Liu","year":"2014","journal-title":"Int. J. Syst. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Guan, X., Huang, C., Liu, G., Meng, X., and Liu, Q. (2016). Mapping rice cropping systems in Vietnam using an NDVI-based time-series similarity measurement based on DTW distance. Remote Sens., 8.","DOI":"10.3390\/rs8010019"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/s11769-018-0982-2","article-title":"Relationship Between Urban Road Traffic Characteristics and Road Grade Based on a Time Series Clustering Model: A Case Study in Nanjing, China","volume":"28","author":"Wang","year":"2018","journal-title":"Chin. Geogra. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10618-012-0250-5","article-title":"Experimental comparison of representation methods and distance measures for time series data","volume":"26","author":"Wang","year":"2013","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"C\u00e1novas, J.S., Guillam\u00f3n, A., and Ruiz-Abell\u00f3n, M.C. (2019). Using permutations for hierarchical clustering of time series. Entropy, 21.","DOI":"10.3390\/e21030306"},{"key":"ref_22","unstructured":"Yao, Y., Zhao, X., Wu, Y., Zhang, Y., and Rong, J. (2019). Clustering driver behavior using dynamic time warping and hidden Markov model. J. Intell. Transport. Syst., 1\u201314."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.patcog.2010.09.013","article-title":"A global averaging method for dynamic time warping, with applications to clustering","volume":"44","author":"Petitjean","year":"2011","journal-title":"Pattern Recognit."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.landurbplan.2016.12.001","article-title":"Delineating urban functional areas with building-level social media data: A dynamic time warping (DTW) distance based k-medoids method","volume":"160","author":"Chen","year":"2017","journal-title":"Landsc. Urban Plan"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.engappai.2014.12.015","article-title":"Fuzzy clustering of time series data using dynamic time warping distance","volume":"39","author":"Izakian","year":"2015","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_26","first-page":"1","article-title":"Time series k-means: A new k-means type smooth subspace clustering for time series data","volume":"367","author":"Huang","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1093\/sysbio\/syy086","article-title":"A universal probe set for targeted sequencing of 353 nuclear genes from any flowering plant designed using k-medoids clustering","volume":"68","author":"Johnson","year":"2018","journal-title":"Syst. Biol."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"18443","DOI":"10.1007\/s11042-018-7132-9","article-title":"Addressing facial dynamics using k-medoids cohort selection algorithm for face recognition","volume":"78","author":"Garain","year":"2019","journal-title":"Multimed. Tools Appl."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1007\/s00170-016-8848-1","article-title":"Milling tool wear state recognition based on partitioning around medoids (PAM) clustering","volume":"88","author":"Li","year":"2017","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2014.02.137","article-title":"Evaluation of clustering algorithms for financial risk analysis using MCDM methods","volume":"275","author":"Kou","year":"2014","journal-title":"Inf. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/3\/57\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:03:16Z","timestamp":1760173396000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/3\/57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,2]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,3]]}},"alternative-id":["a13030057"],"URL":"https:\/\/doi.org\/10.3390\/a13030057","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,2]]}}}