Skip to main content
SpringerLink
Log in

A Practical Clustering Algorithm

  • Conference paper
Advances in Neural Networks - ISNN 2008 (ISNN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5263))

Included in the following conference series:

Abstract

We present a novel clustering algorithm (SDSA algorithm) based on the concept of the short distance of the consecutive points and the small angle between the consecutive vectors formed by three adjacent points. Not only the proposed SDSA algorithm is suitable for almost all test data sets used by Chung and Liu for point symmetry-based K-means algorithm (PSK algorihtm) and their newly proposed modified point symmetry-based K-means algorithm (MPSK algorithm ), the proposed SDSA algorithm is also suitable for many other cases where the PSK algorihtm and MPSK algorithm can not be well performed. Based on some test data sets, experimental results demonstrate that our proposed SDSA algorithm is rather encouraging when compared to the previous PSK algorithm and MPSK algorithm.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Jain, A.K., Dubes, R.C.: Algorithms for Clustering. Prentice Hall, Englewood Cliffs (1988)

    MATH  Google Scholar 

  2. Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, New York (1973)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  4. Fischer, B., Buhmann, J.M.: Bagging for Path Based Clustering. IEEE Trans. Pattern Anal. Machine Intel. 25, 1411–1415 (2003)

    Article  Google Scholar 

  5. Bajcsy, P., Ahuja, N.: Location and Density Based Hierarchical Clustering Using Similarity Analysis. IEEE Trans. Pattern Anal. Machine Intel. 20, 1011–1015 (1998)

    Article  Google Scholar 

  6. Zhu, C., Po, L.M.: Minimax Partial Distortion Competitive Learning for Optimal Codebook Design. IEEE Trans. Image Process 7, 1400–1409 (1998)

    Article  Google Scholar 

  7. Fred, L.N., Leitao, M.N.: A New Cluster Isolation Criterion Based on Dissimilarity Increments. IEEE Trans. Pattern Anal. Machine Intel. 25, 944–958 (2003)

    Article  Google Scholar 

  8. Su, M.C., Chou, C.H.: A Modified Version of the K-means Algorithm with A Distance Based on Cluster Symmetry. IEEE Trans. Pattern Anal. Machine Intel. 23, 674–680 (2001)

    Article  Google Scholar 

  9. Chung, K.L., Lin, J.S.: Faster and more Robust Point Symmetrybased K-means Algorithm. Pattern Recognit. 40, 410–422 (2007)

    Article  MATH  Google Scholar 

  10. Chung, K.L., Lin, J.S.: An Efficient Line Symmetry-based K-means Algorithm. Pattern Recognition Letters 27, 765–772 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Hangzhou Dianzi University, Hangzhou, 310018, China

    Wei Li & Jianye Chen

  2. School of Mathematics and Statistics, Lanzhou University, Lanzhou, 730107, China

    Haohao Li

Authors
  1. Wei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haohao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianye Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Technology, Tsinghu University, 100084, Beijing, China

    Fuchun Sun

  2. Institute TAMS (Technical Aspects of Multimodal Systems), department of Informatics, University of Hamburg, Vogt-Koelln-Straße 30, 22527, Hamburg, Germany

    Jianwei Zhang

  3. Intel China Research Center, 8/F, Peking University, Department of Machine Intelligence, 100871, Beijing, China

    Ying Tan

  4. Department of Mathematics, Southeast University, 210096, Nanjing, China

    Jinde Cao

  5. Departamento de Control Automático, CINVESTAV-IPN, A.P. 14-740, Av.IPN 2508, 07360, México D.F., México

    Wen Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, W., Li, H., Chen, J. (2008). A Practical Clustering Algorithm. In: Sun, F., Zhang, J., Tan, Y., Cao, J., Yu, W. (eds) Advances in Neural Networks - ISNN 2008. ISNN 2008. Lecture Notes in Computer Science, vol 5263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87732-5_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87732-5_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87731-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation