Rule Mining with RuM

Anti Alman, Claudio Di Ciccio, Dominik Haas, Fabrizio Maria Maggi, Alexander Nolte

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Declarative process modeling languages are especially suitable to model loosely-structured, unpredictable business processes. One of the most prominent of these languages is Declare. The Declare language can be used for all process mining branches and a plethora of techniques have been implemented to support process mining with Declare. However, using these techniques can become cumbersome in practical situations where different techniques need to be combined for analysis. In addition, the use of Declare constraints in practice is often hampered by the difficulty of modeling them: the formal expression of Declare is difficult to understand for users without a background in temporal logic, whereas its graphical notation has been shown to be unintuitive. In this paper, we present RuM, a novel application for rule mining that addresses the above-mentioned issues by integrating multiple Declare-based process mining methods into a single unified application. The process mining techniques provided in RuM strongly rely on the use of Declare models expressed in natural language, which has the potential of mitigating the barriers of the language bias. The application has been evaluated by conducting a qualitative user evaluation with eight process analysts.
Original languageEnglish
Title of host publication2nd International Conference on Process Mining, ICPM 2020, Padua, Italy, October 4-9, 2020
EditorsBoudewijn F. van Dongen, Marco Montali, Moe Thandar Wynn
PublisherIEEE
Pages121-128
Number of pages8
ISBN (Print)978-1-7281-9832-3
DOIs
Publication statusPublished - Oct 2020

Keywords

  • Rule Mining
  • Process Analytics Tool
  • Declarative Process Specifications
  • Natural Language Processing

Fingerprint

Dive into the research topics of 'Rule Mining with RuM'. Together they form a unique fingerprint.

Cite this