- Main Page
- Data Structures
- Files
- Related Pages

- Alphabetical List
- Data Structures
- Data Fields

# _VlAIB Struct Reference

AIB algorithm data. More...

## Data Fields
vl_aib_node * | nodes
vl_aib_node | nentries
vl_double * | beta
vl_aib_node * | bidx
vl_aib_node * | which
vl_aib_node | nwhich
vl_aib_prob * | Pcx
vl_aib_prob * | Px
vl_aib_prob * | Pc
vl_uint | nvalues
vl_uint | nlabels

## Detailed Description

For internal use only.

The implementation is quite straightforward, but the way feature values are handled in order to support efficiently joins, deletions and re-arrangement needs to be explaiend. This is achieved by a layer of indrirection:

- Call each feature value (either original or obtained by a join operation) node. Nodes are idenitfied by numbers.
- Call the elements of various array (such as VlAIB::Px) entry.
- Entry are dynamically associated to nodes as specified by VlAIB::nodes. So `Px`[i] actually refers to the node `nodes`[i].

## Field Documentation

vl_aib_node* _VlAIB::nodes

Entires to nodes

vl_aib_node _VlAIB::nentries

Total number of entries (= # active nodes)

vl_double* _VlAIB::beta

Minimum distance to an entry

vl_aib_node* _VlAIB::bidx

Closest entry

vl_aib_node* _VlAIB::which

List of entries to update

vl_aib_node _VlAIB::nwhich

Number of entries to update

vl_aib_prob* _VlAIB::Pcx

Joint probability table

vl_aib_prob* _VlAIB::Px

Marginal.

vl_aib_prob* _VlAIB::Pc

Marginal.

vl_uint _VlAIB::nvalues

Number of feature values

vl_uint _VlAIB::nlabels

Number of labels

The documentation for this struct was generated from the following file:

- aib.c