Extracting useful knowledge from event logs: A frequent itemset mining approach
作者:
Highlights:
•
摘要
Business process analysis is a key activity that aims at increasing the efficiency of business operations. In recent years, several data mining based methods have been designed for discovering interesting patterns in event logs. A popular type of methods consists of applying frequent itemset mining to extract patterns indicating how resources and activities are frequently used. Although these methods are useful, they have two important limitations. First, these methods are designed to be applied to original event logs. Because these methods do not consider other perspectives on the data that could be obtained by applying data transformations, many patterns are missed that may represent important information for businesses. Second, these methods can generate a large number of patterns since they only consider the minimum support as constraint to select patterns. But analyzing a large number of patterns is time-consuming for users, and many irrelevant patterns may be found. To address these issues, this paper presents an improved event log analysis approach named AllMining. It includes a novel pre-processing method to construct multiple types of transaction databases from a same original event log using transformations. This allows to extract many new useful types of patterns from event logs with frequent itemset mining techniques. To address the second issue, a pruning strategy is further developed based on a novel concept of pattern coverage, to present a small set of patterns that covers many events to decision makers. Results of experiments on real-life event logs show that the proposed approach is promising compared to existing frequent itemset mining approaches and state-of-the-art process model algorithms.
论文关键词:Pattern mining,Process mining,Event logs,Business process analysis
论文评审过程:Received 13 May 2017, Revised 12 October 2017, Accepted 14 October 2017, Available online 20 October 2017, Version of Record 13 November 2017.
论文官网地址:https://doi.org/10.1016/j.knosys.2017.10.016