IDEAS home Printed from https://ideas.repec.org/a/hin/complx/7887159.html
   My bibliography  Save this article

Event-Tree Based Sequence Mining Using LSTM Deep-Learning Model

Author

Listed:
  • János Abonyi
  • Richárd Károly
  • Gyula Dörgö
  • Gonzalo Farias

Abstract

During the operation of modern technical systems, the use of the LSTM model for the prediction of process variable values and system states is commonly widespread. The goal of this paper is to expand the application of the LSTM-based models upon obtaining information based on prediction. In this method, by predicting transition probabilities, the output layer is interpreted as a probability model by creating a prediction tree of sequences instead of just a single sequence. By further analyzing the prediction tree, we can take risk considerations into account, extract more complex prediction, and analyze what event trees are yielded from different input sequences, that is, with a given state or input sequence, the upcoming events and the probability of their occurrence are considered. In the case of online application, by utilizing a series of input events and the probability trees, it is possible to predetermine subsequent event sequences. The applicability and performance of the approach are demonstrated via a dataset in which the occurrence of events is predetermined, and further datasets are generated with a higher-order decision tree-based model. The case studies simply and effectively validate the performance of the created tool as the structure of the generated tree, and the determined probabilities reflect the original dataset.

Suggested Citation

  • János Abonyi & Richárd Károly & Gyula Dörgö & Gonzalo Farias, 2021. "Event-Tree Based Sequence Mining Using LSTM Deep-Learning Model," Complexity, Hindawi, vol. 2021, pages 1-24, August.
  • Handle: RePEc:hin:complx:7887159
    DOI: 10.1155/2021/7887159
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/7887159.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/7887159.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/7887159?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
    ---><---

    More about this item

    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:hin:complx:7887159. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.