Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.
Jianer ChenHenning FernauIyad A. KanjGe XiaPublished in: SIAM J. Comput. (2007)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- running times
- branch and bound algorithm
- constant factor
- branch and bound
- np hard
- vc dimension
- support vector
- feature space
- worst case
- linear programming
- kernel function
- memory requirements
- objective function
- efficiently computable
- concept classes
- optimal cost
- kernel methods
- upper bounding
- reproducing kernel hilbert space
- sample size
- loss function
- theoretical analysis
- optimal solution