public class GraphEditDistanceSimilarityGreedy<D extends org.processmining.models.graphbased.directed.DirectedGraph<? extends org.processmining.models.graphbased.directed.DirectedGraphNode,? extends org.processmining.models.graphbased.directed.DirectedGraphEdge<?,?>>> extends AbstractGraphEditDistanceSimilarityAlgorithm<D>
AbstractGraphEditDistanceSimilarityAlgorithm.Mapping
EPSILON, graph1, graph2, params, totalNrEdges, totalNrVertices, VERTEX_DELETION_COST, VERTEX_INSERTION_COST
Constructor and Description |
---|
GraphEditDistanceSimilarityGreedy(GraphEditDistanceSimilarityParameters params) |
Modifier and Type | Method and Description |
---|---|
java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> |
bestMapping() |
double |
compute(D sg1,
D sg2)
Given two graphs, returns a value by which graphs can be sorted for relevance,
lowest value first.
|
protected double |
groupedEditDistance(java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> m) |
computeScore, editDistance, editDistance, getParameters, init, setParameters, useEvents
public GraphEditDistanceSimilarityGreedy(GraphEditDistanceSimilarityParameters params)
public double compute(D sg1, D sg2)
GraphEditDistanceSimilarityAlgorithm
sg1
- A graph.sg2
- A graph.public java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> bestMapping()
protected double groupedEditDistance(java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> m)