arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1610.02876cs.LGcs.AIcs.DB
收藏

利用对数投影生成局部过程模型的启发式方法

Heuristic Approaches for Generating Local Process Models through Log Projections

Eindhoven University of Technology(埃因霍温理工大学);Philips Research(飞利浦研究院)

Niek Tax, Natalia Sidorova, Wil M. P. van der Aalst, Reinder Haakma

摘要:

局部过程模型(LPM)发现集中于挖掘一组过程模型,其中每个模型仅部分地描述事件日志中表示的行为,即考虑可能事件的子集以创建所谓的局部过程模型。通常,这种较小的模型提供了对过程行为的有价值的洞察,特别是当不存在能够描述过程从开始到结束的轨迹的适当且可理解的单个整体过程模型时。然而,LPM发现的实际应用在具有许多活动的日志的情况下受到计算问题的阻碍(当存在多于17个独特活动时,问题可能已经发生)。在本文中,我们探讨了三种算法来发现导致有用的日志预测的活动子集,其目标是大大加快LPM发现的速度,同时仍然找到高质量的LPM。我们发现,马尔可夫聚类方法来创建投影集的结果在执行时间的最大改善,与发现的LPM仍然优于使用随机生成的活动集相同的大小。另一种基于对数熵的启发式算法产生了更适度的加速比,但能够发现更高质量的LPM。基于相对信息增益的第三种启发式算法表现出不稳定的性能:对于某些数据集,加速比和LPM质量高于基于对数熵的方法,而对于其他数据集,根本没有加速比。

英文摘要:

Local Process Model (LPM) discovery is focused on the mining of a set of process models where each model describes the behavior represented in the event log only partially, i.e. subsets of possible events are taken into account to create so-called local process models. Often such smaller models provide valuable insights into the behavior of the process, especially when no adequate and comprehensible single overall process model exists that is able to describe the traces of the process from start to end. The practical application of LPM discovery is however hindered by computational issues in the case of logs with many activities (problems may already occur when there are more than 17 unique activities). In this paper, we explore three heuristics to discover subsets of activities that lead to useful log projections with the goal of speeding up LPM discovery considerably while still finding high-quality LPMs. We found that a Markov clustering approach to create projection sets results in the largest improvement of execution time, with discovered LPMs still being better than with the use of randomly generated activity sets of the same size. Another heuristic, based on log entropy, yields a more moderate speedup, but enables the discovery of higher quality LPMs. The third heuristic, based on the relative information gain, shows unstable performance: for some data sets the speedup and LPM quality are higher than with the log entropy based method, while for other data sets there is no speedup at all.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑