Tsallis entropy as a lower bound of average description length for the q-generalized code tree.
Hiroki SuyariPublished in: ISIT (2007)
Keyphrases
- lower bound
- upper bound
- objective function
- path length
- branch and bound
- optimal solution
- branch and bound algorithm
- tree structure
- high level
- np hard
- lower and upper bounds
- lower bounding
- source code
- tree search
- tree nodes
- standard deviation
- tree models
- arbitrary length
- tree construction
- binary tree
- tree structures
- r tree
- database systems