Skip to main content

Parallel Realizations of the SAMANN Algorithm

  • Conference paper

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

Abstract

Sammon’s mapping is a well-known procedure for mapping data from a higher-dimensional space onto a lower-dimensional one. But the original algorithm has a disadvantage. It lacks generalization, which means that new points cannot be added to the obtained map without recalculating it. The SAMANN neural network, that realizes Sammon’s algorithm, provides a generalization capability of projecting new data. A drawback of using SAMANN is that the training process is extremely slow. One of the ways of speeding up the neural network training process is to use parallel computing. In this paper, we proposed some parallel realizations of the SAMANN.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blake, C.L., Hettich, S., Merz, C.J.: UCI repository of machine learning databases. University of California, Department of Information and Computer Science, Irvine, CA (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html

  2. Borg, I., Groenen, P.: Modern Multidimensional Scaling: Theory and Applications. Springer, New York (1997)

    MATH  Google Scholar 

  3. Ciegis, R.: Parallel algorithms and net technologies (in Lithuanian). Technika, Vilnius (2005)

    Google Scholar 

  4. Gorman, R.P., Sejnowski, T.J.: Analysis of Hidden Units in a Layered Network Trained to Classify Sonar Targets. Neural Networks 1, 75–89 (1988)

    Article  Google Scholar 

  5. Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley, Reading (2003)

    Google Scholar 

  6. Fisher, R.A.: The use of multiple measurements in taxonomic problem. In: Annual Eugenics, vol. 7, Part II, pp. 179–188 (1936)

    Google Scholar 

  7. Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)

    MATH  Google Scholar 

  8. Jain, A.K., Mao, J.: Artificial neural network for nonlinear projection of multivariate data. In: Proc. IEEE International Joint Conference Neural Network, vol. 3, pp. 335–340 (1992)

    Google Scholar 

  9. Jain, A.K., Duin, R., Mao, J.: Statistical pattern recognition. A review. IEEE Trans. Pattern Analysis and Machine Intelligence 22(1), 4–37 (2000)

    Article  Google Scholar 

  10. Mao, J., Jain, A.K.: Artificial neural networks for feature extraction and multivariate data projection. IEEE Trans. Neural Networks 6, 296–317 (1995)

    Article  Google Scholar 

  11. Medvedev, V., Dzemyda, G.: Optimization of the local search in the training for SAMANN neural network. Journal of Global Optimization 35, 607–623 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  12. OpenMP C and C++ Application Program Interface Version 2.0, March 2002, OpenMP Architecture Review Board (2002)

    Google Scholar 

  13. de Ridder, D., Duin, R.P.W.: Sammon’s mapping using neural networks: A comparison. Pattern Recognition Letters 18, 1307–1316 (1997)

    Article  Google Scholar 

  14. Sammon, J.J.: A nonlinear mapping for data structure analysis. IEEE Trans. Computer 18(5), 401–409 (1969)

    Article  Google Scholar 

  15. Scott, R., Clark, T., Bagheri, B.: Scientific Parallel Computing. Princeton University Press, Princeton (2005)

    MATH  Google Scholar 

  16. Quinn, M.J.: Parallel Programming in C with MPI and OpenMP. McGraw-Hill Inc., New York (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bartlomiej Beliczynski Andrzej Dzielinski Marcin Iwanowski Bernardete Ribeiro

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Ivanikovas, S., Medvedev, V., Dzemyda, G. (2007). Parallel Realizations of the SAMANN Algorithm. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71629-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71629-7_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71590-0

  • Online ISBN: 978-3-540-71629-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics