| Package | Description |
|---|---|
| cc.kave.repackaged.jayes | |
| cc.kave.repackaged.jayes.factor | |
| cc.kave.repackaged.jayes.inference.junctionTree | |
| cc.kave.repackaged.jayes.internal.util |
| Modifier and Type | Method and Description |
|---|---|
AbstractFactor |
BayesNode.getFactor() |
| Modifier and Type | Class and Description |
|---|---|
class |
DenseFactor |
class |
SparseFactor |
| Modifier and Type | Method and Description |
|---|---|
AbstractFactor |
AbstractFactor.clone() |
AbstractFactor |
FactorFactory.create(List<Integer> vars,
List<AbstractFactor> multiplicationPartners)
creates a factor, the class of which is dependent on different criteria defined in the concrete subclasses.
|
| Modifier and Type | Method and Description |
|---|---|
static SparseFactor |
SparseFactor.fromFactor(AbstractFactor f) |
protected boolean |
FactorFactory.getUseLogScale(AbstractFactor f) |
static boolean |
SparseFactor.isSuitable(int futureLength,
AbstractFactor... multiplicationCandidates)
approximates whether creating a sparse factor will save memory compared to a dense factor
|
void |
AbstractFactor.multiplyCompatible(AbstractFactor compatible)
multiply the factors.
|
void |
SparseFactor.multiplyCompatible(AbstractFactor compatible) |
void |
AbstractFactor.multiplyCompatibleToLog(AbstractFactor factor) |
abstract int[] |
AbstractFactor.prepareMultiplication(AbstractFactor compatible) |
int[] |
DenseFactor.prepareMultiplication(AbstractFactor compatible)
prepares multiplication by precomputing the corresponding array positions in the compatible Factor
|
int[] |
SparseFactor.prepareMultiplication(AbstractFactor compatible) |
void |
SparseFactor.sparsify(AbstractFactor... compatible)
Prepares the factor in the sense that it's internal structures are optimized according to the zero/non-zero
structure of the factors that will be multiplied in.
|
| Modifier and Type | Method and Description |
|---|---|
AbstractFactor |
FactorFactory.create(List<Integer> vars,
List<AbstractFactor> multiplicationPartners)
creates a factor, the class of which is dependent on different criteria defined in the concrete subclasses.
|
| Constructor and Description |
|---|
Cut(AbstractFactor factor) |
| Modifier and Type | Field and Description |
|---|---|
protected AbstractFactor[] |
JunctionTreeAlgorithm.nodePotentials |
protected AbstractFactor[] |
JunctionTreeAlgorithm.queryFactors |
| Modifier and Type | Field and Description |
|---|---|
protected List<Pair<AbstractFactor,IArrayWrapper>> |
JunctionTreeAlgorithm.initializations |
protected Map<Graph.Edge,AbstractFactor> |
JunctionTreeAlgorithm.sepSets |
| Modifier and Type | Method and Description |
|---|---|
static int[] |
AddressCalc.computeLinearMap(AbstractFactor factor,
int... dimensionIDs)
computes a mapping from the factors' addresses to the corresponding index of the flat value array of a factor
consisting of the dimensions with the given dimensionIDs.
|
Copyright © 2018. All rights reserved.