- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper introduces a non-redundant time-series clustering method that uncovers multiple distinct clusterings in time-series datasets. The proposed method employs a single-encoder and multi-decoder architecture, where each decoder learns to identify distinct clusters using several loss functions, including a non-redundancy loss. Experimental results demonstrate that the proposed method achieves competitive NMI scores across various datasets.
Critical strengths
None
Critical weaknesses
- The authors identify two challenging issues in non-redundant time-series clustering, but it is unclear how the proposed method addresses these issues.
- It is unclear which component of the proposed method addresses the characteristics of time-series data. In particular, it is unclear how the proposed method differs from existing approaches in addressing time-series data.
- Simply extending non-redundant clustering to time-series data offers limited novelty.
- The motivation and rationale behind the model architecture are insufficiently explained. The Method section only describes computational processes and training procedures without clarifying why each component is necessary.
- It is unclear which components of the proposed method are novel and which are adopted from existing work, making it difficult to assess the novelty of this paper.
- The experiments primarily focus on comparing clustering performance using NMI scores. There are limited analyses of the proposed method's distinctive properties and effectiveness.
- The paper does not sufficiently explain whether the collected and newly constructed datasets are appropriate benchmarks for evaluating non-redundant clustering performance.
Questions for authors
- What limitations does the proposed method aim to address?
- Which components of the proposed method are designed to address the characteristics of time-series data? Also, existing non-redundant clustering methods appear to be readily applicable to time-series data. Is there any problem?
- What is the rationale behind the model architecture presented in Section 3.1? In particular, why is each component necessary for non-redundant time-series clustering?
- Which components are novel, and how do they differ compared to existing methods?
- Could the authors provide additional experiments that can directly validate the contribution of this paper?
- How did the authors verify that the collected and newly constructed datasets are suitable for evaluating non-redundant clustering? In particular, how did the authors determine the ground-truth number of facets and clusters for each dataset?
- In real-world scenarios, the numbers of meaningful facets and clusters are typically unknown. Can the proposed method still discover meaningful patterns when and differ from their ground-truth values?
3 comments
Thank you for the detailed rebuttal and additional experiments. However, I still have several concerns regarding the contributions of this paper.
It remains unclear what makes the proposed method specifically designed for non-redundant time-series clustering. Beyond the temporal encoder, the authors do not clearly identify which components are proposed to address challenges specific to time-series data. I also have a question about whether the components described in "W3-W5 / Q3-Q4" address challenges specific to time-series data.
If there are no components specifically designed for time series, comparisons on other modalities, such as images, should be conducted to validate the contributions of the proposed method.
Although the authors claim novelty in the proposed architecture and loss design, the specific novelty of the loss functions remains unclear. In particular, how do the three losses differ from those used in existing non-redundant clustering methods?
The additional experiments raise further concerns about the reliability of the proposed method. The authors reported collapse in 8 out of 25 runs, even with the full model. Such a high failure raises questions about the stability and reliability of the proposed method.
Considering these unresolved concerns, I will maintain my original score.
The design choices are based on the temporal structure of the data and we explain a few of them below, however The relevant question is whether their combination provides benefits over existing methods adapted to the same setting. Our comparisons use the same temporal encoder for the deep non-redundant baselines, and NRTSC achieves the best NMI and ARI ranks while providing inspectable temporal reconstructions. These results support the design’s effectiveness for non-redundant time-series clustering.
Design choices relevant to temporal structure of the data:
- Additive reconstruction: each facet reconstructs a full-length component, and their sum (superposition) reconstructs the input.
- Each facet’s representation feeds both a clustering head and a dedicated decoder. This connects its partition to an inspectable waveform, revealing the temporal pattern associated with that clustering.
- Decorrelation of reconstructed waveforms: Squared cosine similarity discourages facets from reconstructing aligned components or opposing components that cancel in the sum. This supports complementary explanations of the observed signal
How our design choices differ from existing methods?
-
ENRC learns a single parameter matrix whose softmax produces feature weights shared across samples. Our gater extends this weighting idea to sample-dependent routing: an MLP predicts masks from each input’s embedding and applies them to separate facet blocks before clustering and decoding. This is a conceptual extension, not an identical parameterization: ENRC weights shared transformed coordinates, whereas NRTSC weights coordinates within facet-specific blocks.
-
ENRC uses reconstruction through a shared decoder. iMClusts also combines autoencoding with diversified attention to learn salient clustering subspaces; consequently, neither reconstruction nor attention-based feature selection alone constitutes our novelty. In NRTSC, each facet representation feeds its own decoder, and the sum of the decoded components reconstructs the input. Mask-sharpness and mask-usage penalties encourage selective routing and discourage inactive masks. This couples representation learning to an inspectable temporal decomposition rather than only to the recovery of the complete input.
-
Clustering: prediction consistency rather than centroid compression. Methods such as ENRC, AutoNR, and CMClusts use centroid-based objectives or k-Means-related procedures that favor compact clusters in their respective representation spaces. NRTSC instead learns assignments through consistency between predictions from perturbed latent views, together with a balance term that discourages collapse. Consequently, it does not explicitly require embeddings to concentrate around cluster centroids.
The final clustering does not collapse.
Here, “collapse” means that facets produce nearly identical partitions (inter-facet NMI > 0.95), rather than all samples being assigned to one cluster. The 8/25 figure counts individual restarts before model selection, across five seeds with five restarts each. It therefore measures redundancy within individual restarts, not the failure rate of the complete procedure. Table 7 in Appendix A.3 reports the average inter-facet NMI between the clusterings discovered by each algorithm including NRTSC. For most datasets the inter-facet NMI is near zero, and the maximum inter-facet NMI is only 0.39.
NRTSC selects among restarts using an unsupervised score. Table 3 reports selected-model recovery alongside collapse counts across all restarts, making initialization sensitivity visible.
The controlled comparison also shows that the proposed design improves stability: collapsed restarts increase from 8/25 for the full model to 15/25 with fixed routing, 16/25 with a shared decoder without the gater, and 25/25 when the split, gater, and HSIC are jointly removed. Thus, learned routing and facet separation substantially reduce redundant solutions, although they do not eliminate them.
We acknowledge the remaining initialization sensitivity as a limitation. Our results support effectiveness under the reported restart-and-selection protocol, rather than a guarantee of successful non-redundant recovery from every initialization.
Temporal Design and Novelty, Architectural Evidence, Benchmark Validity, and Count Sensitivity
Thank you for asking us to connect the challenges, design, and evidence. NRTSC discovers and exposes multiple temporal clusterings, with a benchmark for evaluating them.
W1–W2 / Q1–Q2: Challenges and temporal design
Section 1 identifies two difficulties: temporal aspects overlap in the same measurements, and their meanings are unknown in advance. NRTSC learns convolutional temporal features, splits them into facet blocks, and applies sample-specific masks. Each masked block feeds its own clustering head and decoder; the decoded components sum to reconstruct the input (Section 3.1; Figure 2). Reconstruction preserves information; component decorrelation and cross-facet HSIC discourage overlap (Section 3.2). Figure 1 illustrates separate frequency and bump-direction components. Consistency uses perturbed embeddings rather than aspect-specific raw-signal transformations, avoiding the need to prescribe which temporal properties should be invariant. The numbers of facets and clusters are supplied, but their semantic identities are learned. Existing non-redundant methods can process temporal representations: the evaluation explicitly adapts them. ENRC, DivClust, iMClusts, and CMClusts use the same temporal encoder as NRTSC; ISAAC and AutoNR use pretrained temporal-autoencoder embeddings (Section 5; Appendix A.3). This tests the framework beyond encoder replacement.
W3–W5 / Q3–Q4: Novelty and architectural rationale
Sections 2–3 position the contribution in the combination of masked facet routing, separate cluster heads, and dedicated decoders trained through summed reconstruction, consistency, and non-redundancy objectives. The contribution connects each partition to an inspectable temporal component. The components serve distinct roles.
Such architecture and loss design is novel, additionally none of the previous research has tackled the problem of time non-redundant clustering. Our research introduces the problem, a benchmark for evaluation and a novel design of a method that excel among existing adapted comparison methods.
W6 / Q5: Direct evidence
We included architectural ablation in addition to the loss ablation. The seven-loss ablation spans four datasets and nine labelings (Table 1; Figure 10), with reconstruction, clustering, and balance having the largest effects. Architecture ablation shows the importance of each part. Table 3 reports 8/25 collapsed BumpFreq restarts for the full model, versus 15/25 with fixed routing and 25/25 after jointly removing split, gater, and HSIC. Figure 4 shows that shared decoding can preserve perfect clustering accuracy while mixing signal components, supporting dedicated decoders for faithful interpretation.
Statistical evidence. Figure 5 reports two-sided Wilcoxon signed-rank tests with Holm correction over 45 comparisons per metric (=0.05). NRTSC significantly outperforms DivClust, ISAAC, iMClusts, CMClusts, and DTCC in both NMI and ARI, and AutoNR in ARI.
W7 / Q6: Benchmark suitability and reference counts
Section 4 and Appendix A.2 distinguish six real-data-derived datasets, two existing synthetic datasets, and three constructed datasets. Exact signal matching reunites documented annotations for the same real observations. SyntheticControl and TwoPatterns factor documented class definitions without altering the signals. BumpFreq and BME-AC supply controlled factors; Plane-AC adds a controlled trend to aircraft outlines. The reference facet count is the number of available criteria and each cluster count is its label cardinality (Tables 2 and 5).
Q7: Unknown or misspecified counts
NRTSC does not estimate counts automatically. Appendix A.5/Table 8 tests overestimates on four datasets over three seeds. DistalPhalanx age/TW NMI changes only from 0.415/0.620 at [3,6] to 0.393/0.601 at [4,7] and 0.413/0.617 with an extra binary facet. BME-AC retains perfect recovery with an extra facet, but three clusters per facet make peak recovery unstable. SyntheticControl direction remains at NMI 0.685–1.000 and GunPoint era at least 0.781 across tested settings. Extra facets can duplicate partitions, and some clusters remain unoccupied. Therefore, meaningful structure can survive overestimates.