Skip to main content

Initial Seeds Selection in Dynamic Clustering Method Based on Data Depth

  • Conference paper
  • First Online:
Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques (IScIDE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 9243))

  • 2753 Accesses

Abstract

Resorting to the theory of atomic models and the tool of data depth, we propose a novel method for initial seeds selection in dynamic clustering method. We define the cohesion of a point in a given data set, which includes the information of the significance and locations of neighboring points together. Then, the dynamic clustering algorithm based on cohesion is proposed. Compared with the density-based dynamic clustering algorithm, the clustering results demonstrate that our proposed method is more effective and robust.

The work is supported by Natural Science Foundation of Zhejiang Province of China (LY14A010003) AMS Subject Classification (2000):   Primary 62H30; Secondary 62-07.

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

Access this chapter

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 EPUB and 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

  • Bohr, N.: On the constitution of atoms and molecules, part I binding of electrons by positive nuclei. Phil. Mag. 26, 1–24 (1913a)

    Article  Google Scholar 

  • Bohr, N.: On the constitution of atoms and molecules, part II systems containing only a single nucleus. Phil. Mag. 26, 476–502 (1913b)

    Article  Google Scholar 

  • Fisher, R.A.: The use of multiple measurements in taxonomic problems. Ann. Eugenics 7, 179–188 (1936)

    Article  Google Scholar 

  • Ghosh, A.K., Chaudhuri, P.: On maximum depth and related classifiers. Scand. J. Stat. 32, 328–350 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Liu, R., Serfling, R., Souvaine, D.: Depth functions in nonparametric multivariate inference. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 72, 1–16 (2006)

    Article  MathSciNet  Google Scholar 

  • Mavroeidis, D., Marchiori, E.: Feature selection for Dynamic clustering stability: theoretical analysis and analgorithm. Data Min. Knowl. Disc. 28, 918–960 (2014)

    Article  MATH  Google Scholar 

  • Pavav, K.K., Rao, A.A., Rao, A.V.D., Sridhar, G.R.: Robust seed selection algorithm for dynamic type algorithms. Int. J. Comput. Sci. & Inf. Technol. 3, 147–163 (2011)

    Google Scholar 

  • Redmond, S.J., Heneghan, C.: A method for initialising the dynamic clustering algorithm using kd-trees, Pattern. Recogn. Lett. 28, 965–973 (2007)

    Article  Google Scholar 

  • Zuo, Y., Serfling, R.: General notions of statistical depth function. Ann. Stat. 28, 461–482 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Caiya Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, C., Jin, Z. (2015). Initial Seeds Selection in Dynamic Clustering Method Based on Data Depth. In: He, X., et al. Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. IScIDE 2015. Lecture Notes in Computer Science(), vol 9243. Springer, Cham. https://doi.org/10.1007/978-3-319-23862-3_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23862-3_60

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23861-6

  • Online ISBN: 978-3-319-23862-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics