Linear Time Algorithms for Clustering Problems in Any Dimensions.
Amit KumarYogish SabharwalSandeep SenPublished in: ICALP (2005)
Keyphrases
- optimization problems
- approximate solutions
- test problems
- data sets
- synthetic and real datasets
- related problems
- np complete
- computationally efficient
- np hard problems
- difficult problems
- data mining tasks
- data clustering
- self organizing maps
- run times
- heuristic methods
- benchmark problems
- orders of magnitude
- theoretical analysis
- significant improvement
- k means
- combinatorial optimization
- machine learning algorithms
- unsupervised learning
- computational cost
- practical problems
- computational complexity
- data structure
- optimal solution
- computational geometry
- computational problems
- similarity measure
- learning algorithm