|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectorg.dllearner.core.AbstractComponent
org.dllearner.core.AbstractCELA
org.dllearner.algorithms.el.ELLearningAlgorithmDisjunctive
public class ELLearningAlgorithmDisjunctive
A learning algorithm for EL, which will based on an ideal refinement operator. The algorithm learns disjunctions of EL trees as follows: - given pos. and neg. examples, noise in %, min coverage per tree x % - it searches for an EL tree, which covers at least x % of all positive examples and at most (coverage_on_positives * noise) negative examples - the covered examples are removed from the pos. and neg. examples - termination: all(?) positive examples covered ev. besser: feste Suchzeiten pro Baum => es wird dann jeweils der beste Baum gewählt => Terminierung, wenn alles gecovered ist oder kein Baum mit ausreichender Qualität in dem Zeitfenster gefunden wird In contrast to many other algorithms, only one solution is returned. Additionally, the algorithm is not really an anytime algorithm, since the solution is constructed stepwise as a set of trees. Parameter optimisation: - runtime per tree: 10 seconds - tradeoff pos/neg: 1.0 1.2 1.4 1.6. 1.8 2.0 - min score: 0 -2.5 -5 -7.5 -10 - tests: 30 - runtime per test: 200 seconds => 2000 seconds cross val => 60000 seconds overall Next idea: - reduce tradeoff for each tree added (start with 2.0 and reduce by 0.1) - for the last tress it is not very important to cover less negatives - minimum is something between 0 and -1 (ensures that in the worst case as many positives as negatives are covered) - only high impact parameter is runtime (and maybe start tradeoff)
| Field Summary |
|---|
| Fields inherited from class org.dllearner.core.AbstractCELA |
|---|
MAX_NR_OF_RESULTS |
| Constructor Summary | |
|---|---|
ELLearningAlgorithmDisjunctive(PosNegLP problem,
AbstractReasonerComponent reasoner)
|
|
| Method Summary | |
|---|---|
static Collection<ConfigOption<?>> |
createConfigOptions()
|
Configurator |
getConfigurator()
For each component, a configurator class is generated in package org.dllearner.core.configurators using the script { org.dllearner.scripts.ConfigJavaGenerator}. |
Description |
getCurrentlyBestDescription()
|
EvaluatedDescription |
getCurrentlyBestEvaluatedDescription()
Returns the best descriptions obtained so far. |
static String |
getName()
|
SearchTreeNode |
getStartNode()
|
void |
init()
Method to be called after the component has been configured. |
boolean |
isRunning()
Returns whether the learning algorithm is running. |
void |
start()
Starts the algorithm. |
void |
stop()
Stops the algorithm gracefully. |
static Collection<Class<? extends AbstractLearningProblem>> |
supportedLearningProblems()
|
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public ELLearningAlgorithmDisjunctive(PosNegLP problem,
AbstractReasonerComponent reasoner)
| Method Detail |
|---|
public static String getName()
public static Collection<Class<? extends AbstractLearningProblem>> supportedLearningProblems()
public static Collection<ConfigOption<?>> createConfigOptions()
public Configurator getConfigurator()
AbstractComponent
getConfigurator in class AbstractComponent
public void init()
throws ComponentInitException
Component
ComponentInitException - This exception is thrown if any
exceptions occur within the initialisation process of this
component. As component developer, you are encouraged to
rethrow occuring exception as ComponentInitException and
giving an error message as well as the actualy exception by
using the constructor ComponentInitException.ComponentInitException(String, Throwable).public void start()
LearningAlgorithm
public void stop()
StoppableLearningAlgorithm
public boolean isRunning()
StoppableLearningAlgorithm
public Description getCurrentlyBestDescription()
getCurrentlyBestDescription in class AbstractCELAAbstractCELA.getCurrentlyBestEvaluatedDescription()public EvaluatedDescription getCurrentlyBestEvaluatedDescription()
AbstractCELA
getCurrentlyBestEvaluatedDescription in class AbstractCELApublic SearchTreeNode getStartNode()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||