Abstract
This talk surveys howgeometric information can be effectively used for efficient algorithms with focus on clustering problems. Given a complete weighted graph G of n vertices,is there a partition of the vertex set into k disjoint subsets so that the maximum weight of an innercluster edge (whose two endpoints both belong to the same subset) is minimized. This problem is known to be NP-complete even for k=3. The case of k=2, that is, bipartition problem is solvable in polynomial time. On the other hand, in geometric setting where vertices are points in the plane and weights of edges equal the distances between corresponding points, the same problem is solvable in polynomial time even for k≥3 as far as k is a fixed constant. For the case k=2, effective use of geometric property of an optimal solution leads to considerable improvement on the computational complexity. Other related topics are also discussed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Asano, T., Bhattacharya, B., Keil, J.M., Yao, F.F.: Clustering Algorithms Based on Minimum and Maximum Spanning Trees. In: Proc. of the 4th Annual ACM Symp. on Computational Geometry, pp. 252–257 (1988)
Avis, D.: Diameter Partitioning. Discrete and Computational Geometry 1, 265–276 (1986)
Brucker, P.: On the Complexity of Clustering Problems. In: Henn, R., Korte, B., Oletti, W. (eds.) Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems, pp. 45–54. Springer, Berlin (1978)
Capoyleas, V., Rote, G., Woeginger, G.: Geometric Clusterings. J. of Algorithms 12, 341–356 (1991)
Dobkin, D., Suri, S.: Maintenance of Geometric Extrema. J. of ACM 38(2), 275–298 (1991)
Edelsbrunner, H., Mauer, H.A., Preparata, F.P., Rosenberg, A.L., Welzl, E., Wood, D.: Stabbing Line Segments. In: BIT, vol. 22, pp. 274–281 (1982)
Hagauer, J., Rote, G.: Three-Clustering of Points in the Plane. In: Lengauer, T. (ed.) ESA 1993. LNCS, vol. 726, pp. 192–199. Springer, Heidelberg (1993)
Hansen, P., Jaumard, B.: Minimum sum of diameters clustering. J. of Classification, 215–226 (1987)
Hartigan, J.A.: Clustering Algorithms. John-Wiley, New York (1975)
Hershberger, J.: Minimizing the Sum of Diameters Efficiently. Computational Geometry: Theory and Applications 12, 111–118 (1992)
Hershberger, J., Suri, S.: Finding Tailored Partitions. In: Proc. of the 5th Annual ACM Symp. on Computational Geometry, pp. 255–265 (1989)
Inaba, M., Katoh, N., Imai, H.: Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering. In: Proc. 10th ACM Symp. on Computational Geometry, pp. 332–339 (1994)
Johnson, D.S.: The NP-Completeness Column: Ongoing Guide. J. of Algorithms 3, 182–195 (1982)
Katoh, N., Ibaraki, T.: A Parametric Characterization and an ε-Approximation Scheme for the Minimization of a Quasiconcave Program. Discrete Applied Mathematics 17, 39–66 (1987)
Monma, C., Paterson, M., Suri, S., Yao, F.: Computing Euclidean Maximum Spanning Trees. In: Proc. of the 4th Annual ACM Symp. on Computational Geometry, pp. 241–251 (1988)
Monma, C., Suri, S.: Partitioning Points and Graphs to Minimize the Maximize or the Sum of Diameters. In: Proc. 6th International Conf. on Theory and Applications of Graphs (1988)
Overmars, M., van Leeuwen, J.: Maintenance of Configurations in the Plane. J. Coput. and Syst. Sci. 23, 166–204 (1981)
Selim, S.Z., Ismail, M.A.: K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality. IEEE Trans. Pattern Anal. Mach. Intell., 81–87 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asano, T. (2000). Effective Use of Geometric Properties for Clustering. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-46515-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67181-7
Online ISBN: 978-3-540-46515-7
eBook Packages: Springer Book Archive