Package org.processmining.petrinets.analysis.gedsim.algorithms.impl

Class GraphEditDistanceSimilarityProcessHeuristic<D extends org.processmining.models.graphbased.directed.DirectedGraph<?,?>>

java.lang.Object

org.processmining.petrinets.analysis.gedsim.algorithms.abstr.AbstractGraphEditDistanceSimilarityAlgorithm<D>

org.processmining.petrinets.analysis.gedsim.algorithms.impl.GraphEditDistanceSimilarityProcessHeuristic<D>

Type Parameters:

D -

All Implemented Interfaces:

GraphEditDistanceSimilarityAlgorithm<D>

public class GraphEditDistanceSimilarityProcessHeuristic<D extends org.processmining.models.graphbased.directed.DirectedGraph<?,?>>
extends AbstractGraphEditDistanceSimilarityAlgorithm<D>

Adopted from ProM5 class org.processmining.analysis.graphmatching.algos. GraphEditDistanceProcessHeuristic

Nested Class Summary

Nested classes/interfaces inherited from class org.processmining.petrinets.analysis.gedsim.algorithms.abstr.AbstractGraphEditDistanceSimilarityAlgorithm

AbstractGraphEditDistanceSimilarityAlgorithm.Mapping

Field Summary

Fields inherited from class org.processmining.petrinets.analysis.gedsim.algorithms.abstr.AbstractGraphEditDistanceSimilarityAlgorithm

EPSILON, graph1, graph2, params, totalNrEdges, totalNrVertices, VERTEX_DELETION_COST, VERTEX_INSERTION_COST

Constructor Summary

Constructors

Constructor	Description
GraphEditDistanceSimilarityProcessHeuristic(GraphEditDistanceSimilarityParameters params)

Method Summary

Modifier and Type	Method	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)	Computes the edit distance between the two SimpleGraph instances with which the object was instantiated.

Methods inherited from class org.processmining.petrinets.analysis.gedsim.algorithms.abstr.AbstractGraphEditDistanceSimilarityAlgorithm

computeScore, editDistance, editDistance, getParameters, init, setParameters, useEvents

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GraphEditDistanceSimilarityProcessHeuristic

public GraphEditDistanceSimilarityProcessHeuristic(GraphEditDistanceSimilarityParameters params)

Method Detail

compute

public double compute(D sg1,
                      D sg2)

Computes the edit distance between the two SimpleGraph instances with which the object was instantiated. Precondition: the algorithm only returns a useful edit distance if the graphs both have at least one 'source node' (a node with no incoming arcs.) Otherwise, Double.MAX_VALUE is returned.

Parameters:

sg1 - A graph.

sg2 - A graph.

Returns:

edit distance

bestMapping

public java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> bestMapping()