Learn More
  • C. Scott
  • IEEE Transactions on Signal Processing
  • 2005
In this paper we study the problem of pruning a binary tree by minimizing, over all pruned subtrees of the given tree, an objective function that combines an additive cost term with a penalty term that depends only on tree size. We present algorithms for general size-based penalties, although our focus is on subadditive penalties (roughly, penalties that(More)
Given a probability law P on d-dimensional Euclidean space, the minimum volume set (MV-set) with mass beta, 0 < beta < 1, is the set with smallest volume enclosing a probability mass of at least beta. We examine the use of support vector machines (SVMs) for estimating an MV-set from a collection of data points drawn from P, a problem with applications(More)
  • 1