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

Order-Preserving Pattern Matching with Partition

Author

Listed:
  • Joong Chae Na

    (Department of Computer Science and Engineering, Sejong University, Seoul 05006, Republic of Korea
    These authors contributed equally to this work.)

  • Youngjoon Kim

    (Department of Computer Engineering, Inha University, Incheon 22212, Republic of Korea
    These authors contributed equally to this work.)

  • Seokchul Kang

    (Department of Computer Engineering, Inha University, Incheon 22212, Republic of Korea)

  • Jeong Seop Sim

    (Department of Computer Engineering, Inha University, Incheon 22212, Republic of Korea)

Abstract

Order-preserving pattern matching, which considers the relative orders of strings, can be applied to time-series data analysis. To perform a more meaningful analysis of time-series data, approximate criteria for the order-isomorphism are necessary, considering diverse types of errors. In this paper, we introduce a novel approximation criterion for the order-isomorphism, called the partitioned order-isomorphism. We then propose an efficient O ( n + s o r t ( m ) ) -time algorithm for the order-preserving pattern matching problem considering the criterion of partition. A comparative experiment demonstrates that the proposed algorithm is more effective than the exact order-preserving pattern matching algorithm.

Suggested Citation

  • Joong Chae Na & Youngjoon Kim & Seokchul Kang & Jeong Seop Sim, 2024. "Order-Preserving Pattern Matching with Partition," Mathematics, MDPI, vol. 12(21), pages 1-12, October.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:21:p:3381-:d:1509396
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/21/3381/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/21/3381/
    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:12:y:2024:i:21:p:3381-:d:1509396. 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.