Almost tight recursion tree bounds for the Descartes method.
Arno EigenwilligVikram SharmaChee-Keng YapPublished in: ISSAC (2006)
Keyphrases
- clustering method
- computationally efficient
- objective function
- high precision
- tree structure
- high accuracy
- classification accuracy
- pairwise
- prior knowledge
- fully automatic
- similarity measure
- classification method
- synthetic data
- error rate
- optimization algorithm
- experimental evaluation
- upper bound
- detection algorithm
- detection method
- significant improvement
- input data
- segmentation method
- nearest neighbor
- computational cost