An Efficient Algorithm for Node-Weighted Tree Partitioning with Subtrees' Weights in a Given Range.
Guangchun LuoHao ChenCaihui QuYuhai LiuKe QinPublished in: IEICE Trans. Inf. Syst. (2013)
Keyphrases
- tree structure
- objective function
- cost function
- dynamic programming
- detection algorithm
- computational complexity
- pattern tree
- tree construction
- binary tree
- graph structure
- k means
- optimal solution
- expectation maximization
- computationally efficient
- segmentation algorithm
- simulated annealing
- index structure
- probabilistic model
- np hard
- weighted sum
- weight vector
- hidden nodes
- weight function
- space partitioning
- neural network