- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes DTMVC for multi-view time series clustering. The method combines normalized state distances with first-order difference distances to construct fixed pairwise relationships and a sparse ternary geometric loss, thereby adaptively learning orthogonal embeddings for each view. The cross-view component combines projected product consensus with tensor norm regularization of orthogonally aligned embeddings, and finally runs k-means on the normalized H-row common embedding. The authors propose a two-layer proximal MM–iALM algorithm and prove, under specified conditions, that the splitting residuals tend to zero and that the clusters of the original variables exhibit first-order fixed-point properties. Comparisons across six datasets, parameter analysis, and ablation studies yield positive results; however, the experimental report and implementation details still require clarification.
Critical strengths
1.The model addresses coordinate discrepancies between temporal geometry and embedding representations. States and first-order differences are combined to construct pairwise and triplet sample relationships; projection–product consensus is combined with tensor norm regularization of orthogonally aligned embeddings to reduce the impact of coordinate selection on tensor constraints. 2.The appendix provides a detailed explanation of the update mechanism and convergence proofs. Table 2 reports the best values for all metrics across six datasets using the same set of parameters; these results support the method’s potential practical value.
Critical weaknesses
1.The lack of consistency in the experiments and the model selection protocol make it difficult to fully assess the performance evidence. DSADS achieves an ACC of 70.37 ± 4.47 in Table 2, while the Full DTMVC model—claimed to be the optimal result from the grid search in Table 3—achieves 68.38 ± 4.99; the parameter combinations in Table 2 also fall within that grid. Differences may be attributed to variations in random runs or settings, but this has not been explained. It remains to be clarified whether the parameter selection for the grid search was based on labeled data, and the method for selecting parameters during unlabeled deployment also requires further explanation. 2.The dataset sizes in Table 1 range from 312 to 9,120 samples; the performance of the method on larger datasets has not yet been demonstrated. The time complexity analysis in the main text primarily covers pairwise matrix multiplication and sparse ternary terms; the appendix also does not provide additional details on the computational costs of steps such as orthogonal updates and tensor FFT/SVD, nor does it address the impact of the number of inner and outer iterations on the total runtime. Furthermore, the paper lacks a comparison of runtime with baseline methods. We recommend supplementing the paper with a comprehensive time complexity analysis and reporting runtime results across a range of sample sizes to validate the method’s computational efficiency and scalability.
Questions for authors
-
Please explain the differences in DSADS results between Table 2 and Table 3. Do both tables use the same data processing, optimization initialization, and k-means random seeds? Why are the optimal results from grid search lower than those from fixed parameter configurations within the grid?
-
How were the uniform parameters in Table 2 determined? Were the true labels from the evaluation dataset used? For practical unlabeled scenarios, how should the three hyperparameters be selected?
-
Did the comparison methods use the parameters recommended in the original paper, default parameters, or were they fine-tuned for each dataset? If fine-tuning was performed, please specify the parameter search range to ensure a fair comparison.
-
Could you provide a complete time complexity analysis covering the main update steps and the number of inner and outer iterations? Additionally, please report the comparison of runtime and clustering performance with baseline methods as the sample size gradually increases to verify the method’s scalability?
Response to Reviewer zvJm
Thank you for your careful review. We appreciate your pointing out the discrepancy between the two DSADS results and asking us to clarify the parameter-selection protocol and computational cost. We address each point below.
1. DSADS results in Table 2 and Figure 2. Thank you for pointing out this discrepancy. The DSADS run reported in the original Table 2 was continued until convergence. The parameter sensitivity analysis in Figure 2 used a fixed budget of 50 iterations. The highest ACC in Figure 2 was therefore specific to that budget. Even at a parameter setting included in the grid, continuing the optimization beyond 50 iterations could yield a different embedding and a higher ACC. We should have used the same stopping rule in both experiments and stated it explicitly.
2. Parameter selection and the role of labels. The original manuscript did not document the rationale for the fixed settings clearly enough. In particular, the archived DSADS fit used γ=1, which differs from the uniform setting described in the original text. Section 5.1 and Section 6 of the supplement now specify the revised protocol. We calculate a dataset-specific reference β from pairwise and triadic reference losses using only the input geometry. With β fixed, we evaluate all 64 (γ,λ) combinations and pool the results from 50 k-means starts per combination. Ground-truth labels are used to score the clustering outcomes, and every combination contributes to the reported statistics.
Table 3 serves a different purpose. Its Full DTMVC entry uses the highest mean ACC in the sensitivity grid, so that selection uses the benchmark labels. For unlabeled deployment, the reference β remains applicable. Selecting a single (γ,λ) pair would require a separate label-free criterion, such as clustering stability across resamples. We have not evaluated such a selection rule here.
3. Baseline parameter settings. We reviewed the parameter sources and input adaptations for all baselines and expanded the comparison to include MUSLA and CSMVC. We prioritize settings recommended in the original papers or released implementations. Where a sensitivity study supplies candidate ranges, we use those ranges to inform the grid and include every evaluated combination in the reported statistics. Section 5 of the supplement documents the settings for each method. For example, the S²MVTC, DSTL, and LMTC grids draw on the respective papers' sensitivity studies, and EMTC uses a configuration from its released training script. All methods receive the benchmark cluster count.
4. Computational cost and sample-size scaling. Section 4 of the supplement now gives costs for the main updates, including the orthogonal polar updates, the reduced eigensystem for the common embedding, and the FFT and slice SVDs in the tensor update. If ts is the number of inner sweeps in outer iteration s, the sweep-dependent cost scales with I=∑sts, with I≤SKin under a cap of Kin inner sweeps over S outer iterations. The analysis also accounts for one-time geometry construction and the final k-means readout.
Section 8 adds an eight-size experiment with three random repeats per size on MHEALTH and PASTIS-R. Mean runtime increased from 19.36 to 120.19 seconds on MHEALTH and from 5.70 to 48.60 seconds on PASTIS-R. Mean ACC stayed between 54.52% and 56.49% on MHEALTH. On PASTIS-R, it rose from 90.98% at 250 samples to 95.45% at 750 samples and then remained close to that level. Thus, across the tested sizes, the increase in runtime was accompanied by stable or improved mean ACC overall. These measurements characterize DTMVC on the two datasets. A head-to-head comparison with baselines at the same sample sizes remains an important follow-up.