{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T10:39:59Z","timestamp":1770460799667,"version":"3.49.0"},"reference-count":43,"publisher":"MDPI AG","issue":"16","license":[{"start":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T00:00:00Z","timestamp":1660694400000},"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":["61976082"],"award-info":[{"award-number":["61976082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076089"],"award-info":[{"award-number":["62076089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002103"],"award-info":[{"award-number":["62002103"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The rapid growth of digital information has produced massive amounts of time series data on rich features and most time series data are noisy and contain some outlier samples, which leads to a decline in the clustering effect. To efficiently discover the hidden statistical information about the data, a fast weighted fuzzy C-medoids clustering algorithm based on P-splines (PS-WFCMdd) is proposed for time series datasets in this study. Specifically, the P-spline method is used to fit the functional data related to the original time series data, and the obtained smooth-fitting data is used as the input of the clustering algorithm to enhance the ability to process the data set during the clustering process. Then, we define a new weighted method to further avoid the influence of outlier sample points in the weighted fuzzy C-medoids clustering process, to improve the robustness of our algorithm. We propose using the third version of mueen\u2019s algorithm for similarity search (MASS 3) to measure the similarity between time series quickly and accurately, to further improve the clustering efficiency. Our new algorithm is compared with several other time series clustering algorithms, and the performance of the algorithm is evaluated experimentally on different types of time series examples. The experimental results show that our new method can speed up data processing and the comprehensive performance of each clustering evaluation index are relatively good.<\/jats:p>","DOI":"10.3390\/s22166163","type":"journal-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T22:53:30Z","timestamp":1660776810000},"page":"6163","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Fast Weighted Fuzzy C-Medoids Clustering for Time Series Data Based on P-Splines"],"prefix":"10.3390","volume":"22","author":[{"given":"Jiucheng","family":"Xu","sequence":"first","affiliation":[{"name":"College of Computer and Information Engineering, Henan Normal University, Xinxiang 453007, China"},{"name":"Engineering Lab of Intelligence Business & Internet of Things, Xinxiang 453007, China"}]},{"given":"Qinchen","family":"Hou","sequence":"additional","affiliation":[{"name":"College of Computer and Information Engineering, Henan Normal University, Xinxiang 453007, China"},{"name":"Engineering Lab of Intelligence Business & Internet of Things, Xinxiang 453007, China"}]},{"given":"Kanglin","family":"Qu","sequence":"additional","affiliation":[{"name":"College of Computer and Information Engineering, Henan Normal University, Xinxiang 453007, China"},{"name":"Engineering Lab of Intelligence Business & Internet of Things, Xinxiang 453007, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9080-5715","authenticated-orcid":false,"given":"Yuanhao","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Computer and Information Engineering, Henan Normal University, Xinxiang 453007, China"},{"name":"Engineering Lab of Intelligence Business & Internet of Things, Xinxiang 453007, China"}]},{"given":"Xiangru","family":"Meng","sequence":"additional","affiliation":[{"name":"College of Computer and Information Engineering, Henan Normal University, Xinxiang 453007, China"},{"name":"Engineering Lab of Intelligence Business & Internet of Things, Xinxiang 453007, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,17]]},"reference":[{"key":"ref_1","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_2","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","article-title":"Review on time series data mining","volume":"24","author":"Fu","year":"2011","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.is.2015.04.007","article-title":"Time-series clustering\u2014A decade review","volume":"53","author":"Aghabozorgi","year":"2015","journal-title":"Inf. Syst."},{"key":"ref_4","unstructured":"Caiado, J., Maharaj, E.A., and D\u2019Urso, P. (2015). Time series clustering. Handbook of Cluster Analysis, Chapman and Hall\/CRC. Available online: https:\/\/www.taylorfrancis.com\/chapters\/edit\/10.1201\/b19706-18\/time-series-clustering-jorge-caiado-elizabeth-ann-maharaj-pierpaolo-urso."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1111\/1467-9469.00350","article-title":"Unsupervised curve clustering using B-splines","volume":"30","author":"Abraham","year":"2003","journal-title":"Scand. J. Stat."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.eswa.2016.01.004","article-title":"Parsimonious time series clustering using p-splines","volume":"52","author":"Iorio","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_7","first-page":"100518","article-title":"Spatial robust fuzzy clustering of COVID 19 time series based on B-splines","volume":"38","author":"Giovanni","year":"2021","journal-title":"Spat. Stat."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.ijar.2021.06.010","article-title":"Robust fuzzy clustering of time series based on B-splines","volume":"136","author":"Vincenzina","year":"2021","journal-title":"Int. J. Approx. Reason."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1214\/ss\/1038425655","article-title":"Flexible smoothing with B-splines and penalties","volume":"11","author":"Eilers","year":"1996","journal-title":"Stat. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","article-title":"FCM: The fuzzy c-means clustering algorithm","volume":"10","author":"Bezdek","year":"1984","journal-title":"Comput. Geosci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"170","DOI":"10.7763\/IJMLC.2014.V4.407","article-title":"Effective clustering of time-series data using FCM","volume":"4","author":"Aghabozorgi","year":"2014","journal-title":"Int. J. Mach. Learn. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, T., Li, Y., Liu, Z., and Zhang, Z. (2021). Kernel Probabilistic K-Means Clustering. Sensors, 21, Available online: https:\/\/www.mdpi.com\/1424-8220\/21\/5\/1892.","DOI":"10.3390\/s21051892"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"6687202","DOI":"10.1155\/2021\/6687202","article-title":"Fuzzy clustering method based on improved weighted distance","volume":"2021","author":"Bei","year":"2021","journal-title":"Math. Probl. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chen, H., Xie, Z., Huang, Y., and Gai, D. (2021). Intuitionistic fuzzy C-means algorithm based on membership information transfer-ring and similarity measurement. Sensors, 21, Available online: https:\/\/www.mdpi.com\/1424-8220\/21\/3\/696.","DOI":"10.3390\/s21030696"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"110230","DOI":"10.1016\/j.chaos.2020.110230","article-title":"Fuzzy clustering method to compare the spread rate of Covid-19 in the high risks countries","volume":"140","author":"Mahmoudi","year":"2020","journal-title":"Chaos Solitons Fractals"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"6292","DOI":"10.1016\/j.eswa.2011.11.063","article-title":"Effective fuzzy c-means clustering algorithms for data clustering problems","volume":"39","author":"Kannan","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"10311","DOI":"10.1007\/s13369-020-04721-1","article-title":"High-order fuzzy time series forecasting by using membership values along with data and support vector machine","volume":"45","author":"Pattanayak","year":"2020","journal-title":"Arab. J. Sci. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"107611","DOI":"10.1016\/j.asoc.2021.107611","article-title":"Particle swarm optimization of partitions and fuzzy order for fuzzy time series forecasting of COVID-19","volume":"110","author":"Kumar","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"13881","DOI":"10.1007\/s00500-021-06259-2","article-title":"Pythagorean fuzzy time series model based on Pythagorean fuzzy c-means and improved Markov weighted in the prediction of the new COVID-19 cases","volume":"25","author":"Xian","year":"2021","journal-title":"Soft Comput."},{"key":"ref_20","unstructured":"Al-qaness, M.A.A., Ewees, A.A., Fan, H., AlRassas, A.M., and Elaziz, M.A. (2022). Modified aquila optimizer for forecasting oil production. Geo-Spat. Inf. Sci., 1\u201317. Available online: https:\/\/wwwtandfonline.53yu.com\/doi\/abs\/10.1080\/10095020.2022.2068385."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"118851","DOI":"10.1016\/j.apenergy.2022.118851","article-title":"Boosted ANFIS model using augmented marine predator algorithm with mutation operators for wind power forecasting","volume":"314","author":"Ewees","year":"2022","journal-title":"Appl. Energy."},{"key":"ref_22","unstructured":"Haga, N., Honda, K., Ichihashi, H., and Notsu, A. (2008, January 1\u20136). Linear fuzzy clustering of relational data based on extended fuzzy c-medoids. Proceedings of the IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence), Hong Kong, China. Available online: https:\/\/ieeexplore.ieee.org\/abstract\/document\/4630392."},{"key":"ref_23","first-page":"1","article-title":"A hybrid fuzzy c-medoids clustering using the where optimization algorithm","volume":"10","author":"Nguyen","year":"2021","journal-title":"J. Sci. Tech. Sect. Inf. Commun. Technol."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1109\/FUZZY.1999.790086","article-title":"A fuzzy relative of the k-medoids algorithm with application to web document and snippet clustering","volume":"3","author":"Krishnapuram","year":"1999","journal-title":"IEEE Int. Fuzzy Syst. Conf. Proc."},{"key":"ref_25","first-page":"73","article-title":"Distributed big data clustering using mapreduce-based fuzzy C-medoids","volume":"103","author":"Sardar","year":"2022","journal-title":"J. Inst. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Labroche, N. (2010, January 12\u201314). New incremental fuzzy c medoids clustering algorithms. Proceedings of the Annual Meeting of the North American Fuzzy Information Processing Society, Toronto, ON, Canada. Available online: https:\/\/ieeexplore.ieee.org\/abstract\/document\/5548263.","DOI":"10.1109\/NAFIPS.2010.5548263"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Coppi, R., D\u2019Urso, P., and Giordani, P. (2006). Fuzzy c-medoids clustering models for time-varying data. Modern Information Processing, Elsevier Science. Available online: https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780444520753500170.","DOI":"10.1016\/B978-044452075-3\/50017-0"},{"key":"ref_28","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_29","doi-asserted-by":"crossref","unstructured":"Liu, Y., Chen, J., Wu, S., Liu, Z., and Chao, H. (2018). Incremental fuzzy C medoids clustering of time series data using dynamic time warping distance. PLoS ONE, 13, Available online: https:\/\/journals.plos.org\/plosone\/article?id=10.1371\/journal.pone.0197499.","DOI":"10.1371\/journal.pone.0197499"},{"key":"ref_30","first-page":"235","article-title":"Trimmed fuzzy clustering of financial time series based on dynamic time warping","volume":"299","author":"Giovanni","year":"2021","journal-title":"Ann. Oper. Res."},{"key":"ref_31","first-page":"4201","article-title":"A Fast Semi-Supervised Clustering Framework for Large-Scale Time Series Data","volume":"51","author":"He","year":"2019","journal-title":"IEEE Trans."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.knosys.2014.04.035","article-title":"An empirical evaluation of similarity measures for time series classification","volume":"67","author":"Serra","year":"2014","journal-title":"Knowl.-Based Syst."},{"key":"ref_33","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_34","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/TPAMI.2008.76","article-title":"Time warp edit distance with stiffness adjustment for time series matching","volume":"31","author":"Marteau","year":"2008","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Suris, F.N.A., Bakar, M.A.A., Ariff, N.M., Nadzir, M.S.M., and Ibrahim, K. (2022). Malaysia PM10 Air Quality Time Series Clustering Based on Dynamic Time Warping. Atmosphere, 13, Available online: https:\/\/www.mdpi.com\/2073-4433\/13\/4\/503.","DOI":"10.3390\/atmos13040503"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Yeh, C.M., Zhu, Y., Ulanova, L., Begum, N., Ding, Y., Dau, H.A., Silva, D.F., Mueen, A., and Keogh, E. (2016, January 12\u201315). Matrix profile I: All pairs similarity joins for time series: A unifying view that includes motifs, discords and shapelets. Proceedings of the IEEE 16th International Conference on Data Mining (ICDM), Barcelona, Spain. Available online: https:\/\/ieeexplore.ieee.org\/abstract\/document\/7837992.","DOI":"10.1109\/ICDM.2016.0179"},{"key":"ref_37","unstructured":"Abdullah, M., Sheng, Z., Yan, Z., Michael, Y., Kaveh, K., Krishnamurthy, V., Chetan, K.G., and Eamonn, K. (2022, March 15). The Fastest Similarity Search Algorithm for Time Series Subsequences under Euclidean Distance. Available online: http:\/\/www.cs.unm.edu\/~mueen\/FastestSimilaritySearch.html."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1002\/wics.125","article-title":"Splines, knots, and penalties","volume":"2","author":"Eilers","year":"2010","journal-title":"Wiley Interdiscip. Rev. Comput. Stat."},{"key":"ref_39","first-page":"894","article-title":"Soft-dtw: A differentiable loss function for time-series","volume":"70","author":"Cuturi","year":"2017","journal-title":"Int. Conf. Mach. Learn. PMLR"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37899\/journallamultiapp.v1i3.191","article-title":"Time series clustering based on the k-means algorithm","volume":"1","author":"Kobylin","year":"2020","journal-title":"J. Multiapp"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/2949741.2949758","article-title":"k-Shape: Efficient and Accurate Clustering of Time Series","volume":"45","author":"Paparrizos","year":"2015","journal-title":"ACM Sigmod Rec."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1037\/1082-989X.9.3.386","article-title":"Properties of the Hubert-Arable Adjusted Rand Index","volume":"9","author":"Steinley","year":"2004","journal-title":"Psychol. Methods"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","article-title":"A method for comparing two hierarchical clusterings","volume":"78","author":"Fowlkes","year":"1983","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/16\/6163\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:11:18Z","timestamp":1760141478000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/16\/6163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,17]]},"references-count":43,"journal-issue":{"issue":"16","published-online":{"date-parts":[[2022,8]]}},"alternative-id":["s22166163"],"URL":"https:\/\/doi.org\/10.3390\/s22166163","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,17]]}}}