PERFORMANCE GAIN FOR CLUSTERING WITH GROWING NEURAL GAS USING PARALLELIZATION METHODS

Alexander Adam, Sebastian Leuoth, Sascha Dienelt, Wolfgang Benn

2010

Abstract

The amount of data in databases is increasing steadily. Clustering this data is one of the common tasks in Knowledge Discovery in Databases (KDD). For KDD purposes, this means that many algorithms need so much time, that they become practically unusable. To counteract this development, we try parallelization techniques on that clustering. Recently, new parallel architectures have become affordable to the common user. We investigated especially the GPU (Graphics Processing Unit) and multi-core CPU architectures. These incorporate a huge amount of computing units paired with low latencies and huge bandwidths between them. In this paper we present the results of different parallelization approaches to the GNG clustering algorithm. This algorithm is beneficial as it is an unsupervised learning method and chooses the number of neurons needed to represent the clusters on its own.

References

  1. Adam, A., Leuoth, S., and Benn, W. (2009). Performance Gain of Different Parallelization Approaches for Growing Neural Gas. In Perner, P., editor, Machine Learning and Data Mining in Pattern Recognition, Poster Proceedings.
  2. Ancona, F., Rovetta, S., and Zunino, R. (1996). A Parallel Approach to Plastic Neural Gas. In Proceedings of the 1996 International Conference on Neural Networks.
  3. Cottrell, M., Hammer, B., and Hasenfuß, A. (2008). Batch and median neural gas. Elsevier Science.
  4. Davies, D. L. and Bouldin, D. W. (1979). A Cluster Separation Measure. Pattern Analysis and Machine Intelligence, IEEE Transactions on, PAMI-1(2):224-227.
  5. Dunn, J. C. (1974). Well separated clusters and optimal fuzzy-partitions. Journal of Cybernetics, 4:95-104.
  6. Etengoff, A. (2009). Nvidia touts rapid GPU performance boost. http://www.tgdaily.com/content/view/43745/ 135/.
  7. Hubert, L. and Schultz, J. (1976). Quadratic Assignment as a General Data Analysis Strategy. British Journal of Mathematical and Statistical Psychology, 29:190- 241.
  8. Kohonen, T. (1982). Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43(1):59-69.
  9. Kowaliski, C. (2007). AMD unveils microprocessor strategy for 2009. http://www.techreport.com/discussions .x/12945.
  10. Labonté, G. and Quintin, M. (1999). Network Parallel Computing for SOM Neural Networks. Royal Military College of Canada.
  11. NVIDIA Corporation (2009). NVIDIA CUDA Compute Unified Device Architecture - Programming Guide.
  12. Reilly, M., Stewart, L. C., Leonard, J., and Gingold, D. (2008). SiCortex Technical Summary. Technical summary, SiCortex Incorporated.
  13. Sweeney, T. (2009). The End of the GPU Roadmap. http://graphics.cs.williams.edu/archive/SweeneyHPG 2009/TimHPG2009.pdf.
  14. Szalay, T. and Tukora, B. (2008). High performance computing on graphics processing units. Pollack Periodica, 3(2):27-34.
Download


Paper Citation


in Harvard Style

Adam A., Leuoth S., Dienelt S. and Benn W. (2010). PERFORMANCE GAIN FOR CLUSTERING WITH GROWING NEURAL GAS USING PARALLELIZATION METHODS . In Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8425-05-8, pages 264-269. DOI: 10.5220/0002903502640269


in Bibtex Style

@conference{iceis10,
author={Alexander Adam and Sebastian Leuoth and Sascha Dienelt and Wolfgang Benn},
title={PERFORMANCE GAIN FOR CLUSTERING WITH GROWING NEURAL GAS USING PARALLELIZATION METHODS},
booktitle={Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2010},
pages={264-269},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002903502640269},
isbn={978-989-8425-05-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - PERFORMANCE GAIN FOR CLUSTERING WITH GROWING NEURAL GAS USING PARALLELIZATION METHODS
SN - 978-989-8425-05-8
AU - Adam A.
AU - Leuoth S.
AU - Dienelt S.
AU - Benn W.
PY - 2010
SP - 264
EP - 269
DO - 10.5220/0002903502640269