D
- public abstract class AbstractGraphEditDistanceSimilarityAlgorithm<D extends org.processmining.models.graphbased.directed.DirectedGraph<? extends org.processmining.models.graphbased.directed.DirectedGraphNode,? extends org.processmining.models.graphbased.directed.DirectedGraphEdge<?,?>>> extends java.lang.Object implements GraphEditDistanceSimilarityAlgorithm<D>
DirectedGraph
class. Note that I am not a fan
of the "tidiness" of this code, yet I do not have time to make it a little
more tidy.Modifier and Type | Class and Description |
---|---|
class |
AbstractGraphEditDistanceSimilarityAlgorithm.Mapping |
Modifier and Type | Field and Description |
---|---|
static org.processmining.models.graphbased.directed.DirectedGraphNode |
EPSILON |
protected D |
graph1 |
protected D |
graph2 |
protected GraphEditDistanceSimilarityParameters |
params |
protected int |
totalNrEdges |
protected int |
totalNrVertices |
static double |
VERTEX_DELETION_COST |
static double |
VERTEX_INSERTION_COST |
Constructor and Description |
---|
AbstractGraphEditDistanceSimilarityAlgorithm(GraphEditDistanceSimilarityParameters params) |
Modifier and Type | Method and Description |
---|---|
protected double |
computeScore(double skippedEdges,
double skippedVertices,
double substitutedVertices,
double nrSubstitutions,
double insertedVertices,
double deletedVertices) |
protected double |
editDistance(AbstractGraphEditDistanceSimilarityAlgorithm.Mapping m) |
protected double |
editDistance(java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> m) |
GraphEditDistanceSimilarityParameters |
getParameters() |
protected void |
init(D g1,
D g2) |
void |
setParameters(GraphEditDistanceSimilarityParameters params) |
boolean |
useEvents() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
compute
public static final org.processmining.models.graphbased.directed.DirectedGraphNode EPSILON
public static final double VERTEX_INSERTION_COST
public static final double VERTEX_DELETION_COST
protected D extends org.processmining.models.graphbased.directed.DirectedGraph<? extends org.processmining.models.graphbased.directed.DirectedGraphNode,? extends org.processmining.models.graphbased.directed.DirectedGraphEdge<?,?>> graph1
protected D extends org.processmining.models.graphbased.directed.DirectedGraph<? extends org.processmining.models.graphbased.directed.DirectedGraphNode,? extends org.processmining.models.graphbased.directed.DirectedGraphEdge<?,?>> graph2
protected int totalNrVertices
protected int totalNrEdges
protected GraphEditDistanceSimilarityParameters params
public AbstractGraphEditDistanceSimilarityAlgorithm(GraphEditDistanceSimilarityParameters params)
public GraphEditDistanceSimilarityParameters getParameters()
getParameters
in interface GraphEditDistanceSimilarityAlgorithm<D extends org.processmining.models.graphbased.directed.DirectedGraph<? extends org.processmining.models.graphbased.directed.DirectedGraphNode,? extends org.processmining.models.graphbased.directed.DirectedGraphEdge<?,?>>>
public void setParameters(GraphEditDistanceSimilarityParameters params)
setParameters
in interface GraphEditDistanceSimilarityAlgorithm<D extends org.processmining.models.graphbased.directed.DirectedGraph<? extends org.processmining.models.graphbased.directed.DirectedGraphNode,? extends org.processmining.models.graphbased.directed.DirectedGraphEdge<?,?>>>
public boolean useEvents()
protected double computeScore(double skippedEdges, double skippedVertices, double substitutedVertices, double nrSubstitutions, double insertedVertices, double deletedVertices)
protected double editDistance(AbstractGraphEditDistanceSimilarityAlgorithm.Mapping m)
protected double editDistance(java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> m)