Skip to main content
SpringerLink
Log in

Watershed on vector quantization for clustering of big data

  • Computer Technologies in Physics
  • Published:
Physics of Particles and Nuclei Letters Aims and scope Submit manuscript

Abstract

A method for clustering of large amounts of data is presented which is a sequenced composition of two algorithms: the former builds a partition of input space into Voronoi regions and the latter partitions them. First, a model of clusters as high-density regions in input space is presented, then it is shown how a Voronoi partition and it’s topological map (a) can be build and (b) used as a low complexity approximation of the input space. During the (b) step, the usage of “watershed” algorithm is presented which has been previously used for image segmentation, but it is its first application to a data space partition that is proposed by the authors.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. S. Duran and P. L. Odell, Cluster Analysis: A Survey (Springer-Verlag, Berlin and New York, 1974).

    MATH  Google Scholar 

  2. J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Eds. by L. M. Le Cam and J. Neyman, vol. 1 (U. California Press, Berkeley, 1967), pp. 281–297.

    Google Scholar 

  3. Bezdek and C. James, Pattern Recognition with Fuzzy Objective Function Algorithms, ISBN 0306406713 (1981).

    Book  MATH  Google Scholar 

  4. T. Kohonen, Self-Organizing Maps (Springer-Verlag, Berlin, New York, 2001), 3d extended edition.

    Book  MATH  Google Scholar 

  5. B. Fritzke, “Unsupervised ontogenic networks,” in Handbook of Neural Computation, Eds. by E. Fiesler and R. Beale (Oxford University Press, 1997).

    Google Scholar 

  6. A. V. Skvortsov, Delaunay Triangulation and Its Applications (Tomsk State University Publishing, Tomsk, 2002).

    Google Scholar 

  7. J. Cousty, G. Bertrand, L. Najman, and M. Couprie, “Watershed cuts: minimum spanning forests and the drop of water principle,” in Pattern Analysis and Machine Intelligence, IEEE Transactions on, 31(8), 1362, 1374, (Aug. 2009).

    Article  Google Scholar 

  8. J. Bertrand, “On the dynamics”, Image and Vision Computing 25, 447–454 (2007).

    Article  Google Scholar 

  9. S. V. Mitsyn and G. A. Ososkov, “The growing neural gas and clustering of large amounts of data”, Optical Memory and Neural Networks 20(4), 260–270 (2011).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Moscow Region, 141980, Russia

    S. V. Mitsyn & G. A. Ososkov

Authors
  1. S. V. Mitsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. A. Ososkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. V. Mitsyn.

Additional information

The article is published in the original.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mitsyn, S.V., Ososkov, G.A. Watershed on vector quantization for clustering of big data. Phys. Part. Nuclei Lett. 12, 170–172 (2015). https://doi.org/10.1134/S1547477115010173

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1547477115010173

Keywords

Search

Navigation