Modifier and Type | Method and Description |
---|---|
static void |
InductiveMinerWithoutLog.debug(java.lang.Object x,
MinerStateWithoutLog minerState) |
static org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
InductiveMinerWithoutLog.findBaseCases(DfgMsd graph,
MinerStateWithoutLog minerState) |
static Cut |
InductiveMinerWithoutLog.findCut(DfgMsd graph,
java.lang.Iterable<CutFinderWithoutLog> cutFinders,
MinerStateWithoutLog minerState) |
static org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
InductiveMinerWithoutLog.findFallThrough(DfgMsd graph,
MinerStateWithoutLog minerState) |
static org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
InductiveMinerWithoutLog.mineNode(DfgMsd graph,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersWithoutLog.splitGraphConcurrent(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersWithoutLog.splitGraphInterleaved(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersWithoutLog.splitGraphLoop(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersWithoutLog.splitGraphOr(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersWithoutLog.splitGraphSequence(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersWithoutLog.splitGraphXor(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
static DfgMsd[] |
InductiveMinerWithoutLog.splitLog(DfgMsd graph,
Cut cut,
MinerStateWithoutLog minerState) |
Modifier and Type | Method and Description |
---|---|
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
BaseCaseFinderWithoutLog.findBaseCases(DfgMsd graph,
MinerStateWithoutLog minerState) |
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
BaseCaseFinderWithoutLogEmptyLog.findBaseCases(DfgMsd graph,
MinerStateWithoutLog minerState) |
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
BaseCaseFinderWithoutLogEmptyTraces.findBaseCases(DfgMsd graph,
MinerStateWithoutLog minerState) |
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
BaseCaseFinderWithoutLogEmptyTracesFiltering.findBaseCases(DfgMsd graph,
MinerStateWithoutLog minerState) |
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
BaseCaseFinderWithoutLogSemiFlowerModel.findBaseCases(DfgMsd graph,
MinerStateWithoutLog minerState) |
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
BaseCaseFinderWithoutLogSingleActivity.findBaseCases(DfgMsd graph,
MinerStateWithoutLog minerState) |
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
BaseCaseFinderWithoutLogSingleActivityFiltering.findBaseCases(DfgMsd graph,
MinerStateWithoutLog minerState) |
Modifier and Type | Method and Description |
---|---|
Cut |
CutFinderWithoutLog.findCut(DfgMsd graph,
MinerStateWithoutLog minerState) |
Cut |
CutFinderWithoutLogIMConcurrent.findCut(DfgMsd graph,
MinerStateWithoutLog minerState) |
Cut |
CutFinderWithoutLogIMConcurrentWithMinimumSelfDistance.findCut(DfgMsd graph,
MinerStateWithoutLog minerState) |
Cut |
CutFinderWithoutLogIMExclusiveChoice.findCut(DfgMsd graph,
MinerStateWithoutLog minerState) |
Cut |
CutFinderWithoutLogIMLoop.findCut(DfgMsd graph,
MinerStateWithoutLog minerState) |
Cut |
CutFinderWithoutLogIMLoopWithMinimumSelfDistance.findCut(DfgMsd graph,
MinerStateWithoutLog minerState) |
Cut |
CutFinderWithoutLogIMSequence.findCut(DfgMsd graph,
MinerStateWithoutLog minerState) |
Modifier and Type | Method and Description |
---|---|
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
FallThroughWithoutLog.fallThrough(DfgMsd graph,
MinerStateWithoutLog minerState) |
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
FallThroughWithoutLogFlowerWithoutEpsilon.fallThrough(DfgMsd graph,
MinerStateWithoutLog minerState) |
org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree |
FallThroughWithoutLogTauLoopStrict.fallThrough(DfgMsd graph,
MinerStateWithoutLog minerState) |
Modifier and Type | Method and Description |
---|---|
DfgMsd[] |
DfgMsdSplitter.split(DfgMsd graph,
Cut cut,
MinerStateWithoutLog minerState) |
DfgMsd[] |
SimpleDfgMsdSplitter.split(DfgMsd graph,
Cut cut,
MinerStateWithoutLog minerState) |
Modifier and Type | Method and Description |
---|---|
void |
PostProcessorWithoutLog.postProcess(org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree tree,
DfgMsd graph,
MinerStateWithoutLog minerState) |
Modifier and Type | Method and Description |
---|---|
DfgMsd[] |
MiningParametersIMWithoutLog.splitGraphConcurrent(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersIMWithoutLog.splitGraphInterleaved(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersIMWithoutLog.splitGraphLoop(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersIMWithoutLog.splitGraphOr(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersIMWithoutLog.splitGraphSequence(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |
DfgMsd[] |
MiningParametersIMWithoutLog.splitGraphXor(DfgMsd graph,
java.util.List<gnu.trove.set.TIntSet> partition,
MinerStateWithoutLog minerState) |