Nothing Special   »   [go: up one dir, main page]

Skip to main content

Visual clustering of multidimensional and large data sets using parallel environments

  • 2. Computational Science
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1401))

Included in the following conference series:

Abstract

A method for visual clustering of large N-dimensional data sets is presented briefly. Its implementation on HP/Convex SPP/1600 enables visualization of data sets consisting of more than 104 multidimensional data vectors. The method was tested in PVM, MPI and data parallel environments. In the paper, the authors compare the parallel algorithm performance for these three interfaces. The results of tests, made to exemplify the algorithm “immunity” from data errors, are presented and discussed.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jain, D., and Dubes, R.,C., 1988, Algorithms for Clustering Data, Prentice-Hall Advanced Reference Series, 37–46.

    Google Scholar 

  2. Dzwinel, W., 1994, “How to Make Sammon's Mapping Useful for Multidimensional Data Structures Analysis?”, Pattern Recogn., 27, 7, 949–959.

    Google Scholar 

  3. Dzwinel, W., and Błasiak, J., 1995, “Pattern Recognition via Molecular Dynamics on Vector Supercomputers and Networked Workstations”, Lecture Notes in Computer Science, HPCN'95, 919, 508, Springer-Verlag, Berlin 1995.

    Google Scholar 

  4. Siedlecki, W., Siedlecka, K., and Sklanski, J., 1988, “An Overview of Mapping for Exploratory Pattern Analysis”, Pattern Recogn., 21, 5, 411.

    Google Scholar 

  5. Siedlecki, W., Siedlecka, K., and Sklanski, J., 1988, “Experiments on Mapping Techniques for Exploratory Pattern Analysis”, Pattern Recogn., 21, 5, 431.

    Google Scholar 

  6. Dzwinel, W., 1995, “In Search for the Global Minimum in Problems of Features Extraction and Selection”, Proc. of the 3 Congress on Intelligent Techniques and Soft Computing, EUFIT'95, 28–31 August 1995, Aachen, 3, 1326.

    Google Scholar 

  7. Dzwinel, W., 1997, “Virtual Particles and Search for Global Minimum”, Future Generation Computer Systems, 12, 371–389.

    Google Scholar 

  8. Brode, S., and Ahlrichs, R., 1986, “An Optimized MD Program for the Vector Computer CYBER-205”, Comput. Phys. Commun., 42, 51.

    Google Scholar 

  9. Dzwinel, W., Pepyolyshev, Yu., N., Jirsa, P., and Rejchrt, J., 1995, “Comparison of Noise Diagnostic System Based on Pattern Recognition and Discriminant Methods”, Annals of Nuclear Energy, 22, 8, 543–551.

    Google Scholar 

  10. Dzwinel, J., Dzwinel, K., and Dzwinel, W., 1996, “Pattern Recognition Methods Implemented in MEGA-D — the System for Oil and Gas Prospecting”, Proc. of the Second International Conference on Application of Fuzzy Systems and Soft Computing, ICAFS'96, 25–27 June 1996, Siegen, Germany.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Peter Sloot Marian Bubak Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Błasiak, J., Dzwinel, W. (1998). Visual clustering of multidimensional and large data sets using parallel environments. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037167

Download citation

  • DOI: https://doi.org/10.1007/BFb0037167

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64443-9

  • Online ISBN: 978-3-540-69783-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics