IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v41y2024i2d10.1007_s00357-024-09472-4.html
   My bibliography  Save this article

Accelerated Sequential Data Clustering

Author

Listed:
  • Reza Mortazavi

    (Damghan University)

  • Elham Enayati

    (University of Bojnord)

  • Abdolali Basiri

    (Damghan University)

Abstract

Data clustering is an important task in the field of data mining. In many real applications, clustering algorithms must consider the order of data, resulting in the problem of clustering sequential data. For instance, analyzing the moving pattern of an object and detecting community structure in a complex network are related to sequential data clustering. The constraint of the continuous region prevents previous clustering algorithms from being directly applied to the problem. A dynamic programming algorithm was proposed to address the issue, which returns the optimal sequential data clustering. However, it is not scalable and hence the practicality is limited. This paper revisits the solution and enhances it by introducing a greedy stopping condition. This condition halts the algorithm’s search process when it is likely that the optimal solution has been found. Experimental results on multiple datasets show that the algorithm is much faster than its original solution while the optimality gap is negligible.

Suggested Citation

  • Reza Mortazavi & Elham Enayati & Abdolali Basiri, 2024. "Accelerated Sequential Data Clustering," Journal of Classification, Springer;The Classification Society, vol. 41(2), pages 245-263, July.
    • Handle: RePEc:spr:jclass:v:41:y:2024:i:2:d:10.1007_s00357-024-09472-4
    DOI: 10.1007/s00357-024-09472-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-024-09472-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-024-09472-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Roy Cerqueti & L. de Giovanni & P. d'Urso & M. Giacalone & R. Mattera, 2022. "Weighted score-driven fuzzy clustering of time series with a financial application," Post-Print hal-03789065, HAL.
    2. Muhammed-Fatih Kaya & Mareike Schoop, 2022. "Analytical Comparison of Clustering Techniques for the Recognition of Communication Patterns," Group Decision and Negotiation, Springer, vol. 31(3), pages 555-589, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Luis Lorenzo & Javier Arroyo, 2023. "Online risk-based portfolio allocation on subsets of crypto assets applying a prototype-based clustering algorithm," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 9(1), pages 1-40, December.
    2. Muhammed-Fatih Kaya, 2022. "Pattern Labelling of Business Communication Data," Group Decision and Negotiation, Springer, vol. 31(6), pages 1203-1234, December.

    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:spr:jclass:v:41:y:2024:i:2:d:10.1007_s00357-024-09472-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.