IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i17p2814-d1739864.html
   My bibliography  Save this article

KDiscShapeNet: A Structure-Aware Time Series Clustering Model with Supervised Contrastive Learning

Author

Listed:
  • Xi Chen

    (School of Software, Shenyang University of Technology, Shenyang 110870, China)

  • Yufan Jiang

    (School of Software, Shenyang University of Technology, Shenyang 110870, China)

  • Yingming Zhang

    (School of Software, Shenyang University of Technology, Shenyang 110870, China)

  • Chunhe Song

    (Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110870, China)

Abstract

Time series clustering plays a vital role in various analytical and pattern recognition tasks by partitioning structurally similar sequences into semantically coherent groups, thereby facilitating downstream analysis. However, building high-quality clustering models remains challenging due to three key issues: (i) capturing dynamic shape variations across sequences, (ii) ensuring discriminative cluster structures, and (iii) enabling end-to-end optimization. To address these challenges, we propose KDiscShapeNet, a structure-aware clustering framework that systematically extends the classical k-Shape model. First, to enhance temporal structure modeling, we adopt Kolmogorov–Arnold Networks (KAN) as the encoder, which leverages high-order functional representations to effectively capture elastic distortions and multi-scale shape features of time series. Second, to improve intra-cluster compactness and inter-cluster separability, we incorporate a dual-loss constraint by combining Center Loss and Supervised Contrastive Loss, thus enhancing the discriminative structure of the embedding space. Third, to overcome the non-differentiability of traditional K-Shape clustering, we introduce Differentiable k-Shape, embedding the normalized cross-correlation (NCC) metric into a differentiable framework that enables joint training of the encoder and the clustering module. We evaluate KDiscShapeNet on nine benchmark datasets from the UCR Archive and the ETT suite, spanning healthcare, industrial monitoring, energy forecasting, and astronomy. On the Trace dataset, it achieves an ARI of 0.916, NMI of 0.927, and Silhouette score of 0.931; on the large-scale ETTh1 dataset, it improves ARI by 5.8% and NMI by 17.4% over the best baseline. Statistical tests confirm the significance of these improvements ( p < 0.01). Overall, the results highlight the robustness and practical utility of KDiscShapeNet, offering a novel and interpretable framework for time series clustering.

Suggested Citation

  • Xi Chen & Yufan Jiang & Yingming Zhang & Chunhe Song, 2025. "KDiscShapeNet: A Structure-Aware Time Series Clustering Model with Supervised Contrastive Learning," Mathematics, MDPI, vol. 13(17), pages 1-22, September.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2814-:d:1739864
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/17/2814/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/17/2814/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2814-:d:1739864. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.