A Voronoi Diagram Approach to Autonomous Clustering
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 149-160
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Autonomous k-Means Clustering2005
- A Simple Linear Time (1+ ∊) -Approximation Algorithm for k-Means Clustering in Any Dimensions2004
- Kernel Methods for Pattern Analysis2004
- A General Approach to Clustering in Large Databases with NoiseKnowledge and Information Systems, 2003
- Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.2000
- Data clusteringACM Computing Surveys, 1999
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- A Voronoi diagram based adaptive k-means-type clustering algorithm for multidimensional weighted dataLecture Notes in Computer Science, 1991
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- Some Applications of Monotone Operators in Markov ProcessesThe Annals of Mathematical Statistics, 1965