Generating Optimum Number of Clusters Using Median Search and Projection Algorithms.
Suresh LJay B. SimhaRajappa VelurPublished in: AINA Workshops (2010)
Keyphrases
- computational complexity
- search algorithm
- small number
- constant factor approximation
- search space
- heuristic search algorithms
- computationally efficient
- theoretical analysis
- orders of magnitude
- data clustering
- cluster analysis
- agglomerative hierarchical clustering
- run times
- search problems
- approximation algorithms
- memory requirements
- times faster
- worst case
- computational cost
- search methods
- learning algorithm
- global optimum
- space complexity
- dimensionality reduction
- initial set
- significant improvement
- suboptimal solutions
- objective function