Identifying Candidate Routines for Robotic Process Automation from Unsegmented UI Logs

Volodymyr Leno, Adriano Augusto, M. Dumas, M. Rosa, F. Maggi, Artem Polyvyanyy
{"title":"Identifying Candidate Routines for Robotic Process Automation from Unsegmented UI Logs","authors":"Volodymyr Leno, Adriano Augusto, M. Dumas, M. Rosa, F. Maggi, Artem Polyvyanyy","doi":"10.1109/ICPM49681.2020.00031","DOIUrl":null,"url":null,"abstract":"Robotic Process Automation (RPA) is a technology to develop software bots that automate repetitive sequences of interactions between users and software applications (a.k. a. routines). To take full advantage of this technology, organizations need to identify and to scope their routines. This is a challenging endeavor in large organizations, as routines are usually not concentrated in a handful of processes, but rather scattered across the process landscape. Accordingly, the identification of routines from User Interaction (UI) logs has received significant attention. Existing approaches to this problem assume that the UI log is segmented, meaning that it consists of traces of a task that is presupposed to contain one or more routines. However, a UI log usually takes the form of a single unsegmented sequence of events. This paper presents an approach to discover candidate routines from unsegmented UI logs in the presence of noise, i.e. events within or between routine instances that do not belong to any routine. The approach is implemented as an open-source tool and evaluated using synthetic and real-life UI logs.","PeriodicalId":223427,"journal":{"name":"2020 2nd International Conference on Process Mining (ICPM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Process Mining (ICPM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPM49681.2020.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

Robotic Process Automation (RPA) is a technology to develop software bots that automate repetitive sequences of interactions between users and software applications (a.k. a. routines). To take full advantage of this technology, organizations need to identify and to scope their routines. This is a challenging endeavor in large organizations, as routines are usually not concentrated in a handful of processes, but rather scattered across the process landscape. Accordingly, the identification of routines from User Interaction (UI) logs has received significant attention. Existing approaches to this problem assume that the UI log is segmented, meaning that it consists of traces of a task that is presupposed to contain one or more routines. However, a UI log usually takes the form of a single unsegmented sequence of events. This paper presents an approach to discover candidate routines from unsegmented UI logs in the presence of noise, i.e. events within or between routine instances that do not belong to any routine. The approach is implemented as an open-source tool and evaluated using synthetic and real-life UI logs.
从未分段的UI日志中识别机器人过程自动化的候选例程
机器人过程自动化(RPA)是一种开发软件机器人的技术,它可以自动执行用户和软件应用程序之间的重复交互序列(也称为例程)。为了充分利用这项技术,组织需要确定并确定他们的例程。在大型组织中,这是一项具有挑战性的工作,因为例程通常不集中在少数过程中,而是分散在整个过程环境中。因此,从用户交互(UI)日志中识别例程受到了极大的关注。解决这个问题的现有方法假设UI日志是分段的,这意味着它由一个任务的跟踪组成,该任务假定包含一个或多个例程。然而,UI日志通常采用单个未分段的事件序列的形式。本文提出了一种从存在噪声的未分段UI日志中发现候选例程的方法,即不属于任何例程的例程实例内部或之间的事件。该方法是作为开源工具实现的,并使用合成的和真实的UI日志进行评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书