Abstract
The complexity and rigidity of legacy applications in large organizations engender situations where workers need to perform repetitive routines to transfer data from one application to another via their user interfaces, e.g. moving data from a spreadsheet to a Web application or vice-versa. Discovering and automating such routines can help to eliminate tedious work, reduce cycle times, and improve data quality. Advances in Robotic Process Automation (RPA) technology make it possible to automate such routines, but not to discover them in the first place. This paper presents a method to analyse user interactions in order to discover routines that are fully deterministic and thus amenable to automation. The proposed method identifies sequences of actions that are always triggered when a given activation condition holds and such that the parameters of each action can be deterministically derived from data produced by previous actions. To this end, the method combines a technique for compressing a set of sequences into an acyclic automaton, with techniques for rule mining and for discovering data transformations. An initial evaluation shows that the method can discover automatable routines from user interaction logs with acceptable execution times, particularly when there are one-to-one correspondences between parameters of an action and those of previous actions, which is the case of copy-pasting routines.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Available at: https://github.com/apromore/RPA_UILogger.
- 2.
In general, \(\omega \) can be any function.
- 3.
Note that, a single action (a single DAFSA edge) is the simplest candidate automatable routine.
- 4.
Note that \(\hat{V}\) is a list of values and not a set, i.e. it can contain duplicates.
- 5.
We remind that a path of the DAFSA corresponds to a routine trace in the UI log.
- 6.
Note that, the set of rules take into account also the triggering action.
- 7.
The CPNs and the logs used for our evaluation are available at https://doi.org/10.6084/m9.figshare.7850918.v1.
- 8.
The software is available at http://apromore.org/platform/tools, Automatable Routines Discoverer package. The source code can be found at https://github.com/apromore/RPA_AutomatableRoutinesDiscoverer.
References
van der Aalst, W.M.P., Bichler, M., Heinzl, A.: Robotic process automation. Bus. Inf. Syst. Eng. 60, 269 (2018). https://doi.org/10.1007/s12599-018-0542-4
Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE. IEEE (1995)
Augusto, A., et al.: Automated discovery of process models from event logs: review and benchmark. TKDE 31(4), 686–705 (2019)
Cohen, W.W.: Fast effective rule induction. In: ICML. Morgan Kaufmann (1995)
de Leoni, M., Dumas, M., García-Bañuelos, L.: Discovering branching conditions from business process execution logs. In: Cortellessa, V., Varró, D. (eds.) FASE 2013. LNCS, vol. 7793, pp. 114–129. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37057-1_9
Dev, H., Liu, Z.: Identifying frequent user tasks from application logs. In: Proceedings of the 22nd International Conference on Intelligent User Interfaces (IUI 2017), pp. 263–273. ACM, New York (2017). https://doi.org/10.1145/3025171.3025184
Dragunov, A.N., Dietterich, T.G., Johnsrude, K., McLaughlin, M.R., Li, L., Herlocker, J.L.: Tasktracer: a desktop environment to support multi-tasking knowledge workers. In: IUI. ACM (2005)
Fazzinga, B., Flesca, S., Furfaro, F., Pontieri, L.: Process discovery from low-level event logs. In: Krogstie, J., Reijers, H.A. (eds.) CAiSE 2018. LNCS, vol. 10816, pp. 257–273. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91563-0_16
Jensen, K., Kristensen, L.M., Wells, L.: Coloured Petri nets and CPN tools for modelling and validation of concurrent systems. STTT 9(3–4), 213–254 (2007)
Jin, Z., Anderson, M.R., Cafarella, M.J., Jagadish, H.V.: Foofah: transforming data by example. In: SIGMOD. ACM (2017)
Liu, B.: Web usage mining. In: Web Data Mining. Data-Centric Systems and Applications. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-642-19460-3_12
Polyvyanyy, A., Vanhatalo, J., Völzer, H.: Simplified computation and generalization of the refined process structure tree. In: Bravetti, M., Bultan, T. (eds.) WS-FM 2010. LNCS, vol. 6551, pp. 25–41. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19589-1_2
Reißner, D., Conforti, R., Dumas, M., La Rosa, M., Armas-Cervantes, A.: Scalable conformance checking of business processes. In: Panetto, H., et al. (eds.) OTM 2017. LNCS, vol. 10573, pp. 607–627. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69462-7_38
Shen, J., et al.: Detecting and correcting user activity switches: algorithms and interfaces. In: IUI. ACM (2009)
Shen, J., Li, L., Dietterich, T.G.: Real-time detection of task switches of desktop users. In: IJCAI (2007)
Srivastava, J., Cooley, R., Deshpande, M., Tan, P.: Web usage mining: discovery and applications of usage patterns from web data. SIGKDD Explor. Newsl. 1(2), 12–23 (2000)
Acknowledgements
This research is funded by the Australian Research Council (DP180102839), the Estonian Research Council (IUT20-55), and the European Research Council (project “PIX”).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Bosco, A., Augusto, A., Dumas, M., La Rosa, M., Fortino, G. (2019). Discovering Automatable Routines from User Interaction Logs. In: Hildebrandt, T., van Dongen, B., Röglinger, M., Mendling, J. (eds) Business Process Management Forum. BPM 2019. Lecture Notes in Business Information Processing, vol 360. Springer, Cham. https://doi.org/10.1007/978-3-030-26643-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-26643-1_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26642-4
Online ISBN: 978-3-030-26643-1
eBook Packages: Computer ScienceComputer Science (R0)