Package | Description |
---|---|
de.tudresden.inf.lat.jcel.core.algorithm.cel |
Provides interfaces and classes to run the classification
algorithm of CEL.
|
de.tudresden.inf.lat.jcel.core.algorithm.common |
Provides common interfaces and classes to run the
classification algorithm.
|
de.tudresden.inf.lat.jcel.core.algorithm.rulebased |
Provides interfaces and classes to run a classification
algorithm based on completion rules.
|
de.tudresden.inf.lat.jcel.core.graph |
Provides interfaces and classes used to represent the data
during the classification process.
|
Modifier and Type | Method and Description |
---|---|
IntegerHierarchicalGraph |
CelProcessor.getClassHierarchy() |
IntegerHierarchicalGraph |
CelProcessor.getDataPropertyHierarchy() |
IntegerHierarchicalGraph |
CelProcessor.getObjectPropertyHierarchy() |
Modifier and Type | Method and Description |
---|---|
IntegerHierarchicalGraph |
Processor.getClassHierarchy()
Returns the class hierarchy after the classification has finished.
|
IntegerHierarchicalGraph |
Processor.getDataPropertyHierarchy()
Returns the data property hierarchy after the classification has
finished.
|
IntegerHierarchicalGraph |
Processor.getObjectPropertyHierarchy()
Returns the object property hierarchy after the classification has
finished.
|
Modifier and Type | Method and Description |
---|---|
IntegerHierarchicalGraph |
RuleBasedProcessor.getClassHierarchy() |
IntegerHierarchicalGraph |
RuleBasedProcessor.getDataPropertyHierarchy() |
IntegerHierarchicalGraph |
RuleBasedProcessor.getObjectPropertyHierarchy() |
Modifier and Type | Class and Description |
---|---|
class |
IntegerHierarchicalGraphImpl
This class implements the algorithm that computes the class hierarchy from
the subsumer set.
|
Modifier and Type | Method and Description |
---|---|
void |
IntegerHierarchicalGraphImpl.disjointUnion(IntegerHierarchicalGraph otherGraph)
Makes a disjoint union with another graph.
|
Copyright © 2009–2015 Chair of Automata Theory - TU Dresden. All rights reserved.