org.processmining.indulpetminer.mining.bottomcut

Class BottomCutFinderAbstract

java.lang.Object

org.processmining.indulpetminer.mining.bottomcut.BottomCutFinderAbstract

All Implemented Interfaces:

BottomCutFinder

Direct Known Subclasses:

BottomCutFinderConcurrent, BottomCutFinderLoop, BottomCutFinderSequence

public abstract class BottomCutFinderAbstract
extends java.lang.Object
implements BottomCutFinder

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	BottomCutFinderAbstract.Type

Constructor Summary

Constructors

Constructor and Description
BottomCutFinderAbstract(BottomCutFinderAbstract.Type type, BottomCut.Operator operator)

Method Summary

Modifier and Type	Method and Description
protected void	checkPossibility(long possibilityNumber, int[] activities, org.processmining.plugins.inductiveminer2.logs.IMTraceIterator it, org.processmining.plugins.inductiveminer2.logs.IMLog log, org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo, BottomCutFinderResult result, org.processmining.plugins.inductiveminer2.mining.MinerState minerState, long end) Level 2: possibilities.
void	find(org.processmining.plugins.inductiveminer2.logs.IMLog log, org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo, BottomCutFinderResult result, org.processmining.plugins.inductiveminer2.mining.MinerState minerState) In this function, try all possible sets of activities.
protected void	findCutWithActivities(org.processmining.plugins.inductiveminer2.logs.IMTraceIterator it, org.processmining.plugins.inductiveminer2.logs.IMLog log, org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo, int[] useActivities, int[] allActivities, BottomCutFinderResult result, org.processmining.plugins.inductiveminer2.mining.MinerState minerState, long end) Level 3.
protected boolean	fitsGlobalDirectlyFollows(org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo, int[] activitiesA, int[] activitiesB) Check whether the sets of A and B are in the correct relation.
protected abstract boolean	fitsGlobalDirectlyFollowsAB(org.processmining.plugins.inductiveminer2.helperclasses.IntDfg normalisedIntDfg, int normalisedA, int normalisedB)
protected abstract boolean	fitsGlobalDirectlyFollowsABC(org.processmining.plugins.inductiveminer2.helperclasses.IntDfg normalisedIntDfg, int normalisedA, int normalisedB, int normalisedC)
protected boolean	fitsLocalDirectlyFollows(org.processmining.plugins.inductiveminer2.logs.IMLog log, org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo, int[] activitiesA, int[] activitiesB) Finds the projected start and end activities and outsources the check whether this suits the chosen cut.
protected abstract boolean	fitsLocalStartEnd(gnu.trove.set.TIntSet leftStartA, gnu.trove.set.TIntSet leftStartB, gnu.trove.set.TIntSet leftEndA, gnu.trove.set.TIntSet leftEndB, int[] activitiesA, int[] activitiesB)
static long	pow(int x)

Methods inherited from class java.lang.Object

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

Constructor Detail

BottomCutFinderAbstract

public BottomCutFinderAbstract(BottomCutFinderAbstract.Type type,
                               BottomCut.Operator operator)

Method Detail

fitsGlobalDirectlyFollowsAB

protected abstract boolean fitsGlobalDirectlyFollowsAB(org.processmining.plugins.inductiveminer2.helperclasses.IntDfg normalisedIntDfg,
                                                       int normalisedA,
                                                       int normalisedB)

Parameters:

normalisedIntDfg -

normalisedA -

normalisedB -

Returns:

whether activity a and b can be in the correct relation.

fitsGlobalDirectlyFollowsABC

protected abstract boolean fitsGlobalDirectlyFollowsABC(org.processmining.plugins.inductiveminer2.helperclasses.IntDfg normalisedIntDfg,
                                                        int normalisedA,
                                                        int normalisedB,
                                                        int normalisedC)

Parameters:

normalisedIntDfg -

normalisedA -

normalisedB -

normalisedC -

Returns:

whether C does not violate the relation between A and B

fitsLocalStartEnd

protected abstract boolean fitsLocalStartEnd(gnu.trove.set.TIntSet leftStartA,
                                             gnu.trove.set.TIntSet leftStartB,
                                             gnu.trove.set.TIntSet leftEndA,
                                             gnu.trove.set.TIntSet leftEndB,
                                             int[] activitiesA,
                                             int[] activitiesB)

Parameters:

leftStartA -

leftStartB -

leftEndA -

leftEndB -

activitiesA -

activitiesB -

Returns:

whether A and B do not violate the local start/end activity requirements.

find

public void find(org.processmining.plugins.inductiveminer2.logs.IMLog log,
                 org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo,
                 BottomCutFinderResult result,
                 org.processmining.plugins.inductiveminer2.mining.MinerState minerState)

In this function, try all possible sets of activities. Level 1: top-level with multithreading.

Specified by:

find in interface BottomCutFinder

checkPossibility

protected void checkPossibility(long possibilityNumber,
                                int[] activities,
                                org.processmining.plugins.inductiveminer2.logs.IMTraceIterator it,
                                org.processmining.plugins.inductiveminer2.logs.IMLog log,
                                org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo,
                                BottomCutFinderResult result,
                                org.processmining.plugins.inductiveminer2.mining.MinerState minerState,
                                long end)

Level 2: possibilities.

Parameters:

possibilityNumber -

activities -

chosen -

it -

log -

logInfo -

minerState -

end -

findCutWithActivities

protected void findCutWithActivities(org.processmining.plugins.inductiveminer2.logs.IMTraceIterator it,
                                     org.processmining.plugins.inductiveminer2.logs.IMLog log,
                                     org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo,
                                     int[] useActivities,
                                     int[] allActivities,
                                     BottomCutFinderResult result,
                                     org.processmining.plugins.inductiveminer2.mining.MinerState minerState,
                                     long end)

Level 3. In this function, try all possible partial cuts that can be made using all the given activities.

Parameters:

log -

logInfo -

useActivities -

result -

minerState -

end -

pow

public static long pow(int x)

fitsGlobalDirectlyFollows

protected boolean fitsGlobalDirectlyFollows(org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo,
                                            int[] activitiesA,
                                            int[] activitiesB)

Check whether the sets of A and B are in the correct relation.

Parameters:

normalisedIntDfg -

activitiesA -

activitiesB -

Returns:

fitsLocalDirectlyFollows

protected boolean fitsLocalDirectlyFollows(org.processmining.plugins.inductiveminer2.logs.IMLog log,
                                           org.processmining.plugins.inductiveminer2.loginfo.IMLogInfo logInfo,
                                           int[] activitiesA,
                                           int[] activitiesB)

Finds the projected start and end activities and outsources the check whether this suits the chosen cut.

Parameters:

log -

logInfo -

activitiesA -

activitiesB -

Returns: