Parallel Clustering on a Commodity Supercomputer

I
IJCNN
2000
IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 3
Abstract - Parallel Clustering on a Commodity Supercomputer

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Giuseppe Patanè Articles by Marco Russo

IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 3

Como, Italy

July 24-July 27

ISBN: 0-7695-0619-4

	ASCII Text	x
	Giuseppe Patanè, Marco Russo, "Parallel Clustering on a Commodity Supercomputer," Neural Networks, IEEE - INNS - ENNS International Joint Conference on, vol. 3, pp. 3575, IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 3, 2000.

	BibTex	x
	@article{ 10.1109/IJCNN.2000.861374, author = {Giuseppe Patanè and Marco Russo}, title = {Parallel Clustering on a Commodity Supercomputer}, journal ={Neural Networks, IEEE - INNS - ENNS International Joint Conference on}, volume = {3}, year = {2000}, issn = {1098-7576}, pages = {3575}, doi = {http://doi.ieeecomputersociety.org/10.1109/IJCNN.2000.861374}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Neural Networks, IEEE - INNS - ENNS International Joint Conference on TI - Parallel Clustering on a Commodity Supercomputer SN - 1098-7576 SP EP A1 - Giuseppe Patanè, A1 - Marco Russo, PY - 2000 KW - Parallel KW - Clustering KW - Unsupervised Learning KW - GLA KW - LBG KW - ELBG VL - 3 JA - Neural Networks, IEEE - INNS - ENNS International Joint Conference on ER -

Giuseppe Patanè, University of Catania

Marco Russo, University of Messina

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IJCNN.2000.861374

k -means based clustering algorithms have interesting performances in several application fields. The computational complexity of these techniques depends on the size of the data set and the codebook. The larger the data set and the codebook, the greater the computing time to reach the con vergence. This paper illustrates the behavior of t w o clustering algorithms we have realized and parallelized on a commodity supercomputer.

Index Terms:

Parallel, Clustering, Unsupervised Learning, GLA, LBG, ELBG

Citation:

Giuseppe Patanè, Marco Russo, "Parallel Clustering on a Commodity Supercomputer," ijcnn, vol. 3, pp.3575, IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 3, 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.