{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T15:34:31Z","timestamp":1776353671133,"version":"3.51.2"},"reference-count":34,"publisher":"MDPI AG","issue":"21","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2019YFC1520905"],"award-info":[{"award-number":["No.2019YFC1520905"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Cultural Relics Protection Science and Technology Project","award":["No.2017007"],"award-info":[{"award-number":["No.2017007"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Traditional supervised time series classification (TSC) tasks assume that all training data are labeled. However, in practice, manually labelling all unlabeled data could be very time-consuming and often requires the participation of skilled domain experts. In this paper, we concern with the positive unlabeled time series classification problem (PUTSC), which refers to automatically labelling the large unlabeled set U based on a small positive labeled set PL. The self-training (ST) is the most widely used method for solving the PUTSC problem and has attracted increased attention due to its simplicity and effectiveness. The existing ST methods simply employ the one-nearest-neighbor (1NN) formula to determine which unlabeled time-series should be labeled. Nevertheless, we note that the 1NN formula might not be optimal for PUTSC tasks because it may be sensitive to the initial labeled data located near the boundary between the positive and negative classes. To overcome this issue, in this paper we propose an exploratory methodology called ST-average. Unlike conventional ST-based approaches, ST-average utilizes the average sequence calculated by DTW barycenter averaging technique to label the data. Compared with any individuals in PL set, the average sequence is more representative. Our proposal is insensitive to the initial labeled data and is more reliable than existing ST-based methods. Besides, we demonstrate that ST-average can naturally be implemented along with many existing techniques used in original ST. Experimental results on public datasets show that ST-average performs better than related popular methods.<\/jats:p>","DOI":"10.3390\/s21217414","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T22:08:41Z","timestamp":1636409321000},"page":"7414","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Improved Self-Training Method for Positive Unlabeled Time Series Classification Using DTW Barycenter Averaging"],"prefix":"10.3390","volume":"21","author":[{"given":"Jing","family":"Li","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China"}]},{"given":"Haowen","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China"}]},{"given":"Yabo","family":"Dong","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China"}]},{"given":"Tongbin","family":"Zuo","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China"}]},{"given":"Duanqing","family":"Xu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China"}]}],"member":"1968","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1109\/JIOT.2017.2766085","article-title":"ADF: An anomaly detection framework for large-scale PM2. 5 sensing systems","volume":"5","author":"Chen","year":"2017","journal-title":"IEEE Internet Things J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2701","DOI":"10.1109\/JSEN.2019.2953938","article-title":"Multi-Sensor Time-Series Classification for Activity Tracking Under Variable Length","volume":"20","author":"Norgaard","year":"2019","journal-title":"IEEE Sens. J."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1109\/TBME.2015.2468589","article-title":"Real-time patient-specific ECG classification by 1-D convolutional neural networks","volume":"63","author":"Kiranyaz","year":"2015","journal-title":"IEEE Trans. Biomed. Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/j.neucom.2019.06.032","article-title":"A deep learning framework for time series classification using Relative Position Matrix and Convolutional Neural Network","volume":"359","author":"Chen","year":"2019","journal-title":"Neurocomputing"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Liang, S., Zhang, Y., and Ma, J. (2020, January 20\u201324). Active Model Selection for Positive Unlabeled Time Series Classification. Proceedings of the 2020 IEEE 36th International Conference on Data Engineering (ICDE), Dallas, TX, USA.","DOI":"10.1109\/ICDE48307.2020.00038"},{"key":"ref_6","unstructured":"Nguyen, M.N., Li, X.L., and Ng, S.K. (2011, January 16\u201322). Positive unlabeled learning for time series classification. Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, Barcelona, Spain."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Wei, L., and Keogh, E. (2006, January 20\u201323). Semi-supervised time series classification. Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA.","DOI":"10.1145\/1150402.1150498"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ratanamahatana, C.A., and Wanichsan, D. (2008). Stopping criterion selection for efficient semi-supervised time series classification. Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing, Springer.","DOI":"10.1007\/978-3-540-70560-4_1"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Vinh, V.T., and Anh, D.T. (2015, January 8\u201310). Constraint-based MDL principle for semi-supervised classification of time series. Proceedings of the 2015 Seventh International Conference on Knowledge and Systems Engineering (KSE), Ho Chi Minh, Vietnam.","DOI":"10.1109\/KSE.2015.41"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Begum, N., Hu, B., Rakthanmanon, T., and Keogh, E. (2013, January 14\u201316). Towards a minimum description length based stopping criterion for semi-supervised time series classification. Proceedings of the 2013 IEEE 14th International Conference on Information Reuse & Integration (IRI), San Francisco, CA, USA.","DOI":"10.1109\/IRI.2013.6642490"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Vinh, V.T., and Anh, D.T. (2016). Two novel techniques to improve mdl-based semi-supervised classification of time series. Transactions on Computational Collective Intelligence XXV, Springer.","DOI":"10.1007\/978-3-662-53580-6_8"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.ins.2015.07.061","article-title":"On the stopping criteria for k-nearest neighbor in positive unlabeled time series classification problems","volume":"328","author":"Bergmeir","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Chen, Y., Hu, B., Keogh, E., and Batista, G.E. (2013, January 11\u201313). DTW-D: Time series semi-supervised learning from a single example. Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, IL, USA.","DOI":"10.1145\/2487575.2487633"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.patcog.2018.02.030","article-title":"Semi-supervised time series classification on positive and unlabeled problems using cross-recurrence quantification analysis","volume":"80","year":"2018","journal-title":"Pattern Recognit."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-015-0878-8","article-title":"Faster and more accurate classification of time series by exploiting a novel dynamic time warping averaging algorithm","volume":"47","author":"Petitjean","year":"2016","journal-title":"Knowl. Inf. Syst."},{"key":"ref_16","unstructured":"Dau, H.A., Keogh, E., Kamgar, K., Yeh, C.C.M., Zhu, Y., Gharghabi, S., Ratanamahatana, C.A., Hu, B., Begum, N., and Bagnall, A. (2021, November 04). The UCR Time Series Classification Archive. Available online: https:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data_2018\/."},{"key":"ref_17","unstructured":"Berndt, D.J., and Clifford, J. (1994). Using Dynamic Time Warping to Find Patterns in Time Series, KDD Workshop."},{"key":"ref_18","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_19","unstructured":"Zhu, X.J. (2005). Semi-Supervised Learning Literature Survey, University of Wisconsin-Madison Department of Computer Sciences. Technical Report."},{"key":"ref_20","first-page":"1","article-title":"Introduction to semi-supervised learning","volume":"3","author":"Zhu","year":"2009","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Nguyen, M.N., Li, X.L., and Ng, S.K. (2012). Ensemble based positive unlabeled learning for time series classification. International Conference on Database Systems for Advanced Applications, Springer.","DOI":"10.1007\/978-3-642-29038-1_19"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2011.04.015","article-title":"Shape-based template matching for time series data","volume":"26","author":"Niennattrakul","year":"2012","journal-title":"Knowl.-Based Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.patcog.2017.08.015","article-title":"Time-series averaging using constrained dynamic time warping with tolerance","volume":"74","author":"Morel","year":"2018","journal-title":"Pattern Recognit."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1109\/TSP.2019.2897958","article-title":"Adaptive global time sequence averaging method using dynamic time warping","volume":"67","author":"Liu","year":"2019","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., and Keogh, E. (2012, January 12\u201316). Searching and mining trillions of time series subsequences under dynamic time warping. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China.","DOI":"10.1145\/2339530.2339576"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Keogh, E.J., and Pazzani, M.J. (2001, January 5\u20137). Derivative dynamic time warping. Proceedings of the 2001 SIAM International Conference on Data Mining, Chicago, IL, USA.","DOI":"10.1137\/1.9781611972719.1"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.14778\/2350229.2350266","article-title":"sDTW: Computing DTW distances using locally relevant constraints based on salient feature alignments","volume":"5","author":"Candan","year":"2012","journal-title":"Proc. VLDB Endow."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Niennattrakul, V., and Ratanamahatana, C.A. (2007, January 26\u201328). On clustering multimedia time series data using k-means and dynamic time warping. Proceedings of the 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE\u201907), Seoul, Korea.","DOI":"10.1109\/MUE.2007.165"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ins.2019.09.044","article-title":"An evolutionary approach for efficient prototyping of large time series datasets","volume":"511","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"24503","DOI":"10.1109\/ACCESS.2017.2764633","article-title":"A new time series representation model and corresponding similarity measure for fast and accurate similarity detection","volume":"5","author":"Zhang","year":"2017","journal-title":"IEEE Access"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Tan, C.W., Petitjean, F., and Webb, G.I. (2019, January 2\u20134). Elastic bands across the path: A new framework and method to lower bound DTW. Proceedings of the 2019 SIAM International Conference on Data Mining, Calgary, AB, Canada.","DOI":"10.1137\/1.9781611975673.59"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Silva, D.F., and Batista, G.E. (2016, January 5\u20137). Speeding up all-pairwise dynamic time warping matrix calculation. Proceedings of the 2016 SIAM International Conference on Data Mining, Miami, FL, USA.","DOI":"10.1137\/1.9781611974348.94"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","article-title":"Dynamic programming algorithm optimization for spoken word recognition","volume":"26","author":"Sakoe","year":"1978","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TASSP.1975.1162641","article-title":"Minimum prediction residual principle applied to speech recognition","volume":"23","author":"Itakura","year":"1975","journal-title":"IEEE Trans. Acoust. Speech Signal Process."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/21\/21\/7414\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:27:33Z","timestamp":1760167653000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/21\/21\/7414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":34,"journal-issue":{"issue":"21","published-online":{"date-parts":[[2021,11]]}},"alternative-id":["s21217414"],"URL":"https:\/\/doi.org\/10.3390\/s21217414","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,8]]}}}