Package gov.nih.mipav.model.algorithms
Class AgglomerativeInformationBottleneck.VlAIB
- java.lang.Object
-
- gov.nih.mipav.model.algorithms.AgglomerativeInformationBottleneck.VlAIB
-
- Enclosing class:
- AgglomerativeInformationBottleneck
class AgglomerativeInformationBottleneck.VlAIB extends java.lang.Object
------------------------------------------------------------------
-
-
Field Summary
Fields Modifier and Type Field Description (package private) double[]
beta
< Total number of entries (= # active nodes)(package private) int[]
bidx
< Minimum distance to an entry(package private) double[]
costs
< Array of parents(package private) int
nentries
< Entires to nodes(package private) int
nlabels
< Number of feature values(package private) int[]
nodes
(package private) int
nvalues
< Marginal.(package private) int
nwhich
< List of entries to update(package private) int[]
parents
< Number of labels(package private) double[]
Pc
< Marginal.(package private) double[][]
Pcx
< Number of entries to update(package private) double[]
Px
< Joint probability table(package private) int
verbosity
< Cost of each merge(package private) int[]
which
< Closest entry
-
Constructor Summary
Constructors Constructor Description VlAIB()
-
-
-
Field Detail
-
nodes
int[] nodes
-
nentries
int nentries
< Entires to nodes
-
beta
double[] beta
< Total number of entries (= # active nodes)
-
bidx
int[] bidx
< Minimum distance to an entry
-
which
int[] which
< Closest entry
-
nwhich
int nwhich
< List of entries to update
-
Pcx
double[][] Pcx
< Number of entries to update
-
Px
double[] Px
< Joint probability table
-
Pc
double[] Pc
< Marginal.
-
nvalues
int nvalues
< Marginal.
-
nlabels
int nlabels
< Number of feature values
-
parents
int[] parents
< Number of labels
-
costs
double[] costs
< Array of parents
-
verbosity
int verbosity
< Cost of each merge
-
-