Cited by 29Context-Aware Activity Recognition SystemsDomain Adaptation and Few-Shot LearningTime Series Analysis and Forecasting

Generalizable Low-Resource Activity Recognition with Diverse and Discriminative Representation Learning

Open access
Qin, Xin, Wang, Jindong, Ma, Shuo, Lu, Wang, Zhu, Yongchun, Xie, Xing, Chen, Yiqiang·2023·Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

Abstract

Human activity recognition (HAR) is a time series classification task that focuses on identifying the motion patterns from human sensor readings. Adequate data is essential but a major bottleneck for training a generalizable HAR model, which assists customization and optimization of online web applications. However, it is costly in time and economy to collect large-scale labeled data in reality, i.e., the low-resource challenge. Meanwhile, data collected from different persons have distribution shifts due to different living habits, body shapes, age groups, etc. The low-resource and distribution shift challenges are detrimental to HAR when applying the trained model to new unseen subjects. In this paper, we propose a novel approach called Diverse and Discriminative representation Learning (DDLearn) for generalizable low-resource HAR. DDLearn simultaneously considers diversity and discrimination learning. With the constructed self-supervised learning task, DDLearn enlarges the data diversity and explores the latent activity properties. Then, we propose a diversity preservation module to preserve the diversity of learned features by enlarging the distribution divergence between the original and augmented domains. Meanwhile, DDLearn also enhances semantic discrimination by learning discriminative representations with supervised contrastive learning. Extensive experiments on three public HAR datasets demonstrate that our method significantly outperforms state-of-art methods by an average accuracy improvement of 9.5% under the low-resource distribution shift scenarios, while being a generic, explainable, and flexible framework. Code is available at: https://github.com/microsoft/robustlearn.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3580305.3599360

Cites

40 of 40 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 16

  1. Shai Ben-David, John Blitzer, Koby Crammer, and Fernando Pereira. 2006. Anal- ysis of representations for domain adaptation. Advances in neural information processing systems 19 (2006).
  2. Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. 2020. A simple framework for contrastive learning of visual representations. In Interna- tional conference on machine learning. PMLR, 1597-1607.
  3. Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François Laviolette, Mario Marchand, and Victor Lempitsky. 2016. Domain-adversarial training of neural networks. The journal of machine learning research 17, 1 (2016), 2096-2030.
  4. Arthur Gretton, Karsten M Borgwardt, Malte J Rasch, Bernhard Schölkopf, and Alexander Smola. 2012. A kernel two-sample test. The Journal of Machine Learning Research 13, 1 (2012), 723-773.
  5. Nils Yannick Hammerla, James Fisher, Peter Andras, Lynn Rochester, Richard Walker, and Thomas Plötz. 2015. PD disease state assessment in naturalistic environments using deep learning. In Twenty-Ninth AAAI conference on artificial intelligence.
  6. Nils Y Hammerla, Shane Halloran, and Thomas Plötz. 2016. Deep, convolutional, and recurrent models for human activity recognition using wearables. IJCAI (2016).
  7. Bulat Khaertdinov, Esam Ghaleb, and Stylianos Asteriadis. 2021. Contrastive Self-supervised Learning for Sensor-based Human Activity Recognition. In 2021 IEEE International Joint Conference on Biometrics (IJCB). IEEE, 1-8.
  8. Prannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna, Yonglong Tian, Phillip Isola, Aaron Maschinot, Ce Liu, and Dilip Krishnan. 2020. Supervised contrastive learning. Advances in Neural Information Processing Systems 33 (2020), 18661- 18673.
  9. Xiao Liu, Fanjin Zhang, Zhenyu Hou, Li Mian, Zhaoyu Wang, Jing Zhang, and Jie Tang. 2021. Self-supervised learning: Generative or contrastive. IEEE Transactions on Knowledge and Data Engineering (2021).
  10. Wang Lu, Jindong Wang, Haoliang Li, Yiqiang Chen, and Xing Xie. 2022. Domain- invariant Feature Exploration for Domain Generalization. Transactions on Ma- chine Learning Research (2022).
  11. Wang Lu, Jindong Wang, Xinwei Sun, Yiqiang Chen, and Xing Xie. 2023. Out- of-distribution Representation Learning for Time Series Classification. In The Eleventh International Conference on Learning Representations.
  12. Hangwei Qian, Tian Tian, and Chunyan Miao. 2022. What Makes Good Con- trastive Learning on Small-Scale Wearable-based Tasks? KDD (2022).
  13. Yuge Shi, Jeffrey Seely, Philip HS Torr, N Siddharth, Awni Hannun, Nicolas Usunier, and Gabriel Synnaeve. 2022. Gradient matching for domain generaliza- tion. ICLR 2022 (2022).
  14. Chi Ian Tang, Ignacio Perez-Pozuelo, Dimitris Spathis, and Cecilia Mascolo. 2020. Exploring contrastive learning in human activity recognition for healthcare. In Machine Learning for Mobile Health Workshop at NeurIPS 2020 (2020).
  15. Vladimir Vapnik. 1992. Principles of risk minimization for learning theory. In NIPS. 831-838.
  16. Andrea Zunino, Sarah Adel Bargal, Riccardo Volpi, Mehrnoosh Sameki, Jianming Zhang, Stan Sclaroff, Vittorio Murino, and Kate Saenko. 2021. Explainable deep classification models for domain generalization. In CVPR. 3233-3242.

Cited by

Sorted by citations

Authors
Qin, X., Wang, J., Ma, S., Lu, W., Zhu, Y., Xie, X., & Chen, Y.
Affiliations
  • Chinese Academy of Sciences (CN)
  • Microsoft Research Asia (China) (CN)
  • Beijing Key Lab. of Mobile Com., CAS, Beijing, China
Venue
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
Publisher
ACM
Published
2023-08-04
Pages
1943-1953
OpenAlex
W4385565385
Cited by
29
References
40
Citations by year
2026: 11 · 2025: 13 · 2024: 5
FWCI
3.11
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
Funders
  • National Natural Science Foundation of China (61972383)
  • Chinese Academy of Sciences (XDA28040500)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Context-Aware Activity Recognition Systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Signal Processing › Time Series Analysis and Forecasting
Keywords
human activity recognition, low-resource learning, domain shift, cross-subject generalization, self-supervised learning, supervised contrastive learning, diversity preservation, representation learning, wearable sensor data, time series classification

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.

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