Skip to main content
SpringerLink
Log in

Gaussian Kernel Minimum Sum-of-Squares Clustering and Solution Method Based on DCA

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7197))

Included in the following conference series:

  • 2672 Accesses

Abstract

In this paper, a Gaussian Kernel version of the Minimum Sum-of-Squares Clustering \((G\mathcal{K}MSSC)\) is studied. The problem is formulated as a DC (Difference of Convex functions) program for which a new algorithm based on DC programming and DCA (DC Algorithm) is developed. The related DCA is original and very inexpensive. Numerical simulations show the efficiency of DCA and its superiority with respect to K-mean, a standard method for clustering.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arora, S., Kannan, R.: Learning mixtures of arbitrary Gaussians. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 247–257 (2001)

    Google Scholar 

  2. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264–323 (1999)

    Article  Google Scholar 

  3. An, L.T.H., Belghiti, T., Tao, P.D.: A new efficient algorithm based on DC programming and DCA for Clustering. Journal of Global Optimization 37, 593–608 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. An, L.T.H., Minh, L.H., Tao, P.D.: Optimization based DC programming and DCA for Hierarchical Clustering. European Journal of Operational Research 183, 1067–1085 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. An, L.T.H., Minh, L.H., Tao, P.D.: Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms. Journal of Advances in Data Analysis and Classification (2), 1–20 (2007)

    Google Scholar 

  6. An, L.T.H., Tao, P.D.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. Journal of Global Optimization 11(3), 253–285 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. An, L.T.H., Tao, P.D.: The DC (difference of convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research 133, 23–46 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Tao, P.D., An, L.T.H.: Convex analysis approach to d.c. programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, Dedicated to Professor Hoang Tuy on the Occasion of his 70th Birthday 22(1), 289–355 (1997)

    MathSciNet  MATH  Google Scholar 

  9. Tao, P.D., An, L.T.H.: DC optimization algorithm for solving the trust region subproblem. SIAM J. Optimization 8, 476–505 (1998)

    Article  MATH  Google Scholar 

  10. An, L.T.H., Ngai, N.V., Tao, P.D.: Exact Penalty and Error Bounds in DC Programming. Submitted to Journal of Global Optimization Dedicated to Reiner Horst (2011)

    Google Scholar 

  11. Bradley, B.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Proceedings of the 15th International Conferences on Machine Learning (ICML 1998), San Francisco, California, pp. 82–90 (1998)

    Google Scholar 

  12. Brusco, M.J.: A repetitive branch-and-bound procedure for minimum within-cluster sum of squares partitioning. Psychometrika 71, 347–363 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Peng, J., Xiay, Y.: A Cutting Algorithm for the Minimum Sum-of-Squared Error Clustering. In: Proceedings of the SIAM International Data Mining Conference (2005)

    Google Scholar 

  14. Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Mathematical Programming 79, 191–215 (1997)

    MathSciNet  MATH  Google Scholar 

  15. Sherali, H.D., Desai, J.: A global optimization RLT-based approach for solving the hard clustering problem. Journal of Global Optimization 32, 281–306 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Fisher, D.: Knowledge acquisition via incremental conceptual clustering. Machine Learning 2, 139–172 (1987)

    Google Scholar 

  17. Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)

    MATH  Google Scholar 

  18. Vinod, H.D.: Integer programming and the theory of grouping. J. Amer. Stat. Assoc. 64, 506–519 (1969)

    Article  MATH  Google Scholar 

  19. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  20. Herbrich, R.: Herbrich, Learning kernel classifiers. MIT Press (2002)

    Google Scholar 

  21. Filippone, M., Camastra, F., Masulli, F., Rovetta, S.: A survey of kernel and spectral methods for clustering. Pattern Recognition 41, 176–190 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science - LITA EA 3097, UFR MIM, University of Paul Verlaine - Metz, Ile de Saulcy, 57045, Metz, France

    Le Hoai Minh & Le Thi Hoai An

  2. Laboratory of Modelling, Optimization & Operations Research, National Institute for Applied Sciences - Rouen, Avenue de l’Universit?, 76801, Saint-Etienne-du-Rouvray Cedex, France

    Pham Dinh Tao

Authors
  1. Le Hoai Minh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Le Thi Hoai An
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pham Dinh Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, No. 415, Chien-Kung Road, 80778, Kaohsiung, Taiwan

    Jeng-Shyang Pan

  2. Graduate Institute of Educational Measurement and Statistics, National Taichung University of Education, No. 140, Min-Shen Road, 40306, Taichung, Taiwan

    Shyi-Ming Chen

  3. Wrocław University of Technology, Wyb. Wyspiańskiego 27, 50-370, Wrocław, Poland

    Ngoc Thanh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minh, L.H., An, L.T.H., Tao, P.D. (2012). Gaussian Kernel Minimum Sum-of-Squares Clustering and Solution Method Based on DCA. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28490-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28490-8_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28489-2

  • Online ISBN: 978-3-642-28490-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation