Novel Parallel Business Process Similarity Methods Based on Weighted-Tree Declarative Pattern Models

Abstract

Existing methods, such as Graph Edit Distance (GED) and Cosine measure, still have drawback in obtaining similarity of parallel relationships by neglecting the control-flow patterns, i.e. AND, OR, and XOR. Since AND > OR > XOR, the similarity value of AND versus OR is greater than XOR versus OR and AND versus XOR. This paper proposes two new similarity methods, Tree Declarative Pattern Edit Distance (TPED) and Cosine-Tree Declarative Pattern (Cosine-TDP). They provides value to the control-flow pattern so the value of similarity can be seen more differently. The new methods utilize tree model of the declarative pattern. The results show that the proposed methods are better at differentiating parallel relationships than the existing methods, GED and Cosine measure. In obtaining AND versus OR, XOR versus OR, and AND versus XOR, TPED obtained 0.821, 0.811, and 0.78 while Consine-TDP obtained 0.834, 0.826, and 0.693. Meanwhile, GED obtained 1 for all parallel relationships whereas Cosine measure obtained 0.02, 0.08, and 0.04.

A New Similarity Method based on Weighted Graph Models for Matching Parallel Business Process Models

“…Result of similarity from the existing methods and proposed method can be fully seen in Table 5. We compare the WGPPM as our proposed method with other existing methods, such as Graphbased Matching Method (GMA) [7], Weighted Graph Edit Distance (WGED) [16], Weighted Node Adjecent Relation Similarity (WNARS) [16], Tree Declarative Pattern Edit Distance (TPED) [17], and Cosine-Tree Declarative Pattern (Cosine-TDP) [17].…”

“…The Weighted Tree Declarative Pattern Matching Approach (WTDPMA) is proposed with two methods of similarity, such as TPED and Cosine-TDP [17]. All of the similarity method is using Weighted-Linear Temporal Logic (W-LTL) as the business process model.…”

“…AND and XOR, and XOR and OR using TPED and Cosine-TDP based on the model that has been created. For more spesifics steps of the method, readers should read the journal reference [17]. Transformation of a business process model into a graph is defined as a graph-based process model, which consists of nodes and edges, where the nodes define the activity and the edges define their relationships, as stated in Definition 1.…”

“…Kelly Rossa Sungkono assisted in formulation of the proposed method and checked the paper. Prof. Riyanarto Sarno Similarity Existing Methods Proposed (WGPPM) GMA [7] WGED [16] WNARS [16] TPED [17] Cosine-TDP [17] AND (Table 3 (a)) and AND ( supervised problem ideas and proposed the novelty contribution of the paper.…”

“…Also, WNARS depends on minimum and maximum value of the weight in the graph which is cannot represent the behavior of the relationship. Furthermore, [17] proposes Tree Declarative Pattern Edit Distance (TPED), Cosine-Tree Declarative Pattern (Cosine-TDP) for identifying AND and OR with AND and XOR. This method uses Linear Temporal Logic (LTL) which has many symbols to use.…”