A linear time deterministic algorithm to find a small subset that approximates the centroid.
Pratik WorahSandeep SenPublished in: Inf. Process. Lett. (2007)
Keyphrases
- optimal solution
- experimental evaluation
- dynamic programming
- k means
- high accuracy
- computational complexity
- detection algorithm
- theoretical analysis
- cost function
- np hard
- selection algorithm
- preprocessing
- learning algorithm
- matching algorithm
- computational cost
- worst case
- classification algorithm
- times faster
- improved algorithm
- search space
- similarity measure
- neural network
- recognition algorithm
- data sets
- minimum length
- convergence rate
- particle swarm optimization
- linear programming
- probabilistic model
- objective function