Overcoming individual process model matcher weaknesses using ensemble matching
作者:
Highlights:
• We address the problem of selecting the best matcher for an unknown problem.
• We propose an ensemble matching approach based on Markov Logic.
• It adapts the voting mechanism and combines it with two novel constraints.
• It selects the best correspondences from the output of several matchers.
• Experiments show that our approach outperforms alternative approaches.
摘要
In recent years, a considerable number of process model matching techniques have been proposed. The goal of these techniques is to identify correspondences between the activities of two process models. However, the results from the Process Model Matching Contest 2015 reveal that there is still no universally applicable matching technique and that each technique has particular strengths and weaknesses. It is hard or even impossible to choose the best technique for a given matching problem. We propose to cope with this problem by running an ensemble of matching techniques and automatically selecting a subset of the generated correspondences. To this end, we propose a Markov Logic based optimization approach that automatically selects the best correspondences. The approach builds on an adaption of a voting technique from the domain of schema matching and combines it with process model specific constraints. Our experiments show that our approach is capable of generating results that are significantly better than alternative approaches.
论文关键词:Process model matching,Matching quality,Ensemble matching,Markov Logic
论文评审过程:Received 21 June 2016, Revised 20 December 2016, Accepted 24 February 2017, Available online 2 March 2017, Version of Record 24 July 2017.
论文官网地址:https://doi.org/10.1016/j.dss.2017.02.013