public interface GraphEditDistanceSimilarityAlgorithm<D extends org.processmining.models.graphbased.directed.DirectedGraph<?,?>>
LevenshteinSimilarity
.
Similarity of models M1, M2 with activities A1, A2 and edges E1, E2 is then
calculated based on the set of substituted nodes subn, inserted/deleted nodes
skipn, and inserted/deleted edges skipe as follows: fskipn = |skipn|/(|A1| +
|A2|), fskipe = |skipe|/(|E1| + |E2|), fsubn = 2 * sum(1 - sim(a1,a2))
sim(M1, M2) = (wskipn*fskipn + wskipe*fskipe + wsubn*fsubn) / (wskipn +
wskipe + wsubn)
B. Hompes: This plug-in was copied from the ProM v5 plug-in, and modified to
support Petrinets that have non-unique place labels.Modifier and Type | Method and Description |
---|---|
double |
compute(D sg1,
D sg2)
Given two graphs, returns a value by which graphs can be sorted for relevance,
lowest value first.
|
GraphEditDistanceSimilarityParameters |
getParameters() |
void |
setParameters(GraphEditDistanceSimilarityParameters params) |
GraphEditDistanceSimilarityParameters getParameters()
void setParameters(GraphEditDistanceSimilarityParameters params)
double compute(D sg1, D sg2)
sg1
- A graph.sg2
- A graph.