Structural Feature Selection for Event Logs
Markku Hinkka, Teemu Lehto, Keijo Heljanko, Alexander Jung

TL;DR
This paper explores structural feature selection from event logs to improve machine learning classification of business process instances, balancing accuracy and response time for root cause analysis.
Contribution
It proposes and compares six feature selection algorithms for structural features, enhancing classification efficiency without significantly sacrificing accuracy.
Findings
Structural features improve classification accuracy.
Feature selection reduces response time.
Trade-offs exist between feature set size and accuracy.
Abstract
We consider the problem of classifying business process instances based on structural features derived from event logs. The main motivation is to provide machine learning based techniques with quick response times for interactive computer assisted root cause analysis. In particular, we create structural features from process mining such as activity and transition occurrence counts, and ordering of activities to be evaluated as potential features for classification. We show that adding such structural features increases the amount of information thus potentially increasing classification accuracy. However, there is an inherent trade-off as using too many features leads to too long run-times for machine learning classification models. One way to improve the machine learning algorithms' run-time is to only select a small number of features by a feature selection algorithm. However, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
