Package | Description |
---|---|
org.dllearner.algorithms.celoe | |
org.dllearner.algorithms.ocel |
New experimental refinement operator approach, which takes
obtained information about concrete examples in an algorithm run
stronger into account.
|
org.dllearner.core |
Core structure of DL-Learner including the definition of component types and a component manager.
|
org.dllearner.utilities |
Utility classes.
|
org.dllearner.utilities.datastructures |
Utility classesfor manipulating general data structures.
|
Modifier and Type | Class and Description |
---|---|
class |
OENode
A node in the search tree of the ontology engineering algorithm.
|
Modifier and Type | Class and Description |
---|---|
class |
ExampleBasedNode
Represents a node in the search tree.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractSearchTreeNode<T extends AbstractSearchTreeNode> |
Modifier and Type | Method and Description |
---|---|
static <T extends AbstractSearchTreeNode> |
TreeUtils.getRefinementChainString(T node) |
static <T extends AbstractSearchTreeNode> |
TreeUtils.toTreeString(AbstractSearchTree<T> tree) |
static <T extends AbstractSearchTreeNode> |
TreeUtils.toTreeString(T node,
Heuristic<T> heuristic) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractSearchTree<T extends AbstractSearchTreeNode> |
class |
SearchTree<T extends AbstractSearchTreeNode> |
class |
SearchTreeNonWeak<T extends AbstractSearchTreeNode & WeakSearchTreeNode>
A Search Tree which does not maintain weak nodes in its set
|
class |
SearchTreeNonWeakPartialSet<T extends AbstractSearchTreeNode & WeakSearchTreeNode> |
class |
SynchronizedSearchTree<T extends AbstractSearchTreeNode> |
DL-Learner is licenced under the terms of the GNU General Public License.
Copyright © 2007-2019 Jens Lehmann