File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICPPW.2003.1240375
- Scopus: eid_2-s2.0-84883403215
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A parallel tabu search heuristic for clustering data sets
Title | A parallel tabu search heuristic for clustering data sets |
---|---|
Authors | |
Keywords | Character generation Concurrent computing Data analysis Data mining Fuzzy sets Testing Personal communication networks Mathematics Clustering methods Clustering algorithms |
Issue Date | 2003 |
Citation | Proceedings of the International Conference on Parallel Processing Workshops, 2003, v. 2003-January, p. 230-235 How to Cite? |
Abstract | © 2003 IEEE. 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. |
Persistent Identifier | http://hdl.handle.net/10722/276959 |
ISSN | 2020 SCImago Journal Rankings: 0.211 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ng, M. | - |
dc.date.accessioned | 2019-09-18T08:35:10Z | - |
dc.date.available | 2019-09-18T08:35:10Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | Proceedings of the International Conference on Parallel Processing Workshops, 2003, v. 2003-January, p. 230-235 | - |
dc.identifier.issn | 1530-2016 | - |
dc.identifier.uri | http://hdl.handle.net/10722/276959 | - |
dc.description.abstract | © 2003 IEEE. 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. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the International Conference on Parallel Processing Workshops | - |
dc.subject | Character generation | - |
dc.subject | Concurrent computing | - |
dc.subject | Data analysis | - |
dc.subject | Data mining | - |
dc.subject | Fuzzy sets | - |
dc.subject | Testing | - |
dc.subject | Personal communication networks | - |
dc.subject | Mathematics | - |
dc.subject | Clustering methods | - |
dc.subject | Clustering algorithms | - |
dc.title | A parallel tabu search heuristic for clustering data sets | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICPPW.2003.1240375 | - |
dc.identifier.scopus | eid_2-s2.0-84883403215 | - |
dc.identifier.volume | 2003-January | - |
dc.identifier.spage | 230 | - |
dc.identifier.epage | 235 | - |
dc.identifier.issnl | 1530-2016 | - |