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

Class GraphEditDistanceSimilarityAStar<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.GraphEditDistanceSimilarityAStar<D>

Type Parameters:

D -

All Implemented Interfaces:

GraphEditDistanceSimilarityAlgorithm<D>

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

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

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 and Description
GraphEditDistanceSimilarityAStar(GraphEditDistanceSimilarityParameters params)

Method Summary

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.
void	setPartitions(java.util.Set<org.processmining.models.graphbased.directed.DirectedGraphNode> functions1, java.util.Set<org.processmining.models.graphbased.directed.DirectedGraphNode> functions2)

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

GraphEditDistanceSimilarityAStar

public GraphEditDistanceSimilarityAStar(GraphEditDistanceSimilarityParameters params)

Method Detail

compute

public double compute(D sg1,
                      D sg2)

Description copied from interface: GraphEditDistanceSimilarityAlgorithm

Given two graphs, returns a value by which graphs can be sorted for relevance, lowest value first. E.g. the value can be: - an edit distance (lower edit distance means better match between graphs) - 1.0 - similarity score (lower value means higher similarity score, means better match between graphs)

Parameters:

sg1 - A graph.

sg2 - A graph.

Returns:

A value, where a lower value represents a more relevant match between graphs.

bestMapping

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

setPartitions

public void setPartitions(java.util.Set<org.processmining.models.graphbased.directed.DirectedGraphNode> functions1,
                          java.util.Set<org.processmining.models.graphbased.directed.DirectedGraphNode> functions2)