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 Object
------------------------------------------------------------------

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    (package private) double[]
    beta
    invalid input: '<' Total number of entries (= # active nodes)
    (package private) int[]
    bidx
    invalid input: '<' Minimum distance to an entry
    (package private) double[]
    costs
    invalid input: '<' Array of parents
    (package private) int
    nentries
    invalid input: '<' Entires to nodes
    (package private) int
    nlabels
    invalid input: '<' Number of feature values
    (package private) int[]
    nodes
     
    (package private) int
    nvalues
    invalid input: '<' Marginal.
    (package private) int
    nwhich
    invalid input: '<' List of entries to update
    (package private) int[]
    parents
    invalid input: '<' Number of labels
    (package private) double[]
    Pc
    invalid input: '<' Marginal.
    (package private) double[][]
    Pcx
    invalid input: '<' Number of entries to update
    (package private) double[]
    Px
    invalid input: '<' Joint probability table
    (package private) int
    verbosity
    invalid input: '<' Cost of each merge
    (package private) int[]
    which
    invalid input: '<' Closest entry

  • Constructor Summary

    Constructors
    Constructor
    Description
    VlAIB()
     

  • Method Summary

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Field Details

    • nodes

      int[] nodes

    • nentries

      int nentries
      invalid input: '<' Entires to nodes

    • beta

      double[] beta
      invalid input: '<' Total number of entries (= # active nodes)

    • bidx

      int[] bidx
      invalid input: '<' Minimum distance to an entry

    • which

      int[] which
      invalid input: '<' Closest entry

    • nwhich

      int nwhich
      invalid input: '<' List of entries to update

    • Pcx

      double[][] Pcx
      invalid input: '<' Number of entries to update

    • Px

      double[] Px
      invalid input: '<' Joint probability table

    • Pc

      double[] Pc
      invalid input: '<' Marginal.

    • nvalues

      int nvalues
      invalid input: '<' Marginal.

    • nlabels

      int nlabels
      invalid input: '<' Number of feature values

    • parents

      int[] parents
      invalid input: '<' Number of labels

    • costs

      double[] costs
      invalid input: '<' Array of parents

    • verbosity

      int verbosity
      invalid input: '<' Cost of each merge

  • Constructor Details

    • VlAIB

      VlAIB()