A Branch and Bound Algorithm for Finding the Modes in Kernel Density Estimates.
Oliver WirjadiThomas M. BreuelPublished in: Int. J. Comput. Intell. Appl. (2009)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- maximum clique
- kernel density estimates
- upper bound
- np hard
- optimal solution
- lower bounding
- combinatorial optimization
- randomly generated problems
- search tree
- density estimation
- single machine scheduling problem
- upper bounding
- finding an optimal solution
- mean shift
- special case
- decision trees
- unsupervised learning
- search algorithm
- objective function
- reinforcement learning
- similarity measure