Variance-based k-clustering algorithms by voronoi diagrams and randomization

IEICE Transactions on Information and Systems

Volumn E83-D, Issue 6, 2000, Pages 1199-1206

  Inaba, Mary ^a   Katoh, Naoki ^a   Imai, Hiroshi ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Geometric clustering; Randomization; Voronoi diagram

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

GEOMETRIC CLUSTERING; VORONOI DIAGRAM;

COMPUTATIONAL GEOMETRY;

EID: 0033707141     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. T. Asano, B. Bhattacharya, M. Keil, and F. Yao, "Clustering algorithms based on minimum and maximum spanning trees," Proc. 4th Annual Symp. on Computational Geometry, pp.252-257, Urbana, 1988.
2. P. Auer, R.C. Holte, and W. Maass, 'Theory and applications of agnostic PAC-learning with small decision trees," Proc. 12th Int. Conf. on Machine Learning, pp.2129, Morgan Kaufmann, 1995.
3. E. Boros and P.L. Hammer, "On clustering problems with connected optima in Euclidean spaces," Discrete Mathematics, vol.75, pp.81-88, 1989.
4. V. Capoyleas, G. Rote, and G. Woeginger, "Geometric clustering," J. Algorithms, vol.12, pp.341-35G, 1991.
5. T. Feder and D.H. Grcene, ''Optimal algorithms for approximate clustering," Proc. 20th Annual ACM Symp. on Theory of Computing, pp.434-444, 1988.
6. A. Gersho and R.M. Gray, Vector Quantization and Signal Compression, Klmver Academic, 1992.
7. J. Hagauer and G. Rote, "Three-clustering of points in the plane," Computational Geometry: Theory and Applications, vol.8, no.2, pp.87-95, 1997.
8. S. Hasegawa, A Study on e-Net and e-Approximation, Master's Thesis, Department of Information Science, University of Tokyo, 1993.
9. S. Hasegawa, H. Imai, M. Inaba, N. Katoh, and J. Nakano, "Efficient algorithms for variance-based k-clustering," Proc. 1st Pacific Conf. on Computer Graphics and Applications, World Scientific, pp.75-89, 1993.
10. S. Hasegawa, II. Imai, and M. Ishiguro, "e-approximations of fc-labcl spaces," Theoretical Computer Science, vol.137, pp.MS-175, 1995.
11. P. Heckbcrt, "Color image quantization frame buffer display," ACM Trans, on Computer Graphics, vol.16, no.3, pp.297-304, 1982.
12. J. Hershberger, "Minimizing the sum of diameters efficiently," Computational Geometry: Theory and Applications, vol.2, pp.111-118, 1992.
13. M. Inaba, H. Imai, and N. Katoh, "Experimental results of randomized clustering algorithm," Proc. 12th Annual ACM Symp. on Computational Geometry, pp.Cl-C2, 1990.
14. M. Inaba, N. Katoh, and H. Imai, "Applications of weighted Voronoi diagrams and randomization to variance-based kclustering," Proc. 10th ACM Symp. on Computational Geometry, pp.332-339, 1994.
15. H. Imai and M. Inaba, "Geometric clustering with applications," Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), vol.76, Suppl., pp.183-186, 199G.
16. [IG] M. Inaba and H. Imai, "The number of partitions of n points induced by the Voronoi diagram via the conjugacy generated by k points," "Proc. 1st Japanese-Hungarian Symp. on Discrete Mathematics and Its Applications, pp.83-90, Kyoto, March 1999.
17. M. Ishiguro, Evaluation of Combinatorial Complexity for Hypothesis Spaces in Learning Theory with Applications, Master's Thesis, Department of Information Science, University of Tokyo, 1994.
18. N. Katoh and T. Ibaraki, "A parametric characterization and an t-approximation scheme for the minimization of a quasiconcave program," Discrete Applied Mathematics, vol.17, pp.39-66, 1987.
19. B.W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," The Bell System Technical J., vol.49, no.2, pp.291-307, 1970.
20. N. Megiddo and K.J. Supowit, "On the complexity of some common geometric location problems," SIAM J. Computing, vol.13, pp.182-190, 1984.
21. B. Mirkin, "Mathematical classification and clustering," Nonconvex Optimization and Its Applications Series, vol.11, Kluwer Academic Publishers, Boston, 1996.
22. S.J. Wan, S.K.M. Wong, and P. Prusinkiewicz, "An algorithm for multidimensional data clustering," ACM Trans. Mathematical Software, vol.14, no.2, pp.153-162, 1988.
23. H.E. Warren, "Lower bounds for approximation by nonlinear manifolds," Amer. Math. Soc., vol.133, pp.167-178, 1968.