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

Multiscale Fuzzy Temporal Pattern Mining: A Block-Decomposition Algorithm for Partial Periodic Associations in Event Data

Author

Listed:
  • Aihua Zhu

    (School of Computer Engineering, Jiangsu University of Technology, No. 1801, Zhongwu Avenue, Zhonglou District, Changzhou 213024, China
    These authors contributed equally to this work.)

  • Haote Zhang

    (School of Computer Engineering, Jiangsu University of Technology, No. 1801, Zhongwu Avenue, Zhonglou District, Changzhou 213024, China
    These authors contributed equally to this work.)

  • Xingqian Chen

    (School of Computer Engineering, Jiangsu University of Technology, No. 1801, Zhongwu Avenue, Zhonglou District, Changzhou 213024, China
    These authors contributed equally to this work.)

  • Dingkun Zhu

    (School of Computer Engineering, Jiangsu University of Technology, No. 1801, Zhongwu Avenue, Zhonglou District, Changzhou 213024, China)

Abstract

This paper introduces a dual-strategy model based on temporal transformation and fuzzy theory, and designs a partitioned mining algorithm for periodic frequent patterns in large-scale event data (3P-TFT). The model reconstructs original event data through temporal reorganization and attribute fuzzification, preserving data continuity distribution characteristics while enabling efficient processing of multidimensional attributes within a multi-temporal granularity calendar framework. The 3P-TFT algorithm employs temporal interval and object attribute partitioning strategies to achieve distributed mining of large-scale data. Experimental results demonstrate that this method effectively reveals hidden periodic patterns in stock trading events at specific temporal granularities, with volume–price association rules providing significant predictive and decision-making value. Furthermore, comparative algorithm experiments confirm that the 3P-TFT algorithm exhibits exceptional stability and adaptability across event databases with various cycle lengths, offering a novel theoretical tool for complex event data mining.

Suggested Citation

  • Aihua Zhu & Haote Zhang & Xingqian Chen & Dingkun Zhu, 2025. "Multiscale Fuzzy Temporal Pattern Mining: A Block-Decomposition Algorithm for Partial Periodic Associations in Event Data," Mathematics, MDPI, vol. 13(8), pages 1-18, April.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:8:p:1349-:d:1638725
    as

    Download full text from publisher

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

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

    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:8:p:1349-:d:1638725. 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.