New Upper Bounds on Continuous Tree Edge-Partition Problem.
Robert BenkocziBinay K. BhattacharyaQiaosheng ShiPublished in: AAIM (2008)
Keyphrases
- upper bound
- lower bound
- binary tree
- tree structure
- upper and lower bounds
- tree construction
- efficiently computable
- tight bounds
- minimum spanning trees
- training data
- sample complexity
- hierarchical structure
- edge detection
- lower and upper bounds
- edge detector
- tree structures
- branch and bound
- tree models
- sample size
- worst case
- generalization error
- concept classes
- error probability