Related Experiment Video
Updated: May 16, 2026

05:04
Bouncing Ball with a Uniformly Varying Velocity in a Metronome Synchronization Task
Published on: September 21, 2017
CompleMatch: Boosting Time-Series Semi-Supervised Classification With Temporal-Frequency Complementarity
IEEE Transactions on Pattern Analysis and Machine Intelligence
|December 15, 2025
Summary
CompleMatch enhances time series semi-supervised classification (SSC) by combining temporal and frequency data. This novel approach improves model accuracy with limited labeled data, outperforming existing methods.
Area of Science:
- Machine Learning
- Data Science
- Signal Processing
Background:
- Semi-Supervised Classification (SSC) leverages unlabeled data to improve model performance when labeled samples are scarce.
- Existing time series SSC methods primarily rely on temporal dependencies, which can be sensitive to noise and may miss global feature periodicity.
Purpose of the Study:
- To introduce CompleMatch, a novel time series SSC framework that utilizes complementary information from both temporal and frequency domains.
- To enhance the learning from unlabeled data by integrating diverse data representations.
Main Methods:
- CompleMatch employs a co-training paradigm with two simultaneously trained deep neural networks, one for time-domain and one for frequency-domain views.
- Pseudo-labels generated via label propagation guide the training of each network, exploiting the complementary nature of temporal-frequency representations.
- A temporal-frequency contrastive learning module integrates supervised and self-supervised signals to improve pseudo-label quality and representation discriminability.
Main Results:
- CompleMatch significantly outperforms state-of-the-art methods in time series SSC tasks.
- Ablation studies and visualizations confirm the effectiveness of the proposed temporal-frequency complementary learning strategy.
- The framework demonstrates enhanced robustness and performance, particularly under conditions of limited labeled data.
Conclusions:
- The proposed CompleMatch framework effectively leverages complementary temporal and frequency information for robust time series SSC.
- Integrating diverse data representations and contrastive learning enhances model performance and discriminative power.
- CompleMatch offers a promising advancement for semi-supervised learning in time series analysis.
Related Concept Videos
Frequency-dependent Selection
23.0K
When the fitness of a trait is influenced by how common it is (i.e., its frequency) relative to different traits within a population, this is referred to as frequency-dependent selection. Frequency-dependent selection may occur between species or within a single species. This type of selection can either be positive—with more common phenotypes having higher fitness—or negative, with rarer phenotypes conferring increased fitness.
23.0K
Expected Frequencies in Goodness-of-Fit Tests
7.0K
A goodness-of-fit test is conducted to determine whether the observed frequency values are statistically similar to the frequencies expected for the dataset. Suppose the expected frequencies for a dataset are equal such as when predicting the frequency of any number appearing when casting a die. In that case, the expected frequency is the ratio of the total number of observations (n) to the number of categories (k).
7.0K
Classification of Signals
1.3K
In signal processing, signals are classified based on various characteristics: continuous-time versus discrete-time, periodic versus aperiodic, analog versus digital, and causal versus noncausal. Each category highlights distinct properties crucial for understanding and manipulating signals.
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
1.3K
Properties of Fourier Transform II
697
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
697
Aliasing
523
Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
523
Aggregates Classification
950
Aggregate classification is generally based on its size, petrographic characteristics, weight, and source. Size classification ranges from coarse to fine aggregates, defined by the size of the particles. Coarse aggregates are particles that do not pass through ASTM sieve No. 4, and aggregates that pass through the sieve are fine aggregates.
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
950

