The automation of sequences of repetitive actions performed by human operators in interacting with software applications is crucial to prevent work from being perceived as alienating and boring. Robot applications can automatise these sequences once they have been identified. In this paper, we propose a two-step approach to mine sequences of actions that could be automated from log data produced by the interactions of a human operator with specific software applications. Since the number of possible sequences may be very high and not all the sequences are interesting to be automatised, we focus our mining process on sequences that meet precise patterns. First, Frequent Episode Mining algorithms are applied for extracting all the sequences of actions that occur with at least a minimum frequency. Then, we exploit fuzzy string matching based on the Levenshtein distance for filtering out the sequences that do not match established patterns. We evaluate the effectiveness of the approach using a benchmark dataset and present a case study on a real-world dataset of activity logs generated in the context of the AUTOMIA project.

Leveraging Sequence Mining for Robot Process Automation

Pietro Dell'Oglio;Alessandro Bondielli;Alessio Bechini;Francesco Marcelloni
2023-01-01

Abstract

The automation of sequences of repetitive actions performed by human operators in interacting with software applications is crucial to prevent work from being perceived as alienating and boring. Robot applications can automatise these sequences once they have been identified. In this paper, we propose a two-step approach to mine sequences of actions that could be automated from log data produced by the interactions of a human operator with specific software applications. Since the number of possible sequences may be very high and not all the sequences are interesting to be automatised, we focus our mining process on sequences that meet precise patterns. First, Frequent Episode Mining algorithms are applied for extracting all the sequences of actions that occur with at least a minimum frequency. Then, we exploit fuzzy string matching based on the Levenshtein distance for filtering out the sequences that do not match established patterns. We evaluate the effectiveness of the approach using a benchmark dataset and present a case study on a real-world dataset of activity logs generated in the context of the AUTOMIA project.
2023
978-3-031-35510-3
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/1184107
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact