| Package | Description |
|---|---|
| org.aksw.limes.core.datastrutures | |
| org.aksw.limes.core.ml.algorithm | |
| org.aksw.limes.core.ml.algorithm.wombat |
| Modifier and Type | Method and Description |
|---|---|
Tree<T> |
Tree.getParent() |
| Modifier and Type | Method and Description |
|---|---|
List<Tree<T>> |
Tree.getchildren() |
Set<Tree<T>> |
Tree.getLeaves() |
| Modifier and Type | Method and Description |
|---|---|
void |
Tree.addChild(Tree<T> child) |
void |
Tree.removeChild(Tree<T> child) |
| Constructor and Description |
|---|
Tree(Tree<T> parent,
T value,
List<Tree<T>> childrenlist) |
| Constructor and Description |
|---|
Tree(Tree<T> parent,
T value,
List<Tree<T>> childrenlist) |
| Modifier and Type | Method and Description |
|---|---|
protected List<RefinementNode> |
WombatSimple.getBestKNodes(Tree<RefinementNode> r,
int k) |
protected TreeSet<RefinementNode> |
WombatSimple.getSortedNodes(Tree<RefinementNode> r,
double penaltyWeight,
TreeSet<RefinementNode> result) |
protected void |
WombatSimple.updateScores(Tree<RefinementNode> r)
update F-Measure of the refinement tree r
based on either training data or PFM
|
| Modifier and Type | Method and Description |
|---|---|
protected <T extends RefinementNode> |
AWombat.getBestNode(Tree<T> root)
Get the most promising node as the node with the best F-score
|
protected <T extends RefinementNode> |
AWombat.getMostPromisingNode(Tree<T> root)
Get the most promising node as the node with the best F-score
|
| Modifier and Type | Method and Description |
|---|---|
protected <T extends RefinementNode> |
AWombat.getBestNode(Tree<T> root)
Get the most promising node as the node with the best F-score
|
protected AMapping |
AWombat.getMappingOfMetricExpression(String metricExpression,
Tree<? extends RefinementNode> root)
Looks first for the input metricExpression in the already constructed
tree, if found the corresponding mapping is returned.
|
protected <T extends RefinementNode> |
AWombat.getMostPromisingNode(Tree<T> root)
Get the most promising node as the node with the best F-score
|
Copyright © 2020. All rights reserved.