Self-Supervised Contrastive Representation Learning for Semi-Supervised Time-Series Classification
Open accessThe DOI matches its Crossref record; 33 of the 54 references it cites were found in a registry or an index, and 21 are not checked yet; none of the 20 sources its claims cite is checked for support yet.
Abstract
Learning time-series representations when only unlabeled data or few labeled samples are available can be a challenging task. Recently, contrastive self-supervised learning has shown great improvement in extracting useful representations from unlabeled data via contrasting different augmented views of data. In this work, we propose a novel Time-Series representation learning framework via Temporal and Contextual Contrasting (TS-TCC) that learns representations from unlabeled data with contrastive learning. Specifically, we propose time-series-specific weak and strong augmentations and use their views to learn robust temporal relations in the proposed temporal contrasting module, besides learning discriminative representations by our proposed contextual contrasting module. Additionally, we conduct a systematic study of time-series data augmentation selection, which is a key part of contrastive learning. We also extend TS-TCC to the semi-supervised learning settings and propose a Class-Aware TS-TCC (CA-TCC) that benefits from the available few labeled data to further improve representations learned by TS-TCC. Specifically, we leverage the robust pseudo labels produced by TS-TCC to realize a class-aware contrastive loss. Extensive experiments show that the linear evaluation of the features learned by our proposed framework performs comparably with the fully supervised training. Additionally, our framework shows high efficiency in few labeled data and transfer learning scenarios.
Checked 2026-10-05 · 21 references not checked yet
Overview
CoChat Summary
TL;DR
The paper proposes TS-TCC, a self-supervised contrastive framework for time-series representation learning using weak/strong augmentations, temporal contrasting, and contextual contrasting, and extends it to semi-supervised CA-TCC using pseudo-labeled class-aware contrastive learning. Across ten real-world datasets, TS-TCC and CA-TCC outperform self-supervised and semi-supervised baselines under few-label and transfer-learning settings.
Key findings
- With 1% labeled data, TS-TCC achieved the best average linear-evaluation accuracy across 10 datasets: 76.1% vs. 73.3% for CPC, 65.5% for SimCLR, 61.8% for supervised training, and 58.8% for random initialization; with 5% labels, TS-TCC averaged 80.6% vs. 80.0% for CPC and 71.8% for SimCLR.
- CA-TCC’s average F1-score outperformed the second-best semi-supervised baseline by 3.8% and 4.9% with 1% and 5% labels, respectively; its average accuracy was 77.8% at 1% labels and 83.5% at 5% labels.
- In cross-domain fault diagnosis transfer experiments, TS-TCC improved over supervised training by about 4% accuracy on average, and CA-TCC by about 6% accuracy on average.
- Ablation showed the cross-view prediction task improved accuracy by more than 6% on HAR and about 2% on Sleep-EDF and Epilepsy; combining weak and strong augmentations gave the best HAR result at 77.58% accuracy with 5% labels.
Methods
- Design: TS-TCC learns from unlabeled data via time-series-specific weak and strong augmentations, a temporal contrasting module with a tough cross-view prediction task, and a contextual contrasting module. CA-TCC extends this to semi-supervised learning in four phases: TS-TCC pretraining, fine-tuning with few labels, pseudo-label generation, and class-aware supervised contrastive training.
- Data: ten public real-world time-series datasets were used, including UCI HAR, Sleep-EDF, Epilepsy, Fault Diagnosis, and seven UCR datasets (Wafer, FordA, FordB, POC, PPOC, StarLightCurves, ElectricDevices). Experiments used 60%/20%/20% train/validation/test splits, subject-wise split for Sleep-EDF, and 5 runs with different seeds.
- Analysis: performance was measured by accuracy and macro-averaged F1-score, with linear evaluation on frozen pretrained encoders, comparisons against self-supervised and semi-supervised baselines, transfer-learning tests, ablation, sensitivity analysis, and augmentation-selection experiments.
Limitations
- The paper does not include a dedicated limitations section. It states that time-series augmentation selection remains an open problem and that proper augmentation parameters vary by dataset characteristics, requiring normalization and dataset-specific choices.
- The paper notes that ensembling multiple self-supervised algorithms gave only minor improvement while increasing complexity, training time, and computational demands.
- Evident from the text: evaluation is limited to ten datasets and selected label budgets, sensitivity analysis is performed only on HAR, and CA-TCC depends on the quality of pseudo labels generated by the fine-tuned TS-TCC encoder.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 0 Not valid · 12 Not checked · 87 Own results and interpretations
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Experimental results show that both variants are capable of learning effective representations for different scenarios.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Extensive experiments show that the linear evaluation of the features learned by our proposed framework performs comparably with the fully supervised training.”
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Additionally, our framework shows high efficiency in few labeled data and transfer learning scenarios.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Additionally, our framework shows high efficiency in few labeled data and transfer learning scenarios.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We find that the pseudo labels generated by TS-TCC are more accurate than those generated by the other baselines.”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
59 more claims
Create a free account to see all 99 claims and to verify the 20 references still open.
- It may state two separate claims as one. 24
- Probably not a substantial claim. 14
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“In the time domain, TS-TCC [116] and its extended version CA-TCC [117] designed two time series data augmentation techniques, one is strong augmentation (permutation-and-jitter), and the other is weak augmentation (jitter-and-scale).”
From Self-Supervised Learning for Time Series Analysis: Taxonomy, Progress, and Prospects (2024) · cites this paper as [117]
The cited source says what the claim attributes to it.
In the citing paper
“TS-TCC [116] and its extended version CA-TCC [117] designed a cross prediction task, which uses the context of x T 1 to predict the target in x T 2 , and vice versa uses the context of x T 2 to predict the target in x T 1 .”
From Self-Supervised Learning for Time Series Analysis: Taxonomy, Progress, and Prospects (2024) · cites this paper as [117]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
§ 5.1.1 Comparison with Baseline Approaches · p. 8
“| Epilepsy | 75.5 ± 3.6 | 70.5 ± 3.3 | 83.4 ± 0.7 | 80.4 ± 0.7 | 92.8 ± 0.2 | 89.0 ± 0.3 | 92.8 ± 0.3 | 90.2 ± 0.5 | 91.3 ± 0.5 | 89.2 ± 1.0 | 93.1 ± 0.3 | 93.7 ± 0.6 |”
§ 4.1.3 Epilepsy Seizure Prediction · p. 6
“we merged them into one class and treat it as a binary classification problem.”
Citations
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404
Exploiting Generative AI to Scale up Intelligent Tutoring Systems
Jakubův, J., Chvalovský, K., Goertzel, Z., Kaliszyk, C., Olšák, M., Piotrowski, B., Schulz, S., Suda, M., & Urban, J. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itp.2023.19 · Cited by 76,658
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
Momentum Contrast for Unsupervised Visual Representation Learning
He, K., Fan, H., Wu, Y., Xie, S., & Girshick, R. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00975 · Cited by 13,347
Representation Learning with Contrastive Predictive Coding
Oord, A. V. D., Li, Y., & Vinyals, O. (2018) · arXiv · doi:10.48550/arxiv.1807.03748 · Cited by 6,242 · cited 4×
“4) CPC [21]: a contrastive self-supervised learning method that predicts future timesteps in the embedding space.”
InfluentialTarvainen, A., & Valpola, H. (2017) · arXiv · doi:10.48550/arxiv.1703.01780 · Cited by 4,275
Exploring Simple Siamese Representation Learning
Chen, X., & He, K. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01549 · Cited by 3,725
Supervised Contrastive Learning
Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., & Krishnan, D. (2020) · arXiv · doi:10.48550/arxiv.2004.11362 · Cited by 3,569 · cited 2×
“Many studies showed that composing multiple data augmentation operations achieves better performance for image data [4], [43].”
Zhang, R., Isola, P., & Efros, A. A. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46487-9_40 · Cited by 3,178
Andrzejak, R. G., Lehnertz, K., Mormann, F., Rieke, C., David, P., & Elger, C. E. (2001) · Physical Review E · doi:10.1103/physreve.64.061907 · Cited by 3,032
FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence
Sohn, K., Berthelot, D., Li, C.-L., Zhang, Z., Carlini, N., Cubuk, E. D., Kurakin, A., Zhang, H., & Raffel, C. (2020) · arXiv · doi:10.48550/arxiv.2001.07685 · Cited by 2,892
Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles
Noroozi, M., & Favaro, P. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46466-4_5 · Cited by 2,775
Unsupervised Representation Learning by Predicting Image Rotations
Gidaris, S., Singh, P., & Komodakis, N. (2018) · arXiv · doi:10.48550/arxiv.1803.07728 · Cited by 2,477
Opportunities and obstacles for deep learning in biology and medicine
Ching, T., Himmelstein, D. S., Beaulieu-Jones, B. K., Kalinin, A. A., Do, B. T., Way, G. P., Ferrero, E., Agapow, P.-M., Zietz, M., Hoffman, M. M., et al. (2018) · Journal of The Royal Society Interface · doi:10.1098/rsif.2017.0387 · Cited by 2,310
Time series classification from scratch with deep neural networks: A strong baseline
Wang, Z., Yan, W., & Oates, T. (2017) · 2017 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2017.7966039 · Cited by 2,299 · cited 1×
“In particular, the encoder has a 3-block convolutional architecture as proposed in [39].”
Self-Supervised Visual Feature Learning With Deep Neural Networks: A Survey
Jing, L., & Tian, Y. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.2992393 · Cited by 2,036
Learning deep representations by mutual information estimation and maximization
Hjelm, R. D., Fedorov, A., Lavoie-Marchildon, S., Grewal, K., Bachman, P., Trischler, A., & Bengio, Y. (2018) · arXiv · doi:10.48550/arxiv.1808.06670 · Cited by 1,991
(2013) · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · Cited by 1,959
Unsupervised Learning of Video Representations using LSTMs
Srivastava, N., Mansimov, E., & Salakhutdinov, R. (2015) · arXiv · doi:10.48550/arxiv.1502.04681 · Cited by 1,861
Self-Supervised Learning of Pretext-Invariant Representations
Misra, I., & van der Maaten, L. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00674 · Cited by 1,435 · cited 1×
“Misra et al. proposed learning invariant representations based on pretext tasks by encouraging the representation of both the pretext task and the original image to be similar [16].”
DeepSleepNet: a model for automatic sleep stage scoring based on raw single-channel EEG
Supratak, A., Dong, H., Wu, C., & Guo, Y. (2017) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2017.2721116 · Cited by 1,376
Lessmeier, C., Kimotho, J. K., Zimmer, D., & Sextro, W. (2016) · PHM Society European Conference · doi:10.36001/phme.2016.v3i1.1577 · Cited by 1,268
TS2Vec: Towards Universal Representation of Time Series
Yue, Z., Wang, Y., Duan, J., Yang, T., Huang, C., Tong, Y., & Xu, B. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i8.20881 · Cited by 850
S4L: Self-Supervised Semi-Supervised Learning
Zhai, X., Oliver, A., Kolesnikov, A., & Beyer, L. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00156 · Cited by 750
Time Series Data Augmentation for Deep Learning: A Survey
Wen, Q., Sun, L., Yang, F., Song, X., Gao, J., Wang, X., & Xu, H. (2021) · Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/631 · Cited by 727
Time Series Data Augmentation for Deep Learning: A Survey
Wen, Q., Sun, L., Yang, F., Song, X., Gao, J., Wang, X., & Xu, H. (2020) · arXiv · doi:10.48550/arxiv.2002.12478 · Cited by 727
Time-Series Representation Learning via Temporal and Contextual Contrasting
Eldele, E., Ragab, M., Chen, Z., Wu, M., Kwoh, C. K., Li, X., & Guan, C. (2021) · Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/324 · Cited by 696 · cited 1×
“This journal paper is an extended version of our previous work [11].”
Self-citationAn Attention-Based Deep Learning Approach for Sleep Stage Classification With Single-Channel EEG
Eldele, E., Chen, Z., Liu, C., Wu, M., Kwoh, C.-K., Li, X., & Guan, C. (2021) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2021.3076234 · Cited by 693
Self-citationLearning Deep Transformer Models for Machine Translation
Wang, Q., Li, B., Xiao, T., Zhu, J., Li, C., Wong, D. F., & Chao, L. S. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1176 · Cited by 673
DivideMix: Learning with Noisy Labels as Semi-supervised Learning
Li, J., Socher, R., & Hoi, S. C. H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.07394 · Cited by 500
Self-Supervised ECG Representation Learning for Emotion Recognition
Sarkar, P., & Etemad, A. (2022) · IEEE Transactions on Affective Computing · doi:10.1109/taffc.2020.3014842 · Cited by 383
Exploring Simple Siamese Representation Learning
Chen, X., & He, K. (2020) · arXiv · doi:10.48550/arxiv.2011.10566 · Cited by 381
Multi-task Self-Supervised Learning for Human Activity Detection
Saeed, A., Ozcelebi, T., & Lukkien, J. (2019) · Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies · doi:10.1145/3328932 · Cited by 346 · cited 1×
“The first approach is to apply generic regularizations, e.g., ensembling and reconstruction.”
Learning and Using the Arrow of Time
Wei, D., Lim, J., Zisserman, A., & Freeman, W. T. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00840 · Cited by 315
Qi, G.-J., & Luo, J. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3031898 · Cited by 315
Unsupervised Scalable Representation Learning for Multivariate Time Series
Franceschi, J.-Y., Dieuleveut, A., & Jaggi, M. (2019) · arXiv · doi:10.48550/arxiv.1901.10738 · Cited by 305
Uncovering the structure of clinical EEG signals with self-supervised learning
Banville, H., Chehab, O., Hyvärinen, A., Engemann, D.-A., & Gramfort, A. (2021) · Journal of Neural Engineering · doi:10.1088/1741-2552/abca18 · Cited by 245
Self-Supervised Contrastive Pre-Training for Time Series Via Time-Frequency Consistency
Zhang, X., Zhao, Z., Tsiligkaridis, T., & Žitnik, M. (2022) · neural information processing systems · doi:10.52202/068431-0288 · Cited by 203
Exploiting Unlabeled Data in CNNs by Self-Supervised Learning to Rank
Liu, X., Weijer, J. V. D., & Bagdanov, A. D. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2899857 · Cited by 192
A Survey on Contrastive Self-Supervised Learning
Jaiswal, A., Babu, A. R., Zadeh, M. Z., Banerjee, D., & Makedon, F. (2020) · Technologies · doi:10.3390/technologies9010002 · Cited by 154
(2020) · Cited by 147
SelfMatch: Robust semisupervised time‐series classification with self‐distillation
Xing, H., Xiao, Z., Zhan, D., Luo, S., Dai, P., & Li, K. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22957 · Cited by 113
Gharehbaghi, A., & Lindén, M. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2754294 · Cited by 101
Unsupervised Time-Series Representation Learning with Iterative Bilinear Temporal-Spectral FusionPreprint
Yang, L. Q., & Hong, S. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2202.04770 · Cited by 99
A Novel Semisupervised Deep Learning Method for Human Activity Recognition
Zhu, Q., Chen, Z., & Soh, Y. C. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2889315 · Cited by 97
Self-citationAdversarial Multiple-Target Domain Adaptation for Fault Classification
Ragab, M., Chen, Z., Wu, M., Li, H., Kwoh, C.-K., Yan, R., & Li, X. (2021) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2020.3009341 · Cited by 90 · cited 1×
“Each working condition can be considered as a separate domain as it has different characteristics from the other working conditions (e.g., rotational speed and load torque) [50].”
Self-citationSemi-Supervised Time Series Classification by Temporal Relation Prediction
Fan, H., Zhang, F., Wang, R., Huang, X., & Li, Z. (2021) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp39728.2021.9413883 · Cited by 74
Subject-Aware Contrastive Learning for Biosignals
Cheng, J. Y., Goh, H., Dogrusoz, K., Tuzel, O., & Azemi, E. (2020) · arXiv · doi:10.48550/arxiv.2007.04871 · Cited by 74 · cited 1×
“Self-Supervised Contrastive Representation Learning for Semi-Supervised Time-Series Classification”
Reg-Gan: Semi-Supervised Learning Based on Generative Adversarial Networks for Regression
Rezagholiradeh, M., & Haidar, M. A. (2018) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2018.8462534 · Cited by 63
SUCCESS: A New Approach for Semi-supervised Classification of Time-Series
Marussy, K., & Búza, K. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38658-9_39 · Cited by 53
Liu, D., Wang, T., Liu, S., Wang, R., Yao, S., & Abdelzaher, T. (2021) · 2021 International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn52240.2021.9522151 · Cited by 44
Sense and Learn: Self-supervision for omnipresent sensors
Saeed, A., Ungureanu, V., & Gfeller, B. (2021) · Machine Learning with Applications · doi:10.1016/j.mlwa.2021.100152 · Cited by 34
Adversarial Unsupervised Representation Learning for Activity Time-Series
Aggarwal, K., Joty, S., Fernandez-Luque, L., & Srivastava, J. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.3301834
Research works printed but not linked: 3
- 10.5555/3524938.3525087 · doi:10.5555/3524938.3525087
- 10.5555/3495724.3497510 · doi:10.5555/3495724.3497510
- 10.1161/01.cir.101.23.e21 · doi:10.1161/01.cir.101.23.e21
Cited by
Self-Supervised Learning for Time Series Analysis: Taxonomy, Progress, and Prospects
Zhang, K., Wen, Q., Zhang, C., Cai, R., Jin, M., Liu, Y., Zhang, J. Y., Liang, Y., Pang, G., Song, D., et al. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3387317 · Cited by 295
“TS-TCC [116] and its extended version CA-TCC [117] designed a cross prediction task, which uses the context of x T 1 to predict the target in x T 2 , and vice versa uses the context of x T 2 to predict the target in x T 1 .”
MethodDeep learning for time series forecasting: a survey
Kong, X., Chen, Z., Liu, W., Ning, K., Zhang, L., Muhammad Marier, S., Liu, Y., Chen, Y., & Xia, F. (2025) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-025-02560-w · Cited by 211
Self-citationNon-Invasive Brain-Computer Interfaces: State of the Art and Trends
Edelman, B. J., Zhang, S., Schalk, G., Brunner, P., Müller-Putz, G., Guan, C., & He, B. (2025) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2024.3449790 · Cited by 170
Self-citationTimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning
Liu, J., & Chen, S. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i12.29299 · Cited by 235
Hong, Z., Li, Z., Zhong, S., Lyu, W., Wang, H., Ding, Y., He, T., & Zhang, D. (2024) · Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies · doi:10.1145/3659597 · Cited by 67
Metadata
- Authors
- Eldele, E., Ragab, M., Chen, Z., Wu, M., Kwoh, C.-K., Li, X., & Guan, C.
- Affiliations
- Agency for Science, Technology and Research (SG)
- Nanyang Technological University (SG)
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2023-12
- Volume
- 45
- Issue
- 12
- Pages
- 15604-15618
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W4386212336
- Cited by
- 224
- References
- 51
- Citations by year
- 2026: 71 · 2025: 89 · 2024: 55 · 2023: 9
- FWCI
- 27.15
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- DR-NTU (Nanyang Technological University) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- Funders
- A*STAR SINGA Scholarship
- Agency for Science, Technology and Research
- AME Programmatic Funds (A20H6b0151)
- Career Development (C210112046)
- MOE Academic Research (MOE2019-T2-2-175)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Time Series Analysis and Forecasting
- Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
- Physical Sciences › Computer Science › Signal Processing › Music and Audio Processing
- Keywords
- time series classification, semi-supervised learning, self-supervised learning, contrastive learning, data augmentation, pseudo-labeling, few labeled samples, transfer learning, representation learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-05, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-05 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.