Modifier and Type | Method and Description |
---|---|
NAryTree |
TreeDelegate.getTree() |
Modifier and Type | Method and Description |
---|---|
java.util.Set<NAryTree> |
ETM.getAllBestResults()
Since it could be that the population contains multiple trees with the
same 'best' fitness value, this method returns all those trees.
|
ETMLiveListener.ListernerList<NAryTree> |
ETM.getListenerList() |
ETMParamAbstract<NAryTree> |
ETM.getParams() |
java.util.List<NAryTree> |
CentralRegistry.getSortedOn(boolean fittestFirst,
TreeFitnessInfo... dimensions)
Returns all trees sorted according to the provided dimensions
|
Modifier and Type | Method and Description |
---|---|
boolean |
CentralRegistry.containsFitness(NAryTree tree)
Function that checks whether there is already a fitness object for this
tree in the cache.
|
TreeFitness |
CentralRegistry.getFitness(NAryTree tree) |
NAryTreeHistory |
CentralRegistry.getHistory(NAryTree child)
Retrieves the parent of the input child.
|
double |
CentralRegistry.getOverallFitness(NAryTree tree) |
boolean |
CentralRegistry.isFitnessKnown(NAryTree tree)
Function that checks whether a fitness is known AND PROPERLY SET for this
tree.
|
void |
CentralRegistry.restartFitness(NAryTree tree) |
void |
CentralRegistry.saveHistory(NAryTree child,
NAryTree parent,
int pointOfChange,
NAryTreeHistory.TypesOfChange typeOfChange)
Function to save the ancestry of each new tree.
|
Modifier and Type | Method and Description |
---|---|
static void |
ETMAbstract.reEvaluateSeed(java.util.List<NAryTree> seed,
TreeFitnessAbstract evaluator)
Re-evaluate the list of trees using the provided evaluator to make sure
that we use the same dimensions, metrics, weights, etc.
|
Modifier and Type | Method and Description |
---|---|
NAryTree |
LoggingEvolutionEngine.evolve() |
Modifier and Type | Method and Description |
---|---|
protected java.util.List<EvaluatedCandidate<NAryTree>> |
LoggingEvolutionEngine.evaluatePopulation(java.util.List<NAryTree> population) |
java.util.List<EvaluatedCandidate<NAryTree>> |
LoggingEvolutionEngine.evolvePopulation() |
java.util.List<EvaluatedCandidate<NAryTree>> |
ParetoEngine.evolvePopulation(int populationSize,
int eliteCount,
java.util.Collection<NAryTree> seedCandidates,
TerminationCondition... conditions)
Execute the evolutionary algorithm until one of the termination conditions is met,
then return all of the candidates from the final generation.
|
protected java.util.List<EvaluatedCandidate<NAryTree>> |
ParetoEngine.nextEvolutionStep(java.util.List<EvaluatedCandidate<NAryTree>> evaluatedPopulation,
int eliteCount,
java.util.Random rng) |
protected java.util.List<EvaluatedCandidate<NAryTree>> |
TreeEvolutionEngine.nextEvolutionStep(java.util.List<EvaluatedCandidate<NAryTree>> evaluatedPopulation,
int eliteCount,
java.util.Random rng)
This method performs a single step/iteration of the evolutionary process.
|
Modifier and Type | Method and Description |
---|---|
protected java.util.List<EvaluatedCandidate<NAryTree>> |
LoggingEvolutionEngine.evaluatePopulation(java.util.List<NAryTree> population) |
java.util.List<EvaluatedCandidate<NAryTree>> |
ParetoEngine.evolvePopulation(int populationSize,
int eliteCount,
java.util.Collection<NAryTree> seedCandidates,
TerminationCondition... conditions)
Execute the evolutionary algorithm until one of the termination conditions is met,
then return all of the candidates from the final generation.
|
void |
LoggingEvolutionEngine.logPopulation(java.util.List<EvaluatedCandidate<NAryTree>> result) |
abstract java.lang.String |
LoggingEvolutionEngine.logResult(java.util.List<EvaluatedCandidate<NAryTree>> result)
Write the current result to a file, should be implemented by each
specific engine
|
java.lang.String |
ParetoEngine.logResult(java.util.List<EvaluatedCandidate<NAryTree>> result) |
java.lang.String |
TreeEvolutionEngine.logResult(java.util.List<EvaluatedCandidate<NAryTree>> result)
Builds a string that described the whole provided result such that it can
be logged
|
protected java.util.List<EvaluatedCandidate<NAryTree>> |
ParetoEngine.nextEvolutionStep(java.util.List<EvaluatedCandidate<NAryTree>> evaluatedPopulation,
int eliteCount,
java.util.Random rng) |
protected java.util.List<EvaluatedCandidate<NAryTree>> |
TreeEvolutionEngine.nextEvolutionStep(java.util.List<EvaluatedCandidate<NAryTree>> evaluatedPopulation,
int eliteCount,
java.util.Random rng)
This method performs a single step/iteration of the evolutionary process.
|
Modifier and Type | Method and Description |
---|---|
static java.lang.String |
PaperMethods.naryTreeToLatex(NAryTree inputTree,
org.deckfour.xes.classification.XEventClasses eventClasses) |
static java.lang.String |
PaperMethods.naryTreeToLatex(NAryTree inputTree,
org.deckfour.xes.classification.XEventClasses eventClasses,
CentralRegistry registry) |
static java.lang.String |
PaperMethods.nodeToLatexForest(NAryTree tree,
int node,
org.deckfour.xes.classification.XEventClasses classes) |
static void |
CommandLineInterface.outputTree(java.lang.String outputDir,
java.lang.String key,
NAryTree tree,
CentralRegistry centralRegistry)
Outputs the NAryTree to the outputDir (e.g.
|
Modifier and Type | Method and Description |
---|---|
static NAryTree[] |
BPM2013PaperMethods.getBPM13RunningExampleTreeVariants(org.deckfour.xes.classification.XEventClasses eventclasses) |
static NAryTree |
BPMsmallFunctions.perfectTree(org.deckfour.xes.info.XLogInfo mergedLogInfo) |
Modifier and Type | Method and Description |
---|---|
static void |
BPMsmallFunctions.evaluateTree(org.deckfour.xes.model.XLog[] logs,
org.deckfour.xes.info.XLogInfo mergedLogInfo,
NAryTree perfectTree) |
Modifier and Type | Method and Description |
---|---|
static NAryTree |
ThesisExperimentProcessor.getTreeWithBestOf(ParetoFront pf,
java.util.HashMap<TreeFitnessInfo,java.lang.Double> weights)
Returns the tree with the best overall fitness, using the given weights
|
Modifier and Type | Method and Description |
---|---|
static ConfigurationFitness |
ThesisExperimentProcessor.getConfigurationFitness(NAryTree tree,
CentralRegistryConfigurable registry,
java.util.HashMap<TreeFitnessInfo,java.lang.Double> weights) |
Modifier and Type | Method and Description |
---|---|
static NAryTree |
InductiveMinerWrapper.callInductiveTreeMiner(CentralRegistry registry,
org.processmining.plugins.InductiveMiner.mining.logs.IMLog filteredLog)
Calls the inductive tree miner with random parameters (but never using
SAT)
|
static NAryTree |
TreeFactoryFlower.createFlower(CentralRegistry registry) |
static NAryTree |
TreeFactoryXORofSEQ.createXORofSEQ(CentralRegistry registry) |
static NAryTree |
TreeFactoryXORofSEQ.createXORofSEQ(CentralRegistry registry,
double fraction) |
static NAryTree |
TreeFactoryCoordinator.generateRandomCandidate(CentralRegistry registry)
Static function that randomly selects a method to generate a process
model and returns the result
|
NAryTree |
InductiveMinerWrapper.generateRandomCandidate(java.util.Random rng) |
NAryTree |
TreeFactoryCoordinator.generateRandomCandidate(java.util.Random rng)
Generates a random candidate by choosing a factory at random (including
ourselves with weight 1).
|
NAryTree |
TreeFactoryFlower.generateRandomCandidate(java.util.Random rng) |
NAryTree |
TreeFactoryXORofSEQ.generateRandomCandidate(java.util.Random rng) |
static NAryTree |
TreeFactoryCoordinator.randomTree(CentralRegistry registry)
Returns a random tree
|
Modifier and Type | Method and Description |
---|---|
java.util.Map<NAryTree,TreeRecord> |
AlignmentInfo.getAlignmentCache() |
Modifier and Type | Method and Description |
---|---|
int |
TreeComparatorByFitness.compare(NAryTree tree1,
NAryTree tree2) |
void |
AlignmentInfo.put(NAryTree candidate,
TreeRecord lastRecord) |
Constructor and Description |
---|
AlignmentInfo(java.util.Map<NAryTree,TreeRecord> alignmentCache,
AStarAlgorithm algorithm) |
Modifier and Type | Method and Description |
---|---|
protected static int |
SimplicityOperatorAlternation.calculateSimplicityOperatorAlternation(NAryTree tree)
Returns the total number of operator type alternations, needs to be
normalized!
|
double |
ConfigurationFitness.countAllConfigSettings(NAryTree tree) |
static double |
ConfigurationFitness.countConfiguredColums(NAryTree tree,
boolean absoluteCount) |
protected static int |
PrecisionFlowerSize.countFlowerSize(NAryTree tree,
boolean inLoop,
int node)
For precision, loops are a bad idea, so, we punish for them...
|
static double |
ConfigurationFitness.countUselessConfigSettings(NAryTree tree) |
double |
ConfigurationFitness.getConfigFitness(NAryTree tree) |
static double |
PrecisionOperatorCosts.getCost(NAryTree candidate,
int index) |
double |
ConfigurationFitness.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
EditDistanceWrapperPQGram.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
EditDistanceWrapperRTEDAbsolute.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
EditDistanceWrapperRTEDRelative.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
FitnessReplay.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population)
Calculates a fitness score for the given candidate.
|
double |
FitnessReplayConfidenceLevelsWrapper.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
Generalization.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
GeneralizationByFitnessReplayDeviation.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
GeneralizationRinooyKan.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
MultiThreadedFitnessEvaluator.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
NewMetric.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
OverallFitness.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
ParetoFitnessEvaluator.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionEscEdges.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionEscEdgesImproved.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionFlowerSize.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionOperatorCosts.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionPerNode.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityDuplMissingAct.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityMaxTreeSize.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityMixed.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityOperatorAlternation.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityTreeSize.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityUselessNodes.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
ParetoFitnessEvaluator.getRelativeDistance(NAryTree tree)
Returns the relative distance of the given tree to that of its neighbours
in the Pareto front.
|
static double |
ParetoFitnessEvaluator.getRelativeDistance(ParetoFront paretoFront,
NAryTree tree)
Returns the relative distance of the given tree to that of its neighbours
in the Pareto front.
|
static boolean |
SimplicityUselessNodes.isUselessNode(NAryTree tree,
int n)
Tests if the given node in the tree is a useless node.
|
static int[] |
FitnessReplay.modelCosts(NAryTree tree) |
protected static double |
SimplicityMixed.nrDuplicateActivities(NAryTree tree) |
protected static double |
SimplicityMixed.nrDuplicateActivities(NAryTree tree,
boolean ignoreTaus) |
NAryTreeReplayer<?,?,?> |
FitnessReplay.setupReplayer(NAryTree candidate,
AStarAlgorithm algorithm,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelMove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] modelCosts,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments) |
tree.LblTree |
EditDistanceWrapperPQGram.toLblTree(NAryTree tree) |
util.LblTree |
EditDistanceWrapperRTEDAbsolute.toLblTree(NAryTree tree) |
tree.LblTree |
EditDistanceWrapperPQGram.toLblTree(NAryTree tree,
int n) |
util.LblTree |
EditDistanceWrapperRTEDAbsolute.toLblTree(NAryTree tree,
int n) |
static double |
SimplicityUselessNodes.uselessNodesRatio(NAryTree tree) |
Modifier and Type | Method and Description |
---|---|
double |
ConfigurationFitness.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
EditDistanceWrapperPQGram.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
EditDistanceWrapperRTEDAbsolute.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
EditDistanceWrapperRTEDRelative.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
FitnessReplay.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population)
Calculates a fitness score for the given candidate.
|
double |
FitnessReplayConfidenceLevelsWrapper.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
Generalization.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
GeneralizationByFitnessReplayDeviation.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
GeneralizationRinooyKan.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
MultiThreadedFitnessEvaluator.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
NewMetric.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
OverallFitness.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
ParetoFitnessEvaluator.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionEscEdges.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionEscEdgesImproved.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionFlowerSize.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionOperatorCosts.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
PrecisionPerNode.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityDuplMissingAct.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityMaxTreeSize.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityMixed.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityOperatorAlternation.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityTreeSize.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
double |
SimplicityUselessNodes.getFitness(NAryTree candidate,
java.util.List<? extends NAryTree> population) |
Constructor and Description |
---|
EditDistanceWrapperRTEDAbsolute(NAryTree baseTree) |
EditDistanceWrapperRTEDAbsolute(NAryTree[] base) |
EditDistanceWrapperRTEDRelative(NAryTree baseTree) |
EditDistanceWrapperRTEDRelative(NAryTree[] base) |
Constructor and Description |
---|
EditDistanceWrapperRTEDAbsolute(java.util.Collection<NAryTree> base)
Instantiate the edit distance metric with the given set of base trees
|
EditDistanceWrapperRTEDRelative(java.util.Collection<NAryTree> base)
Instantiate the edit distance metric with the given set of base trees
|
Modifier and Type | Method and Description |
---|---|
void |
StatisticsLogger.populationUpdate(PopulationData<? extends NAryTree> data) |
Modifier and Type | Method and Description |
---|---|
NAryTree |
ParetoFront.getBest(TreeFitnessInfo dimension)
Returns the best tree in the given dimension
|
NAryTree |
ParetoFront.getBetter(TreeFitnessInfo dimension,
NAryTree tree)
Returns the tree next to the given tree which is slightly better in the
given dimension
|
NAryTree |
ParetoFront.getWorse(TreeFitnessInfo dimension,
NAryTree tree)
Returns the tree next to the given tree which is slightly worse in the
given dimension
|
NAryTree |
ParetoFront.getWorst(TreeFitnessInfo dimension)
Returns the worst tree in the given dimension
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<NAryTree> |
ParetoFront.getFront()
Return the complete Pareto front
|
java.util.Set<NAryTree> |
ParetoFront.getTreeWithValues(java.util.HashMap<TreeFitnessInfo,java.lang.Double> values)
Returns all trees currently in the Pareto Front with the specified values
for the dimensions (e.g.
|
Modifier and Type | Method and Description |
---|---|
double |
ParetoFront.compareOnDimension(NAryTree t1,
NAryTree t2,
TreeFitnessInfo dimension)
Returns the difference between the two trees in the given dimension,
taken into account whether bigger is better or worse.
|
boolean |
ParetoFront.consider(NAryTree t)
Consider adding the provided tree to the Pareto front.
|
int |
ParetoFront.countDominatorsOf(NAryTree t)
Returns the number of trees in the current Pareto front that dominate the
given tree
|
boolean |
ParetoFront.dominates(NAryTree t,
NAryTree candidate)
Returns TRUE if tree t dominates tree candidate.
|
boolean |
ParetoFront.dominates(NAryTree t1,
NAryTree t2,
boolean requireStrictlyBetter)
Returns TRUE if tree t1 dominates t2.
|
NAryTree |
ParetoFront.getBetter(TreeFitnessInfo dimension,
NAryTree tree)
Returns the tree next to the given tree which is slightly better in the
given dimension
|
int |
ParetoFront.getNrBetter(TreeFitnessInfo dimension,
NAryTree tree)
Returns the number of trees that for the given dimension are better
|
int |
ParetoFront.getNrWorse(TreeFitnessInfo dimension,
NAryTree tree)
Returns the number of trees that for the given dimension are worse
|
NAryTree |
ParetoFront.getWorse(TreeFitnessInfo dimension,
NAryTree tree)
Returns the tree next to the given tree which is slightly worse in the
given dimension
|
boolean |
ParetoFront.inParetoFront(NAryTree tree)
Checks whether the given tree is in the Pareto front
|
void |
ParetoFront.lockTree(NAryTree tree)
Locks the provided tree, meaning that it will not be removed from the
Pareto front during the lock
|
boolean |
ParetoFront.shouldBeRemovedButIsLocked(NAryTree tree) |
boolean |
ParetoFront.unlockTree(NAryTree tree)
Unlocks the provided tree, allowing it to be deleted.
|
Modifier and Type | Method and Description |
---|---|
void |
ParetoFront.consider(java.util.Collection<NAryTree> trees)
Considers adding the provided collection of trees to the Pareto front.
|
Modifier and Type | Class and Description |
---|---|
class |
NAryTreeImpl
This class implements n-ary process trees.
|
class |
NAryTreeImplWithHistory |
Modifier and Type | Field and Description |
---|---|
protected NAryTree |
Simulator.tree |
protected NAryTree |
StateBuilder.tree |
Modifier and Type | Method and Description |
---|---|
NAryTree |
NAryTree.add(NAryTree source,
int node,
int par,
int location)
Returns a new tree where the subtree below the node at index node in the
source tree is copied into this tree under node with index parent at
location index.
|
NAryTree |
NAryTree.addChild(int operatorNode,
int index,
short leafType,
byte configurationType)
Returns a new tree in which a child is added to the operator at the given
index
|
NAryTree |
NAryTreeImpl.addChild(int operatorNode,
int location,
short leafType,
byte configurationType) |
NAryTree |
NAryTree.addParent(int node,
short type,
byte configurationType)
Returns a new tree in which node from source is replaced by a new node of
the given type and where the existing node becomes a child of this newly
added parent.
|
NAryTree |
NAryTreeImpl.addParent(int node,
short newType,
byte configurationType) |
NAryTree |
NAryTree.applyConfiguration(int configurationNumber)
Applies a configuration to the tree and returns the result.
|
NAryTree |
NAryTreeImpl.applyConfiguration(int configurationNumber) |
NAryTree |
NAryTreeImpl.applyHidingAndOperatorDowngrading(int configurationNumber)
Apply all hiding and downgrading configurations of the provided
configuration number.
|
NAryTree |
NAryTreeImplWithHistory.applyHidingAndOperatorDowngrading(int configurationNumber) |
static NAryTree |
TreeUtilsAlignmentRepair.emptyTree() |
static NAryTree |
TreeUtils.flatten(NAryTree tree)
Flattens a tree by allowing non-LOOP nodes to absorp children that are of
the same operator type as they and remove operators that have only 1
child
|
static NAryTree |
TreeUtils.fromString(java.lang.String s) |
static NAryTree |
TreeUtils.fromString(java.lang.String s,
gnu.trove.map.TObjectShortMap<java.lang.String> map) |
static NAryTree |
TreeUtils.fromString(java.lang.String s,
org.deckfour.xes.classification.XEventClasses classes) |
NAryTree |
NAryTreeHistory.getParent() |
NAryTree |
StateBuilder.getTree() |
NAryTree |
NAryTree.move(int node,
int newParent,
int location)
moves the given node by removing it from its parent and adding is under
the new parent.
|
NAryTree |
NAryTreeImpl.move(int node,
int newParent,
int location) |
NAryTree |
NAryTree.move(int par,
int location,
int newParent,
int newLocation)
moves the n-th child of the parent "par" by removing it from the tree and
inserting it as a new child under newParent.
|
NAryTree |
NAryTreeImpl.move(int par,
int n,
int newParent,
int location) |
static NAryTree |
TreeUtils.normalize(NAryTree tree)
Normalizes a tree by first flattening it and then sorting it
|
NAryTree |
NAryTree.remove(int node)
removes the node at index node from the tre
|
NAryTree |
NAryTreeImpl.remove(int node) |
NAryTree |
NAryTree.remove(int par,
int index)
removes the child at index from node par.
|
NAryTree |
NAryTreeImpl.remove(int par,
int index) |
NAryTree |
NAryTree.replace(int par,
int n,
NAryTree source,
int node)
replaces the n-th child of parent with the node from source.
|
NAryTree |
NAryTreeImpl.replace(int par,
int n,
NAryTree source,
int node) |
NAryTree |
NAryTree.replace(int node,
NAryTree source,
int srcNode)
replaces node from this tree with the node from the source tree
It is assumed that this tree and the given tree have an equal number of
configurations.
|
static NAryTree |
TreeUtils.rewriteRevSeq(NAryTree tree)
Rewrites all REVSEQ operators nodes to regular SEQ nodes (also updates
configurations).
|
static NAryTree |
TreeUtils.sort(NAryTree tree)
Sorts the provided tree.
|
NAryTree |
NAryTree.swap(int node1,
int node2)
returns a new tree with the two nodes swapped.
|
Modifier and Type | Method and Description |
---|---|
NAryTree |
NAryTree.add(NAryTree source,
int node,
int par,
int location)
Returns a new tree where the subtree below the node at index node in the
source tree is copied into this tree under node with index parent at
location index.
|
NAryTreeImpl |
NAryTreeImpl.add(NAryTree source,
int node,
int par,
int location) |
NAryTreeImplWithHistory |
NAryTreeImplWithHistory.add(NAryTree source,
int node,
int par,
int location) |
int |
NAryTreeImpl.compareTo(NAryTree o) |
static NAryTree |
TreeUtils.flatten(NAryTree tree)
Flattens a tree by allowing non-LOOP nodes to absorp children that are of
the same operator type as they and remove operators that have only 1
child
|
static int |
TreeUtils.getNumberOfNodesConfigured(NAryTree tree)
Returns the number of nodes that have a configuration option set any of
the configurations
|
static int |
TreeUtils.getNumberOfNodesConfiguredForConfiguration(NAryTree tree,
int configuration)
Returns the number of nodes that have a configuration option set for the
provided configuration
|
static int[] |
TreeUtilsAlignmentRepair.getPointsOfChange(NAryTree candidate,
NAryTreeHistory parentHistory,
NAryTreeHistory grandparentHistory)
Function that returns the fixed points of change of a candidate after the
crossover and the mutation.
|
static org.deckfour.xes.classification.XEventClasses |
TreeUtils.getXEventClassesFromConnection(org.processmining.framework.plugin.PluginContext context,
NAryTree tree)
Convenience method to ask the context for a connection between the given
tree and the list of XEventClasses required to correctly interpret the
leafs.
|
static int |
TreeUtilsAlignmentRepair.LCA(NAryTree tree,
int a,
int b)
Returns the Lowest Common Ancestor (LCA) of two nodes a and b.
|
static int |
TreeUtilsAlignmentRepair.LCAImpr(NAryTree tree,
int a,
int b)
UNTESTED
|
static java.lang.String |
TreeUtils.nodeToString(NAryTree tree,
int node)
Returns the string representation of THIS NODE ONLY
|
static java.lang.String |
TreeUtils.nodeToString(NAryTree tree,
int node,
java.lang.String[] leafLabels)
Returns the string representation of THIS NODE ONLY, if a leaf then
returns the corresponding XEventClass string representation or TAU if
necessary
|
static java.lang.String |
TreeUtils.nodeToString(NAryTree tree,
int node,
org.deckfour.xes.classification.XEventClasses classes)
Returns the string representation of THIS NODE ONLY, if a leaf then
returns the corresponding XEventClass string representation or TAU if
necessary
|
static NAryTree |
TreeUtils.normalize(NAryTree tree)
Normalizes a tree by first flattening it and then sorting it
|
static void |
TreeUtils.printTree(NAryTree tree) |
protected void |
StateBuilder.processChoiceExecution(byte[] state,
NAryTree tree,
int node,
int parent) |
protected void |
StateBuilder.processEmptySubtree(byte[] state,
NAryTree tree,
StateBuilder.StateQueue queue,
int p) |
protected void |
StateBuilder.processFinishedSubtree(byte[] state,
NAryTree tree,
int node,
StateBuilder.StateQueue queue) |
protected void |
StateBuilder.processFinishedSubtreeIlv(byte[] state,
NAryTree tree,
StateBuilder.StateQueue queue,
int p) |
protected void |
StateBuilder.processFinishedSubtreeLoop(byte[] state,
NAryTree tree,
int node,
StateBuilder.StateQueue queue,
int p) |
protected void |
StateBuilder.processFinishedSubtreeOr(byte[] state,
NAryTree tree,
StateBuilder.StateQueue queue,
int p) |
protected void |
StateBuilder.processFinishedSubtreeRevSeq(byte[] state,
NAryTree tree,
int node,
StateBuilder.StateQueue queue,
int p) |
protected void |
StateBuilder.processFinishedSubtreeSeq(byte[] state,
NAryTree tree,
int node,
StateBuilder.StateQueue queue,
int p) |
NAryTree |
NAryTree.replace(int par,
int n,
NAryTree source,
int node)
replaces the n-th child of parent with the node from source.
|
NAryTree |
NAryTreeImpl.replace(int par,
int n,
NAryTree source,
int node) |
NAryTree |
NAryTree.replace(int node,
NAryTree source,
int srcNode)
replaces node from this tree with the node from the source tree
It is assumed that this tree and the given tree have an equal number of
configurations.
|
NAryTreeImpl |
NAryTreeImpl.replace(int node,
NAryTree source,
int srcNode) |
NAryTreeImplWithHistory |
NAryTreeImplWithHistory.replace(int node,
NAryTree source,
int srcNode) |
static int |
TreeUtilsAlignmentRepair.replaceWithParentType(int node,
int TYPE,
NAryTree tree)
Returns the lowest parent that is equal to the input parent.
|
static NAryTree |
TreeUtils.rewriteRevSeq(NAryTree tree)
Rewrites all REVSEQ operators nodes to regular SEQ nodes (also updates
configurations).
|
static NAryTree |
TreeUtils.sort(NAryTree tree)
Sorts the provided tree.
|
static java.lang.String |
TreeUtils.toString(NAryTree tree)
Returns a human-readable string representation of an NAryTree
|
static java.lang.String |
TreeUtils.toString(NAryTree tree,
int node)
Returns a human-readable string representation of the provided node in an
NAryTree
|
static java.lang.String |
TreeUtils.toString(NAryTree tree,
int node,
org.deckfour.xes.classification.XEventClasses classes)
Returns a human-readable string representation of the provided node in an
NAryTree using the XEventClasses for the leafs
|
static java.lang.String |
TreeUtils.toString(NAryTree tree,
org.deckfour.xes.classification.XEventClasses classes)
Returns a human-readable string representation of an NAryTree using the
provided XEventClasses for leafs
|
static void |
TreeUtils.writeBehaviorToDot(NAryTree tree,
int configurationNumber,
java.io.OutputStreamWriter out,
boolean doPushDown) |
static void |
TreeUtils.writeTreeToDot(NAryTree tree,
int configurationNumber,
java.io.OutputStreamWriter out) |
static void |
TreeUtils.writeTreeToDot(NAryTree tree,
int configurationNumber,
java.io.OutputStreamWriter out,
java.lang.String[] leafLabels) |
Constructor and Description |
---|
NAryTreeHistory(NAryTree _parent,
int _locationOfChange,
NAryTreeHistory.TypesOfChange _typeOfChange) |
NAryTreeImpl(NAryTree original) |
NAryTreeImplWithHistory(NAryTree original) |
Simulator(NAryTree tree,
int configurationNumber,
java.util.Random random) |
StateBuilder(NAryTree tree,
int configuationNumber)
initialize the statebuilder.
|
StateBuilder(NAryTree tree,
int configurationNumber,
boolean useQueue)
initialize the statebuilder.
|
Constructor and Description |
---|
NAryTreeToXEventClassesConnection(NAryTree tree,
org.deckfour.xes.classification.XEventClasses classes) |
Modifier and Type | Method and Description |
---|---|
NAryTree |
ProcessTreeToNAryTree.convert(org.processmining.processtree.ProcessTree pt)
Convert the provided tree to an NAryTree
|
NAryTree |
ProcessTreeToNAryTree.convert(org.processmining.processtree.ProcessTree pt,
java.util.List<org.processmining.processtree.configuration.controlflow.ControlFlowConfiguration> configurations)
Convert the provided ProcessTree to an NAryTree, including the provided
configurations
|
NAryTree |
ProcessTreeToNAryTree.convertNode(org.processmining.processtree.Node node,
java.util.List<org.processmining.processtree.configuration.controlflow.ControlFlowConfiguration> configurations)
Convert the provided node to the equivalent NAryTree part
|
Modifier and Type | Method and Description |
---|---|
static void |
NAryTreeToProcessTree.addFitnessProperties(org.processmining.processtree.ProcessTree processTree,
NAryTree naryTree,
CentralRegistry registry) |
static org.processmining.processtree.ProcessTree |
NAryTreeToProcessTree.convert(NAryTree tree)
Converts the given NAryTree to a ProcessTree without converting the leaf
pointers to event class names
|
static org.processmining.processtree.ProcessTree |
NAryTreeToProcessTree.convert(NAryTree tree,
org.deckfour.xes.classification.XEventClasses classes)
Converts the given NAryTree to a ProcessTree while converting the leaf
pointers to event class names
|
static org.processmining.processtree.ProcessTree |
NAryTreeToProcessTree.convert(org.deckfour.xes.classification.XEventClasses classes,
NAryTree tree,
java.lang.String name)
Converts the given NAryTree to a ProcessTree while converting the leaf
pointers to event class names
|
static org.processmining.processtree.Node |
NAryTreeToProcessTree.convertNode(org.processmining.processtree.ProcessTree processTree,
org.processmining.processtree.Block parentNode,
org.deckfour.xes.classification.XEventClasses classes,
NAryTree tree,
int node,
java.util.ArrayList<org.processmining.processtree.configuration.controlflow.ControlFlowConfiguration> configurations)
Convert a single node of the given NAryTree to a node in the ProcessTree,
using the provided list of event classes for the translation
|
static org.processmining.processtree.Node |
NAryTreeToProcessTree.convertNode(org.processmining.processtree.ProcessTree processTree,
NAryTree tree,
int node)
Convert a single node of the given NAryTree to a node in the ProcessTree
|
static org.processmining.processtree.Node |
NAryTreeToProcessTree.convertNode(org.processmining.processtree.ProcessTree processTree,
org.deckfour.xes.classification.XEventClasses classes,
NAryTree tree,
int node)
Convert a single node of the given NAryTree to a node in the ProcessTree,
using the provided list of event classes for the translation
|
static org.processmining.processtree.Node |
NAryTreeToProcessTree.convertNode(org.processmining.processtree.ProcessTree processTree,
org.deckfour.xes.classification.XEventClasses classes,
NAryTree tree,
int node,
java.util.ArrayList<org.processmining.processtree.configuration.controlflow.ControlFlowConfiguration> configurations)
Convert a single node of the given NAryTree to a node in the ProcessTree,
using the provided list of event classes for the translation
|
static org.processmining.framework.util.Pair<org.processmining.processtree.ProcessTree,java.util.ArrayList<org.processmining.processtree.configuration.controlflow.ControlFlowConfiguration>> |
NAryTreeToProcessTree.convertWithConfiguration(org.deckfour.xes.classification.XEventClasses classes,
NAryTree tree,
java.lang.String name)
Converts the given NAryTree to a ProcessTree while converting the leaf
pointers to event class names and including the provided configurations
of the NAryTree
|
Modifier and Type | Field and Description |
---|---|
protected NAryTree |
AbstractNAryTreeDelegate.tree |
protected NAryTree |
AbstractNAryTreeReplayer.tree |
protected NAryTree |
StubbornNAryTreeAStarThread.tree |
Modifier and Type | Method and Description |
---|---|
NAryTree |
AbstractNAryTreeDelegate.getTree() |
Modifier and Type | Method and Description |
---|---|
protected abstract D |
AbstractNAryTreeReplayer.constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2Cost,
int threads,
boolean useOrRows)
construct the delegate of the right type for the version of the replayer
to be used.
|
static boolean |
TreeRecord.isConsistent(TreeRecord newRecord,
nl.tue.astar.Trace originalTrace,
NAryTree tree,
int scaling) |
protected boolean |
AbstractNAryTreeLPTail.updateVariables(AbstractNAryTreeDelegate<?> delegate,
NAryTree tree,
byte[] state,
short[] vars,
int modelMove,
boolean syncMove) |
Constructor and Description |
---|
AbstractNAryTreeDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads) |
AbstractNAryTreeLPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useInt,
boolean useSemiCon,
int timeOut,
int varUpBo) |
AbstractNAryTreeLPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useInt,
boolean useSemiCon,
int timeOut,
int varUpBo,
boolean useORRows) |
AbstractNAryTreeReplayer(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2Cost,
boolean useOrRows,
nl.tue.astar.AStarObserver... observers)
Single threaded variant
|
AbstractNAryTreeReplayer(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2Cost,
boolean useOrRows,
int nrThreads,
nl.tue.astar.AStarObserver... observers) |
CPUEfficient(NAryTree tree,
nl.tue.astar.Delegate<H,T> delegate,
gnu.trove.map.TObjectIntMap<H> head2int,
java.util.List<nl.tue.astar.impl.State<H,T>> stateList,
H initialHead,
nl.tue.astar.Trace trace,
int maxStates) |
MemoryEfficient(NAryTree tree,
nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<H,T> algorithm,
H initialHead,
nl.tue.astar.Trace trace,
int maxStates) |
NAryTreePostProcessor(TreeDelegate<H,T> delegate,
NAryTree tree,
int configurationNumber,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments) |
NodeRelations(NAryTree tree) |
StubbornNAryTreeAStarThread(NAryTree tree,
nl.tue.astar.Delegate<H,T> delegate,
nl.tue.astar.Trace trace,
int maxStates,
nl.tue.astar.impl.AbstractAStarThread.StorageHandler<H,T> storageHandler) |
Modifier and Type | Method and Description |
---|---|
protected NAryTreeBasisILPDelegate |
NAryTreeReplayerWithBasisILP.constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
Constructor and Description |
---|
NAryTreeBasisILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads) |
NAryTreeBasisILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
NAryTreeReplayerWithBasisILP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
boolean useOrRows,
nl.tue.astar.AStarObserver... observers) |
Modifier and Type | Method and Description |
---|---|
protected NAryTreeBasis2ILPDelegate |
NAryTreeReplayerWithBasis2ILP.constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
Constructor and Description |
---|
NAryTreeBasis2ILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads) |
NAryTreeBasis2ILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
NAryTreeReplayerWithBasis2ILP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
boolean useOrRows,
nl.tue.astar.AStarObserver... observers) |
NAryTreeReplayerWithBasis2ILP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
boolean useOrRows,
int nrThreads,
nl.tue.astar.AStarObserver... observers) |
Modifier and Type | Method and Description |
---|---|
protected NAryTreeEmptyDelegate |
NAryTreeReplayerWithoutILP.constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
Constructor and Description |
---|
NAryTreeEmptyDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2Cost,
int threads) |
NAryTreeReplayerWithoutILP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
nl.tue.astar.AStarObserver... observers) |
Modifier and Type | Method and Description |
---|---|
protected NAryTreeFullILPDelegate |
NAryTreeReplayerWithFullILP.constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
Constructor and Description |
---|
NAryTreeFullILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
NAryTreeReplayerWithFullILP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
boolean useOrRows,
nl.tue.astar.AStarObserver... observers) |
Modifier and Type | Method and Description |
---|---|
protected NAryTreeHybridILPDelegate |
NAryTreeReplayerWithHybridILP.constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
Constructor and Description |
---|
NAryTreeHybridILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads) |
NAryTreeHybridILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
NAryTreeHybridILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows,
boolean useInt) |
NAryTreeReplayerWithHybridILP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
boolean useOrRows,
nl.tue.astar.AStarObserver... observers) |
Modifier and Type | Method and Description |
---|---|
protected NAryTreeLPDelegate |
NAryTreeReplayerWithLP.constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
Constructor and Description |
---|
NAryTreeLPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads) |
NAryTreeLPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
NAryTreeReplayerWithLP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
boolean useOrRows,
nl.tue.astar.AStarObserver... observers) |
Modifier and Type | Method and Description |
---|---|
static NAryTree |
PerformanceEval.getTree(gnu.trove.map.TObjectShortMap<java.lang.String> map,
java.util.Random r,
int size) |
Modifier and Type | Method and Description |
---|---|
protected NAryTreeNativeILPDelegate |
NAryTreeReplayerWithNativeILP.constructDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
Constructor and Description |
---|
NAryTreeNativeILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows) |
NAryTreeNativeILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows,
boolean useBasisHistory) |
NAryTreeNativeILPDelegate(AStarAlgorithm algorithm,
NAryTree tree,
int configurationNumber,
int[] node2cost,
int threads,
boolean useOrRows,
boolean useBasisHistory,
boolean useInt)
Deprecated.
Temporary constructor to allow LP tests
|
NAryTreeReplayerWithNativeILP(AStarAlgorithm aStarLogAbstraction,
nl.tue.astar.AStarThread.Canceller canceller,
NAryTree tree,
int configurationNumber,
int[] node2cost,
java.util.Map<TreeMarkingVisit<ModelPrefix>,gnu.trove.set.TIntSet> marking2modelmove,
gnu.trove.map.TObjectIntMap<TreeMarkingVisit<ModelPrefix>> marking2visitCount,
int[] syncMoveCount,
int[] aSyncMoveCount,
int[] moveCount,
java.util.Map<nl.tue.astar.Trace,TreeRecord> alignments,
boolean useOrRows,
boolean useBasisHistory,
nl.tue.astar.AStarObserver... observers) |
Modifier and Type | Method and Description |
---|---|
static NAryTree |
Test.getTree(gnu.trove.map.TObjectShortMap<java.lang.String> map,
java.util.Random r,
int size) |
Constructor and Description |
---|
TreeLayoutBuilder(NAryTree tree) |
TreeLayoutBuilder(NAryTree tree,
org.deckfour.xes.classification.XEventClasses classes) |
Modifier and Type | Class and Description |
---|---|
class |
TreeCrossover<R extends NAryTree>
Cross-over operator for the trees of
Node s. |
Modifier and Type | Method and Description |
---|---|
NAryTree |
GuidedTreeMutationCoordinator.apply(NAryTree tree,
java.util.Random rng)
Applies mutation functions to the tree, depending on the tree's fitness
characteristics and the provided probabilities
|
NAryTree |
TreeMutationCoordinator.apply(NAryTree tree,
java.util.Random rng)
Applies mutation functions to the tree, depending on the tree's fitness
characteristics and the provided probabilities
|
NAryTree |
TreeMutationAbstract.mutate(NAryTree tree)
Calls mutate(Node) on the root and makes sure that the changed node
becomes the new root
|
abstract NAryTree |
TreeMutationAbstract.mutate(NAryTree tree,
int node)
Mutates the given node (only use if you need to mutate a specific sub
tree, not beeing the whole tree).
|
Modifier and Type | Method and Description |
---|---|
java.util.List<NAryTree> |
GuidedTreeMutationCoordinator.apply(java.util.List<NAryTree> selectedCandidates,
java.util.Random rng)
Applies mutation functions to the tree, depending on the tree's fitness
characteristics and the provided probabilities
|
java.util.List<NAryTree> |
TreeMutationCoordinator.apply(java.util.List<NAryTree> selectedCandidates,
java.util.Random rng)
Applies mutation functions to the tree, depending on the tree's fitness
characteristics and the provided probabilities
|
protected java.util.List<NAryTree> |
TreeCrossover.mate(NAryTree parent1,
NAryTree parent2,
int numberOfCrossoverPoints,
java.util.Random rng)
Swaps randomly selected sub-trees between the two parents.
|
Modifier and Type | Method and Description |
---|---|
NAryTree |
GuidedTreeMutationCoordinator.apply(NAryTree tree,
java.util.Random rng)
Applies mutation functions to the tree, depending on the tree's fitness
characteristics and the provided probabilities
|
NAryTree |
TreeMutationCoordinator.apply(NAryTree tree,
java.util.Random rng)
Applies mutation functions to the tree, depending on the tree's fitness
characteristics and the provided probabilities
|
protected java.util.List<NAryTree> |
TreeCrossover.mate(NAryTree parent1,
NAryTree parent2,
int numberOfCrossoverPoints,
java.util.Random rng)
Swaps randomly selected sub-trees between the two parents.
|
NAryTree |
TreeMutationAbstract.mutate(NAryTree tree)
Calls mutate(Node) on the root and makes sure that the changed node
becomes the new root
|
abstract NAryTree |
TreeMutationAbstract.mutate(NAryTree tree,
int node)
Mutates the given node (only use if you need to mutate a specific sub
tree, not beeing the whole tree).
|
Modifier and Type | Method and Description |
---|---|
java.util.List<NAryTree> |
GuidedTreeMutationCoordinator.apply(java.util.List<NAryTree> selectedCandidates,
java.util.Random rng)
Applies mutation functions to the tree, depending on the tree's fitness
characteristics and the provided probabilities
|
java.util.List<NAryTree> |
TreeMutationCoordinator.apply(java.util.List<NAryTree> selectedCandidates,
java.util.Random rng)
Applies mutation functions to the tree, depending on the tree's fitness
characteristics and the provided probabilities
|
Modifier and Type | Method and Description |
---|---|
static NAryTree |
ConfigurationMutator.cleanUpConfigurations(NAryTree tree,
int nrConfigurationsRequired)
Cleans up the configurations of this tree.
|
NAryTree |
AddNodeRandom.mutate(NAryTree tree) |
NAryTree |
NormalizationMutation.mutate(NAryTree tree) |
NAryTree |
ReplaceTreeMutation.mutate(NAryTree tree) |
NAryTree |
AddNodeRandom.mutate(NAryTree tree,
int node) |
NAryTree |
ConfigurationMutator.mutate(NAryTree tree,
int node) |
NAryTree |
GraduallyConsiderMoreEventClasses.mutate(NAryTree tree,
int node) |
NAryTree |
InsertActivityGuided.mutate(NAryTree tree,
int node) |
NAryTree |
MutateLeafClassGuided.mutate(NAryTree treeOriginal,
int node) |
NAryTree |
MutateOperatorTypeGuided.mutate(NAryTree tree,
int node)
Walks through the tree to find an operator node that behaves differently
than it should.
|
NAryTree |
MutateSingleNodeRandom.mutate(NAryTree tree,
int node) |
NAryTree |
NormalizationMutation.mutate(NAryTree tree,
int node) |
NAryTree |
PatternRewriteGuided.mutate(NAryTree tree,
int n) |
NAryTree |
RemoveActivityGuided.mutate(NAryTree tree,
int node) |
NAryTree |
RemoveSubtreeRandom.mutate(NAryTree tree,
int node) |
NAryTree |
RemoveUselessNode.mutate(NAryTree tree,
int node) |
NAryTree |
ReplaceTreeMutation.mutate(NAryTree tree,
int node) |
NAryTree |
ShuffleCluster.mutate(NAryTree tree,
int node) |
NAryTree |
ShuffleCluster.mutate(NAryTree tree,
int node,
boolean maintainBehavior)
Shuffles a selected cluster
|
Modifier and Type | Method and Description |
---|---|
java.util.List<NAryTree> |
GraduallyConsiderMoreEventClasses.apply(java.util.List<NAryTree> selectedCandidates,
java.util.Random rng) |
java.util.List<NAryTree> |
ShuffleCluster.apply(java.util.List<NAryTree> selectedCandidates,
java.util.Random rng) |
Modifier and Type | Method and Description |
---|---|
static NAryTree |
ConfigurationMutator.cleanUpConfigurations(NAryTree tree,
int nrConfigurationsRequired)
Cleans up the configurations of this tree.
|
NAryTree |
AddNodeRandom.mutate(NAryTree tree) |
NAryTree |
NormalizationMutation.mutate(NAryTree tree) |
NAryTree |
ReplaceTreeMutation.mutate(NAryTree tree) |
NAryTree |
AddNodeRandom.mutate(NAryTree tree,
int node) |
NAryTree |
ConfigurationMutator.mutate(NAryTree tree,
int node) |
NAryTree |
GraduallyConsiderMoreEventClasses.mutate(NAryTree tree,
int node) |
NAryTree |
InsertActivityGuided.mutate(NAryTree tree,
int node) |
NAryTree |
MutateLeafClassGuided.mutate(NAryTree treeOriginal,
int node) |
NAryTree |
MutateOperatorTypeGuided.mutate(NAryTree tree,
int node)
Walks through the tree to find an operator node that behaves differently
than it should.
|
NAryTree |
MutateSingleNodeRandom.mutate(NAryTree tree,
int node) |
NAryTree |
NormalizationMutation.mutate(NAryTree tree,
int node) |
NAryTree |
PatternRewriteGuided.mutate(NAryTree tree,
int n) |
NAryTree |
RemoveActivityGuided.mutate(NAryTree tree,
int node) |
NAryTree |
RemoveSubtreeRandom.mutate(NAryTree tree,
int node) |
NAryTree |
RemoveUselessNode.mutate(NAryTree tree,
int node) |
NAryTree |
ReplaceTreeMutation.mutate(NAryTree tree,
int node) |
NAryTree |
ShuffleCluster.mutate(NAryTree tree,
int node) |
NAryTree |
ShuffleCluster.mutate(NAryTree tree,
int node,
boolean maintainBehavior)
Shuffles a selected cluster
|
Modifier and Type | Method and Description |
---|---|
java.util.List<NAryTree> |
GraduallyConsiderMoreEventClasses.apply(java.util.List<NAryTree> selectedCandidates,
java.util.Random rng) |
java.util.List<NAryTree> |
ShuffleCluster.apply(java.util.List<NAryTree> selectedCandidates,
java.util.Random rng) |
Modifier and Type | Class and Description |
---|---|
class |
CombinationCrossover<R extends NAryTree> |
class |
InsertionCrossover<R extends NAryTree>
Fully functional implementation of another crossover that does not provide
significant improvements
|
Modifier and Type | Method and Description |
---|---|
static NAryTree |
IntelligentTreeFactory.generateRandomCandidate(CentralRegistry registry)
The Advanced trace model creation
|
static NAryTree |
LeafFactory.generateRandomCandidate(CentralRegistry registry) |
static NAryTree |
SequenceFactory.generateRandomCandidate(CentralRegistry registry) |
NAryTree |
IntelligentTreeFactory.generateRandomCandidate(java.util.Random rng) |
NAryTree |
LeafFactory.generateRandomCandidate(java.util.Random rng) |
NAryTree |
SequenceFactory.generateRandomCandidate(java.util.Random rng) |
NAryTree |
ReplaceTreeByIntelligentTreeMutation.mutate(NAryTree tree) |
NAryTree |
ReplaceTreeByLeafMutation.mutate(NAryTree tree) |
NAryTree |
ReplaceTreeBySequenceMutation.mutate(NAryTree tree) |
NAryTree |
MutateSingleNodeGuided.mutate(NAryTree tree,
int node) |
NAryTree |
MutateSingleNodeGuidedWithRepairRecommendation.mutate(NAryTree tree,
int node) |
NAryTree |
ReplaceTreeByIntelligentTreeMutation.mutate(NAryTree tree,
int node) |
NAryTree |
ReplaceTreeByLeafMutation.mutate(NAryTree tree,
int node) |
NAryTree |
ReplaceTreeBySequenceMutation.mutate(NAryTree tree,
int node) |
protected NAryTree |
MutateSingleNodeGuided.mutateLeaf(NAryTree mutatedTree,
int nodeToBeMutated,
java.util.ArrayList<AlignmentMoveList> alignmentMoves,
gnu.trove.map.TObjectIntMap<nl.tue.astar.Trace> log) |
protected NAryTree |
MutateSingleNodeGuided.mutateOperator(NAryTree mutatedTree,
int nodeToBeMutated,
java.util.ArrayList<AlignmentMoveList> alignmentMoves,
gnu.trove.map.TObjectIntMap<nl.tue.astar.Trace> log) |
Modifier and Type | Method and Description |
---|---|
protected java.util.List<NAryTree> |
CombinationCrossover.mate(NAryTree parent1,
NAryTree parent2,
int numberOfCrossoverPoints,
java.util.Random rng) |
protected java.util.List<NAryTree> |
InsertionCrossover.mate(NAryTree parent1,
NAryTree parent2,
int numberOfCrossoverPoints,
java.util.Random rng)
Swap two nodes between the trees based on alignment move mapping
|
Modifier and Type | Method and Description |
---|---|
static java.util.ArrayList<AlignmentMoveList> |
AlignmentMove.getAlignmentMoveMapping(CentralRegistry registry,
NAryTree tree)
Creates per node a list of all alignment moves mapped to that node
|
protected java.util.List<NAryTree> |
CombinationCrossover.mate(NAryTree parent1,
NAryTree parent2,
int numberOfCrossoverPoints,
java.util.Random rng) |
protected java.util.List<NAryTree> |
InsertionCrossover.mate(NAryTree parent1,
NAryTree parent2,
int numberOfCrossoverPoints,
java.util.Random rng)
Swap two nodes between the trees based on alignment move mapping
|
NAryTree |
ReplaceTreeByIntelligentTreeMutation.mutate(NAryTree tree) |
NAryTree |
ReplaceTreeByLeafMutation.mutate(NAryTree tree) |
NAryTree |
ReplaceTreeBySequenceMutation.mutate(NAryTree tree) |
NAryTree |
MutateSingleNodeGuided.mutate(NAryTree tree,
int node) |
NAryTree |
MutateSingleNodeGuidedWithRepairRecommendation.mutate(NAryTree tree,
int node) |
NAryTree |
ReplaceTreeByIntelligentTreeMutation.mutate(NAryTree tree,
int node) |
NAryTree |
ReplaceTreeByLeafMutation.mutate(NAryTree tree,
int node) |
NAryTree |
ReplaceTreeBySequenceMutation.mutate(NAryTree tree,
int node) |
protected NAryTree |
MutateSingleNodeGuided.mutateLeaf(NAryTree mutatedTree,
int nodeToBeMutated,
java.util.ArrayList<AlignmentMoveList> alignmentMoves,
gnu.trove.map.TObjectIntMap<nl.tue.astar.Trace> log) |
protected NAryTree |
MutateSingleNodeGuided.mutateOperator(NAryTree mutatedTree,
int nodeToBeMutated,
java.util.ArrayList<AlignmentMoveList> alignmentMoves,
gnu.trove.map.TObjectIntMap<nl.tue.astar.Trace> log) |
Modifier and Type | Field and Description |
---|---|
protected java.util.List<EvolutionaryOperator<NAryTree>> |
ETMParamAbstract.evolutionaryOperators |
protected java.util.List<EvolutionObserver<NAryTree>> |
ETMParamAbstract.evolutionObservers |
protected CandidateFactory<NAryTree> |
ETMParamAbstract.factory |
protected java.util.List<NAryTree> |
ETMParamAbstract.seed |
Modifier and Type | Method and Description |
---|---|
java.util.List<EvolutionaryOperator<NAryTree>> |
ETMParamAbstract.getEvolutionaryOperators() |
java.util.List<EvolutionObserver<NAryTree>> |
ETMParamAbstract.getEvolutionObservers() |
CandidateFactory<NAryTree> |
ETMParamAbstract.getFactory() |
java.util.List<NAryTree> |
ETMParamAbstract.getSeed() |
Modifier and Type | Method and Description |
---|---|
static ETMParamPareto |
ETMParamFactory.buildETMParamPareto(org.deckfour.xes.model.XLog eventlog,
org.processmining.framework.plugin.PluginContext context,
int popSize,
int eliteSize,
int nrRandomTrees,
double crossOverChance,
double chanceOfRandomMutation,
boolean preventDuplicates,
int maxGen,
double targetFitness,
double frWeight,
double maxF,
double maxFTime,
double peWeight,
double geWeight,
double sdWeight,
NAryTree[] seed,
double simWeight) |
static ETMParam |
ETMParamFactory.buildParam(org.deckfour.xes.model.XLog eventlog,
org.processmining.framework.plugin.PluginContext context,
int popSize,
int eliteSize,
int nrRandomTrees,
double crossOverChance,
double chanceOfRandomMutation,
boolean preventDuplicates,
int maxGen,
double targetFitness,
double frWeight,
double fitnessLimit,
double maxFTime,
double peWeight,
double geWeight,
double sdWeight,
NAryTree[] seed,
double simWeight)
Instantiates a parameter instance while requesting only 'high level'
information and creating the most common termination conditions, fitness
evaluator(s), evolutionary operators and observers.
|
void |
ETMParamAbstract.setSeed(NAryTree[] seed) |
Modifier and Type | Method and Description |
---|---|
void |
ETMParamAbstract.addEvolutionObserver(EvolutionObserver<NAryTree> evolutionObserver)
Add an evolution observer to the list of evolution observers that report
about the progress (not really required but should be used to update GUIs
etc.
|
void |
ETMParamAbstract.setEvolutionaryOperators(java.util.List<EvolutionaryOperator<NAryTree>> evolutionaryOperators) |
void |
ETMParamAbstract.setEvolutionObservers(java.util.List<EvolutionObserver<NAryTree>> evolutionObservers) |
void |
ETMParamAbstract.setFactory(CandidateFactory<NAryTree> factory) |
void |
ETMParamAbstract.setSeed(java.util.List<NAryTree> seed) |
Constructor and Description |
---|
ETMParam(CentralRegistry registry,
TreeFitnessAbstract evaluator,
java.util.ArrayList<EvolutionaryOperator<NAryTree>> evolutionaryOperators,
int popSize,
int eliteSize) |
ETMParam(CentralRegistry registry,
TreeFitnessAbstract fitnessEvaluator,
java.util.List<EvolutionaryOperator<NAryTree>> evolutionaryOperators,
int populationSize,
int eliteCount) |
ETMParamAbstract(CentralRegistry registry,
TreeFitnessAbstract fitnessEvaluator,
java.util.List<EvolutionaryOperator<NAryTree>> evolutionaryOperators,
int populationSize,
int eliteCount)
The most basic constructor for the ETM algorithm.
|
ETMParamConfigurable(CentralRegistryConfigurable registry,
TreeFitnessAbstract fitnessEvaluator,
java.util.List<EvolutionaryOperator<NAryTree>> evolutionaryOperators,
int populationSize,
int eliteCount) |
ETMParamPareto(CentralRegistry centralRegistry,
TreeFitnessAbstract fitnessEvaluator,
ParetoFitnessEvaluator paretoFitnessEvaluator,
java.util.List<EvolutionaryOperator<NAryTree>> evolutionaryOperators,
int populationSize,
int eliteCount) |
ETMParamParetoConfigurable(CentralRegistryConfigurable centralRegistry,
TreeFitnessAbstract fitnessEvaluator,
ParetoFitnessEvaluator paretoFitnessEvaluator,
java.util.List<EvolutionaryOperator<NAryTree>> evolutionaryOperators,
int populationSize,
int eliteCount) |
Modifier and Type | Method and Description |
---|---|
static org.jgraph.JGraph |
JGraphVisualisation.convertToJGraph(NAryTree t) |
static org.jgraph.JGraph |
JGraphVisualisation.convertToJGraph(NAryTree t,
org.deckfour.xes.classification.XEventClasses classes) |
static javax.swing.JComponent |
TreeVisualization.visualize(org.processmining.framework.plugin.PluginContext context,
NAryTree tree) |
Modifier and Type | Field and Description |
---|---|
protected NAryTree |
ParetoVisualization.currentTree
The current model shown (such that navigators can show this)
|
Modifier and Type | Method and Description |
---|---|
static org.jfree.chart.ChartPanel |
GenericDotPlotChart.getChartPanel(TreeFitnessInfo xDim,
TreeFitnessInfo yDim,
CentralRegistry registry,
NAryTree currentTree,
org.jfree.chart.event.ChartProgressListener listener)
Creates a dot plot chart panel
|
static void |
GenericDotPlotChart.updateSelectedModel(org.jfree.chart.ChartPanel panel,
NAryTree model,
CentralRegistry registry,
TreeFitnessInfo xDim,
TreeFitnessInfo yDim)
Places the crosshaires such that it points to the currently selected
model
|
abstract void |
AbstractParetoFrontNavigator.updateSelectedModel(NAryTree model)
Triggered when the selected model is changed by the user
|
void |
DimensionBarChart.updateSelectedModel(NAryTree model) |
void |
GenerationSeriesPlot.updateSelectedModel(NAryTree model) |
void |
GridDotPlots.updateSelectedModel(NAryTree model) |
void |
ParetoFrontDimensionNavigator.updateSelectedModel(NAryTree model)
When we get notified of a new selected model, we currently completely
rebuild the layout
|
void |
SpiderChart.updateSelectedModel(NAryTree model) |
void |
TimePerGenerationPlot.updateSelectedModel(NAryTree model) |
void |
TimeSeriesPlot.updateSelectedModel(NAryTree model) |
void |
TwoDimDotPlot.updateSelectedModel(NAryTree model) |
void |
ParetoVisualization.updateTree(NAryTree tree)
Changes the currently shown tree to the provided one
|