[go: up one dir, main page]

Skip to main content

An Adaptive k-Nearest Neighbors Clustering Algorithm for Complex Distribution Dataset

  • Conference paper
Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (ICIC 2007)

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

Included in the following conference series:

  • 1787 Accesses

Abstract

To resolve the shortage of traditional clustering algorithm when dealing data set with complex distribution, a novel adaptive k-Nearest Neighbors clustering(AKNNC) algorithm is presented in this paper. This algorithm is made up of three parts: (a)normalize data set; (b)construct initial patterns; (c)merge initial patterns. Simulation results show that compared with classical FCA, our AKNNC algorithm not only has better clustering performance for data set with Complex distribution, but also can be applied to the data set without knowing cluster number in advance.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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.

Similar content being viewed by others

References

  1. Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, San Diego, CA (1990)

    MATH  Google Scholar 

  2. Baraldi, F., Parmiggiani, F.: Fuzzy-shell Clustering and Applications to Circle Detection in Digital Images. Int. J. General Syst 16, 343–355 (1995)

    Google Scholar 

  3. Frigui, H., Krishnapuram, R.: A Comparison of Fuzzy Shell-clustering Method for the De-tection of Ellipses. IEEE Transactions on Fuzzy System 4, 193–199 (1996)

    Article  Google Scholar 

  4. Hubert, L.J.: Some Applications of Graph Theory to Clustering. Psychonmetrika 4, 435–475 (1974)

    Google Scholar 

  5. Liu, Y.T., Shiueng, B.Y.: A Genetic Algorithm for Data with Non-spherical-shape Clusters. Pattern Recognition 33, 1251–1259 (2000)

    Article  Google Scholar 

  6. Patrick, K.S.: Fuzzy Min-Max Neural Networks-Part1: Classification. IEEE Transactions On Neural Networks 3, 776–786 (1992)

    Article  Google Scholar 

  7. Huang, X.B., Wan, J.W., Wang, Z.: A Recursive Algorithm for Computing the Trace of the Sample Covariance Matrix. Pattern Recognition and Artificial Intelligence 17, 497–501 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Laurent Heutte Marco Loog

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Jia, Y., Huang, X., Zhou, B., Gu, J. (2007). An Adaptive k-Nearest Neighbors Clustering Algorithm for Complex Distribution Dataset. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2007. Lecture Notes in Computer Science(), vol 4682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74205-0_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74205-0_44

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-74205-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics