Package | Description |
---|---|
org.processmining.plugins.etm.mutation | |
org.processmining.plugins.etm.mutation.mutators | |
org.processmining.plugins.etm.mutation.mutators.maikelvaneck | |
org.processmining.plugins.etm.parameters | |
org.uncommonseditedbyjoosbuijs.watchmaker.framework |
This package provides a framework for evolutionary computation.
|
org.uncommonseditedbyjoosbuijs.watchmaker.framework.islands |
An implementation of island model evolution.
|
org.uncommonseditedbyjoosbuijs.watchmaker.framework.operators |
Provides several ready-to-use standard evolutionary operators for commonly
used data types such as arrays, lists and strings.
|
Modifier and Type | Class and Description |
---|---|
class |
GuidedTreeMutationCoordinator
Mutation operator for the trees of
Node s. |
class |
TreeCrossover<R extends NAryTree>
Cross-over operator for the trees of
Node s. |
class |
TreeMutationCoordinator
Mutation operator for the trees of
Node s. |
Modifier and Type | Class and Description |
---|---|
class |
GraduallyConsiderMoreEventClasses
This mutation operator tricks the whole ETM by instructing the
CentralRegistry to not 'show' all event
classes. |
class |
ShuffleCluster
Shuffles the order of the nodes in a randomly selected cluster
|
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 | Field and Description |
---|---|
protected java.util.List<EvolutionaryOperator<NAryTree>> |
ETMParamAbstract.evolutionaryOperators |
Modifier and Type | Method and Description |
---|---|
java.util.List<EvolutionaryOperator<NAryTree>> |
ETMParamAbstract.getEvolutionaryOperators() |
Modifier and Type | Method and Description |
---|---|
void |
ETMParamAbstract.setEvolutionaryOperators(java.util.List<EvolutionaryOperator<NAryTree>> evolutionaryOperators) |
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 | Field and Description |
---|---|
protected EvolutionaryOperator<T> |
GenerationalEvolutionEngine.evolutionScheme |
Constructor and Description |
---|
EvolutionStrategyEngine(CandidateFactory<T> candidateFactory,
EvolutionaryOperator<T> evolutionScheme,
FitnessEvaluator<? super T> fitnessEvaluator,
boolean plusSelection,
int offspringMultiplier,
java.util.Random rng)
Creates a new engine for an evolution strategy.
|
GenerationalEvolutionEngine(CandidateFactory<T> candidateFactory,
EvolutionaryOperator<T> evolutionScheme,
FitnessEvaluator<? super T> fitnessEvaluator,
SelectionStrategy<? super T> selectionStrategy,
java.util.Random rng)
Creates a new evolution engine by specifying the various components
required by a generational evolutionary algorithm.
|
GenerationalEvolutionEngine(CandidateFactory<T> candidateFactory,
EvolutionaryOperator<T> evolutionScheme,
InteractiveSelection<T> selectionStrategy,
java.util.Random rng)
Creates a new evolution engine for an interactive evolutionary algorithm.
|
SteadyStateEvolutionEngine(CandidateFactory<T> candidateFactory,
EvolutionaryOperator<T> evolutionScheme,
FitnessEvaluator<? super T> fitnessEvaluator,
SelectionStrategy<? super T> selectionStrategy,
int selectionSize,
boolean forceSingleCandidateUpdate,
java.util.Random rng)
Create a steady-state evolution strategy in which one or more (usually
just one) evolved offspring replace randomly-chosen individuals.
|
Constructor and Description |
---|
IslandEvolution(int islandCount,
Migration migration,
CandidateFactory<T> candidateFactory,
EvolutionaryOperator<T> evolutionScheme,
FitnessEvaluator<? super T> fitnessEvaluator,
SelectionStrategy<? super T> selectionStrategy,
java.util.Random rng)
Create an island system with the specified number of
identically-configured islands.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractCrossover<T>
Generic base class for cross-over implementations.
|
class |
BitStringCrossover
Cross-over with a configurable number of points (fixed or random) for
bit strings.
|
class |
BitStringMutation
Mutation of individual bits in a
BitString according to some
probability. |
class |
ByteArrayCrossover
Cross-over with a configurable number of points (fixed or random) for
arrays of primitive bytes.
|
class |
CharArrayCrossover
Cross-over with a configurable number of points (fixed or random) for
arrays of primitive chars.
|
class |
DoubleArrayCrossover
Cross-over with a configurable number of points (fixed or random) for
arrays of primitive doubles.
|
class |
EvolutionPipeline<T>
A compound evolutionary operator that applies multiple operators (of the
same type) in series.
|
class |
IdentityOperator<T>
Evolutionary operator that simply returns the selected candidates unaltered.
|
class |
IntArrayCrossover
Cross-over with a configurable number of points (fixed or random) for
arrays of primitive ints.
|
class |
ListCrossover<T>
Variable-point (fixed or random) cross-over for arbitrary lists.
|
class |
ListInversion<T>
An evolutionary operator that randomly reverses a subsection of a list.
|
class |
ListOperator<T>
A higher-order evolutionary operator that is applied to populations made
up of lists.
|
class |
ListOrderCrossover<T>
Implements ordered cross-over between arbitrary lists.
|
class |
ListOrderMutation<T>
A special mutation implementation that instead of changing the
genes of the candidate, re-orders them.
|
class |
ObjectArrayCrossover<T>
Cross-over with a configurable number of points (fixed or random) for
arrays of reference types.
|
class |
Replacement<T>
An evolutionary operator that replaces individuals with randomly-generated
new individuals, according to some specified probability.
|
class |
SplitEvolution<T>
Compound evolutionary operator that allows the evolution of a population
to be split into two separate streams.
|
class |
StringCrossover
Variable-point (fixed or random) cross-over for String candidates.
|
class |
StringMutation
Mutation of individual characters in a string according to some
probability.
|
Constructor and Description |
---|
ListOperator(EvolutionaryOperator<T> delegate) |
SplitEvolution(EvolutionaryOperator<T> operator1,
EvolutionaryOperator<T> operator2,
double weight) |
SplitEvolution(EvolutionaryOperator<T> operator1,
EvolutionaryOperator<T> operator2,
double weight) |
SplitEvolution(EvolutionaryOperator<T> operator1,
EvolutionaryOperator<T> operator2,
org.uncommons.maths.number.NumberGenerator<java.lang.Double> weightVariable) |
SplitEvolution(EvolutionaryOperator<T> operator1,
EvolutionaryOperator<T> operator2,
org.uncommons.maths.number.NumberGenerator<java.lang.Double> weightVariable) |
Constructor and Description |
---|
EvolutionPipeline(java.util.List<EvolutionaryOperator<T>> pipeline)
Creates a pipeline consisting of the specified operators in
the order that they are supplied.
|