See: Description
Interface | Description |
---|---|
SearchTreeNode |
Interface for search tree nodes, which are used in various algorithms.
|
SearchTreePartialSet<T> | |
WeakSearchTreeNode |
Class | Description |
---|---|
AbstractSearchTree<T extends AbstractSearchTreeNode> | |
DescriptionSubsumptionTree |
This class takes Descritptions and a reasoner and orders the
descriptions by subsumption into a tree, represented by the internal class "Node"
|
MapToStringTupleListConverter |
Created by IntelliJ IDEA.
|
RDFNodeTuple |
A container which can hold two Strings, mainly used as a helper.
|
SearchTree<T extends AbstractSearchTreeNode> | |
SearchTreeNonWeak<T extends AbstractSearchTreeNode & WeakSearchTreeNode> |
A Search Tree which does not maintain weak nodes in its set
|
SearchTreeNonWeakPartialSet<T extends AbstractSearchTreeNode & WeakSearchTreeNode> | |
SetManipulation | |
SortedSetTuple<T> |
Convenience data structure for keeping positive and negative examples in a single structure.
|
StringTuple |
A container which can hold two Strings, mainly used as a helper.
|
SynchronizedSearchTree<T extends AbstractSearchTreeNode> |
Utility classesfor manipulating general data structures. Note that OWL related datastructures have their own package.
DL-Learner is licenced under the terms of the GNU General Public License.
Copyright © 2007-2019 Jens Lehmann