Package | Description |
---|---|
org.dllearner.algorithms.qtl |
Learning algorithm based on so-called query trees
which are a tree based representation of a (set of) RDF resource(s)
|
org.dllearner.algorithms.qtl.datastructures | |
org.dllearner.algorithms.qtl.datastructures.impl | |
org.dllearner.algorithms.qtl.filters | |
org.dllearner.algorithms.qtl.operations | |
org.dllearner.algorithms.qtl.operations.lgg | |
org.dllearner.algorithms.qtl.util |
Modifier and Type | Method and Description |
---|---|
static <N> boolean |
QueryTreeUtils.isSubsumedBy(QueryTree<N> tree1,
QueryTree<N> tree2)
Determines if tree1 is subsumed by tree2, i.e.
|
static <N> boolean |
QueryTreeUtils.isSubsumedBy(QueryTree<N> tree1,
QueryTree<N> tree2)
Determines if tree1 is subsumed by tree2, i.e.
|
static <N> boolean |
QueryTreeUtils.sameTrees(QueryTree<N>... trees)
Determines if the trees are equivalent from a subsumptional point of view.
|
static <N> boolean |
QueryTreeUtils.sameTrees(QueryTree<N> tree1,
QueryTree<N> tree2)
Determines if both trees are equivalent from a subsumptional point of
view.
|
static <N> boolean |
QueryTreeUtils.sameTrees(QueryTree<N> tree1,
QueryTree<N> tree2)
Determines if both trees are equivalent from a subsumptional point of
view.
|
Modifier and Type | Method and Description |
---|---|
QueryTree<N> |
QueryTree.getNodeById(int nodeId) |
QueryTree<N> |
QueryTree.getParent() |
QueryTree<N> |
QueryTree.getRoot() |
Modifier and Type | Method and Description |
---|---|
List<QueryTree<N>> |
QueryTree.getChildren() |
List<QueryTree<N>> |
QueryTree.getChildren(Object edge) |
List<QueryTree<N>> |
QueryTree.getChildrenClosure() |
List<QueryTree<N>> |
QueryTree.getLeafs() |
List<QueryTree<N>> |
QueryTree.getPathToRoot() |
Modifier and Type | Method and Description |
---|---|
void |
QueryTree.addChild(QueryTree<N> child,
Object edge) |
Object |
QueryTree.getEdge(QueryTree<N> child) |
boolean |
QueryTree.isSameTreeAs(QueryTree<N> tree) |
boolean |
QueryTree.isSubsumedBy(QueryTree<N> tree) |
boolean |
QueryTree.isSubsumedBy(QueryTree<N> tree,
boolean stopAfterError) |
boolean |
QueryTree.isSubsumedBy(QueryTree<N> tree,
QueryTreeImpl.LiteralNodeSubsumptionStrategy s) |
String |
NodeRenderer.render(QueryTree<N> node) |
boolean |
QueryTree.sameType(QueryTree<N> tree) |
void |
QueryTree.setParent(QueryTree<N> parent) |
Modifier and Type | Method and Description |
---|---|
void |
QueryTree.sortChildren(Comparator<QueryTree<N>> comparator) |
Modifier and Type | Class and Description |
---|---|
class |
QueryTreeImpl<N> |
Modifier and Type | Method and Description |
---|---|
QueryTree<N> |
QueryTreeImpl.getNodeById(int nodeId) |
QueryTree<N> |
QueryTreeImpl.getParent() |
QueryTree<N> |
GeneralisedQueryTree.getQueryTree() |
QueryTree<N> |
QueryTreeImpl.getRoot() |
QueryTree<N> |
QueryTreeImpl.getSPARQLQueryTree() |
Modifier and Type | Method and Description |
---|---|
List<QueryTree<N>> |
QueryTreeImpl.getChildren() |
List<QueryTree<N>> |
QueryTreeImpl.getChildren(Object edge) |
List<QueryTree<N>> |
QueryTreeImpl.getChildrenClosure() |
List<QueryTree<N>> |
QueryTreeImpl.getLeafs() |
List<QueryTree<N>> |
QueryTreeImpl.getPathToRoot() |
Modifier and Type | Method and Description |
---|---|
void |
QueryTreeImpl.addChild(QueryTree<N> child) |
void |
QueryTreeImpl.addChild(QueryTree<N> child,
Object edge) |
Object |
QueryTreeImpl.getEdge(QueryTree<N> child) |
boolean |
QueryTreeImpl.isSameTreeAs(QueryTree<N> tree) |
boolean |
QueryTreeImpl.isSubsumedBy(QueryTree<N> tree) |
boolean |
QueryTreeImpl.isSubsumedBy(QueryTree<N> tree,
boolean stopAfterError) |
boolean |
QueryTreeImpl.isSubsumedBy(QueryTree<N> tree,
QueryTreeImpl.LiteralNodeSubsumptionStrategy strategy) |
boolean |
QueryTreeImpl.sameType(QueryTree<N> tree) |
void |
QueryTreeImpl.setParent(QueryTree<N> parent) |
void |
GeneralisedQueryTree.setQueryTree(QueryTree<N> tree) |
Modifier and Type | Method and Description |
---|---|
void |
QueryTreeImpl.sortChildren(Comparator<QueryTree<N>> comparator) |
Constructor and Description |
---|
GeneralisedQueryTree(QueryTree<N> tree) |
GeneralisedQueryTree(QueryTree<N> tree,
List<QueryTreeChange> changes) |
QueryTreeImpl(QueryTree<N> tree) |
Modifier and Type | Method and Description |
---|---|
QueryTree<String> |
QueryTreeFilter.getFilteredQueryTree(QueryTree<String> tree) |
QueryTree<String> |
QuestionBasedQueryTreeFilterAggressive.getFilteredQueryTree(QueryTree<String> tree) |
QueryTree<String> |
KeywordBasedQueryTreeFilter.getFilteredQueryTree(QueryTree<String> tree) |
Modifier and Type | Method and Description |
---|---|
QueryTree<String> |
QueryTreeFilter.getFilteredQueryTree(QueryTree<String> tree) |
QueryTree<String> |
QuestionBasedQueryTreeFilterAggressive.getFilteredQueryTree(QueryTree<String> tree) |
QueryTree<String> |
KeywordBasedQueryTreeFilter.getFilteredQueryTree(QueryTree<String> tree) |
Modifier and Type | Method and Description |
---|---|
QueryTree<N> |
NBR.getPostLGG() |
Modifier and Type | Method and Description |
---|---|
String |
NBR.getQuestion(QueryTree<N> lgg,
List<QueryTree<N>> negTrees,
List<String> knownResources) |
void |
PostLGG.simplifyTree(QueryTree<N> tree,
List<QueryTree<N>> negTrees) |
Modifier and Type | Method and Description |
---|---|
String |
NBR.getQuestion(QueryTree<N> lgg,
List<QueryTree<N>> negTrees,
List<String> knownResources) |
void |
PostLGG.simplifyTree(QueryTree<N> tree,
List<QueryTree<N>> negTrees) |
Modifier and Type | Method and Description |
---|---|
QueryTree<N> |
EvaluatedQueryTree.getTree() |
Modifier and Type | Method and Description |
---|---|
Set<QueryTree<N>> |
EvaluatedQueryTree.getBaseQueryTrees() |
Collection<QueryTree<N>> |
EvaluatedQueryTree.getFalseNegatives() |
Collection<QueryTree<N>> |
EvaluatedQueryTree.getFalsePositives() |
Modifier and Type | Method and Description |
---|---|
void |
EvaluatedQueryTree.setBaseQueryTrees(Set<QueryTree<N>> baseQueryTrees) |
Constructor and Description |
---|
EvaluatedQueryTree(int id,
QueryTree<N> tree,
Collection<QueryTree<N>> falseNegatives,
Collection<QueryTree<N>> falsePositives,
QueryTreeScore score) |
EvaluatedQueryTree(QueryTree<N> tree,
Collection<QueryTree<N>> falseNegatives,
Collection<QueryTree<N>> falsePositives,
QueryTreeScore score) |
Constructor and Description |
---|
EvaluatedQueryTree(int id,
QueryTree<N> tree,
Collection<QueryTree<N>> falseNegatives,
Collection<QueryTree<N>> falsePositives,
QueryTreeScore score) |
EvaluatedQueryTree(int id,
QueryTree<N> tree,
Collection<QueryTree<N>> falseNegatives,
Collection<QueryTree<N>> falsePositives,
QueryTreeScore score) |
EvaluatedQueryTree(QueryTree<N> tree,
Collection<QueryTree<N>> falseNegatives,
Collection<QueryTree<N>> falsePositives,
QueryTreeScore score) |
EvaluatedQueryTree(QueryTree<N> tree,
Collection<QueryTree<N>> falseNegatives,
Collection<QueryTree<N>> falsePositives,
QueryTreeScore score) |
Modifier and Type | Method and Description |
---|---|
QueryTree<String> |
QueryTreeConverter.asQueryTree(org.semanticweb.owlapi.model.OWLClassExpression expression)
Converts a OWL class expression into a query tree, if possible.
|
Modifier and Type | Method and Description |
---|---|
org.semanticweb.owlapi.model.OWLClassExpression |
QueryTreeConverter.asOWLClassExpression(QueryTree<String> tree)
Returns a OWL class expression of the given query trees.
|
Set<org.semanticweb.owlapi.model.OWLClassExpression> |
QueryTreeConverter.asOWLClassExpressions(QueryTree<String> tree)
Returns a set of OWL class expression representations of the given query tree.
|
static String |
TreeHelper.getAbbreviatedTreeRepresentation(QueryTree tree,
String baseURI,
Map<String,String> prefixes) |
DL-Learner is licenced under the terms of the GNU General Public License.
Copyright © 2007-2019 Jens Lehmann