Skip to main content
SpringerLink
Log in

A Tabu Clustering Method with DHB Operation and Mergence and Partition Operation

  • Conference paper
Book cover Discovery Science (DS 2005)

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

Included in the following conference series:

  • 696 Accesses

Abstract

A new tabu clustering method called ITCA is developed for the minimum sum of squares clustering problem, where DHB operation and mergence and partition operation are introduced to fine-tune the current solution and create the neighborhood, respectively. Compared with some known clustering methods, ITCA can obtain better performance, which is extensively demonstrated by experimental simulations.

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

References

  1. Hall, L.O., Ozyurt, B., Bezdek, J.C.: Clustering with a genetically optimized approach. IEEE Trans. Evol. Comput. 3, 103–112 (1999)

    Article  Google Scholar 

  2. Al-sultan, K.S.: A tabu search approach to the clustering problem. Pattern Recognit. 28, 1443–1451 (1995)

    Article  Google Scholar 

  3. Bandyopadhyay, S., Maulik, U., Pakhira, M.K.: Clustering using simulated annealing with probabilisitc redistribution. Int. J. Pattern Recognit. Artif. Intell. 15, 269–285 (2001)

    Article  Google Scholar 

  4. Krishna, K., Murty, M.N.: Genetic K-means algorithm. IEEE Trans. Syst. Man Cybern, Part B-Cybern. 29, 433–439 (1999)

    Article  Google Scholar 

  5. Bandyopadhyay, S., Maulik, U.: An evolutionary technique based on K-means algorithm for optimal clustering in R N. Inf. Sci. 146, 221–237 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Zhang, Q.W., Boyle, R.D.: A new clustering algorithm with multiple runs of iterative procedures. Pattern Recognit. 24, 835–848 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, P.R. China

    Yongguo Liu

  2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, P.R. China

    Yongguo Liu

  3. Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, 200030, P.R. China

    Yongguo Liu, Dong Zheng, Shiqun Li, Libin Wang & Kefei Chen

Authors
  1. Yongguo Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dong Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shiqun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Libin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kefei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science & Engineering, The University of New South Wales, Sydney, Australia

    Achim Hoffmann

  2. Institute of Scientific and Industrial Research, Osaka University, 8-1 Mihogaoka, 567-0047, Ibaraki, Osaka, Japan

    Hiroshi Motoda

  3. Max Planck Institute for Computer Science, Saarbrücken, Germany

    Tobias Scheffer

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Zheng, D., Li, S., Wang, L., Chen, K. (2005). A Tabu Clustering Method with DHB Operation and Mergence and Partition Operation. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds) Discovery Science. DS 2005. Lecture Notes in Computer Science(), vol 3735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563983_36

Download citation

  • DOI: https://doi.org/10.1007/11563983_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29230-2

  • Online ISBN: 978-3-540-31698-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation