A Parallel Tabu Search Heuristic for Clustering Data Sets

Kaohsiung, Taiwan October 06-October 09

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICPPW.2003.1240375

2003 International Conference on Para ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Michael Ng

	ASCII Text	x
	Michael Ng, "A Parallel Tabu Search Heuristic for Clustering Data Sets," Parallel Processing Workshops, International Conference on, pp. 230, 2003 International Conference on Parallel Processing Workshops (ICPPW'03), 2003.

	BibTex	x
	@article{ 10.1109/ICPPW.2003.1240375, author = {Michael Ng}, title = {A Parallel Tabu Search Heuristic for Clustering Data Sets}, journal ={Parallel Processing Workshops, International Conference on}, volume = {0}, year = {2003}, issn = {1530-2016}, pages = {230}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICPPW.2003.1240375}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Processing Workshops, International Conference on TI - A Parallel Tabu Search Heuristic for Clustering Data Sets SN - 1530-2016 SP EP A1 - Michael Ng, PY - 2003 KW - null VL - 0 JA - Parallel Processing Workshops, International Conference on ER -

Michael Ng, The University of Hong Kong

Clustering methods partition a set of objects into clusters such that objects in the same cluster are more similar to each other than objects in different clusters according to some defined criteria. In this paper, a parallel Tabu search heuristic for solving this problem is developed and implemented on a cluster of PCs. We observe that parallelization does not affect the quality of clustering results, but provides a large saving of the computational times in practice.

Citation:

Michael Ng, "A Parallel Tabu Search Heuristic for Clustering Data Sets," icppw, pp.230, 2003 International Conference on Parallel Processing Workshops (ICPPW'03), 2003

Peer Review Notice | Give Us Feedback

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