Clustering via D. C. Optimization

  • Hoang Thy
  • A. M. Bagirov
  • A. M. Rubinov
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 54)


The cluster analysis problem is formulated as a problem of global minimization of a function represented as a difference of two convex functions over the unit simplex. The version of branch and bound method for the solution of this problem is studied. Computational testing of suggested algorithm was carried out on Wisconsin Diagnostic Breast Cancer database. We present the results of numerical experiments and discuss them.


global optimization d.c. optimization clustering data mining 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Faiz A. Al-Khayyal, H. Tuy and F. Zhou (1997), D.C. Optimization Methods for Multisource Location Problems, Preprint, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta.Google Scholar
  2. [2]
    K. Al-Sultan (1995), A Tabu search approach to the clustering problem. Pattern Recognotion, 28(9), 1443–1453.CrossRefGoogle Scholar
  3. [3]
    A.M. Bagirov, A.M. Rubinov, A. Stranieri and J. Yearwood (1999), The global optimization approach to the clustering analysis, Working Paper 45/99, University of Ballarat, Australia.Google Scholar
  4. [4]
    P.S. Bradley, O.L. Mangasarian aand W.N. Street (1997), Clustering via concave minimization, Techincal Report 96–03, Computert Sciences Department, University of Wisconsin, Madison, Wisconsin, May 1996. Advances In Neural Information processing Systems 9, MIT Press, Cambridge, MA, 368–374, M.C. Mozer, M.I. Jordan and T. Petsche, editors. Available by
  5. [5]
    P.-C. Chen, P. Hansen, B. Jaumard and H. Thy (1998), Solution of the multifacility Weber and conditional Weber problems by D.C. Programming, Operations Research, 46, 548–562.MathSciNetCrossRefGoogle Scholar
  6. [6]
    Yu. G. Evtushenko (1982), Solution Methods of Extremal Problems and Their Application to Optimization Systems, Moscow, Nauka. (in Russian )Google Scholar
  7. [7]
    D. Fisher (1987), Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2, 139–172.Google Scholar
  8. [8]
    R. Horst and H. Thy (1996), Global Optimization( Deterministic Approaches ), Springer, third edition.Google Scholar
  9. [9]
    A.K. Jain and R.C. Dubes (1988), Algorithms for Clustering Data. Prentice-Hall Inc., Englewood Cliffs, NJ.Google Scholar
  10. [10]
    O.L. Mangasarian (1997), Mathematical Programming in Data Mining, Data Mining and Knowledge Discovery 1, 183 - 201.CrossRefGoogle Scholar
  11. [11]
    J.D. Pinter (1996), Global Optimization in Action. Continuous and Lipschitz Optimization: Algorithms, Implementation and Applications, Kluwer Academic Publishers, Dordrecht.Google Scholar
  12. [12]
    M.R. Rao (1971), Cluster analysis and mathematical programming. Journal of the American Statistical Association, 66, 622–626.CrossRefGoogle Scholar
  13. [13]
    A. Rubinov and M. Andramonov (1999), Lipschitz programming via increasing convex-along-rays functions. Optimization Methods and Software 10, 763–78.MathSciNetCrossRefGoogle Scholar
  14. [14]
    A. Rubinov, H. Tuy and H. Mays, Algorithm for a Monotonic Global Optimization Problem, Optimization, to appear.Google Scholar
  15. [15]
    H. Thy (1997), A General D.C. Approach to Location Problems. in State of the Art in Global Optimization: Computational Methods and Applications, C. Floudas and P. Pardalos, eds., Kluwer, 413–432.Google Scholar
  16. [16]
    H. Tuy (1998), Convex Analysis and Global Optimization, Kluwer.Google Scholar
  17. [17]
    H. Thy (1999), Monotonic Optimization: Problems and Solution Approaches, Preprint, Institute of Mathematics, Hanoi.Google Scholar
  18. [18]
    W.H. Wolberg, W.N. Street and O.L. Mangasarian (1994), Machine learning techniques to diagnose breast cancer from fine-needle aspirates. Cancer Letters, 77, 163–171.CrossRefGoogle Scholar
  19. [19]
    W.H. Wolberg, W.N. Street and O.L. Mangasarian (1995a), Image analysis and machine learning applied to breast cancer diagnosis and prognosis. Analytical and Quantitative Cytology and Histology, 17No. 2, 77–87.Google Scholar
  20. [20]
    W.H. Wolberg, W.N. Street, D.M. Heisey and O.L. Mangasarian (1995b), Computerized breast cancer diagnosis and prognosis from fine-needle aspirates. Archives of Surgery, 130, 511–516.Google Scholar
  21. [21]
    W.H. Wolberg, W.N. Street, D.M. Heisey and O.L. Mangasarian (1995c), Computer–derived nuclear features distinguish malignant from benign breast cytology. Human Pathology, 26, 792–796.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Hoang Thy
    • 1
  • A. M. Bagirov
    • 2
  • A. M. Rubinov
    • 2
  1. 1.Institute of MathematicsBo Ho, HanoiVietnam
  2. 2.School of Information Technology and Mathematical SciencesUniversity of BallaratBallarat, VictoriaAustralia

Personalised recommendations