Computational Experience On Four Algorithms For The Hard Clustering Problem
In this paper, we consider the problem of clustering m objects in c clusters. The objects are represented by points in n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center is minimized. Th...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/2552/1/computational_experience_on_four_algorit_alsultan_isi_a1996uc27800009.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513390865547264 |
|---|---|
| author | AlSultan, K.S. |
| author2 | Khan, M.M. unknown |
| author2_role | author author |
| author_facet | AlSultan, K.S. Khan, M.M. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | AlSultan, K.S. Khan, M.M. unknown |
| dc.date.*.fl_str_mv | 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/2552/1/computational_experience_on_four_algorit_alsultan_isi_a1996uc27800009.pdf Computational Experience On Four Algorithms For The Hard Clustering Problem. PATTERN RECOGNITION LETTERS, 17. pp. 295-308. |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | ELSEVIER SCIENCE BV |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/2552/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Computational Experience On Four Algorithms For The Hard Clustering Problem |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | In this paper, we consider the problem of clustering m objects in c clusters. The objects are represented by points in n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center is minimized. The problem is a difficult optimization problem due to the fact that: it posseses many local minima. Several algorithms have been developed to solve this problem which include the k-means algorithm, the simulated annealing algorithm, the tabu search algorithm, and the genetic algorithm. In this paper, we study the four algorithms and compare their computational performance for the clustering problem. We test these algorithms on several clustering problems from the literature as well as several random problems and we report on our computational experience. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_f37e303fc32bdc0ea89840f8d5721c09 |
| identifier_str_mv | Computational Experience On Four Algorithms For The Hard Clustering Problem. PATTERN RECOGNITION LETTERS, 17. pp. 295-308. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::2552 |
| publishDate | 2020 |
| publisher.none.fl_str_mv | ELSEVIER SCIENCE BV |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Computational Experience On Four Algorithms For The Hard Clustering ProblemAlSultan, K.S.Khan, M.M.unknownComputerIn this paper, we consider the problem of clustering m objects in c clusters. The objects are represented by points in n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center is minimized. The problem is a difficult optimization problem due to the fact that: it posseses many local minima. Several algorithms have been developed to solve this problem which include the k-means algorithm, the simulated annealing algorithm, the tabu search algorithm, and the genetic algorithm. In this paper, we study the four algorithms and compare their computational performance for the clustering problem. We test these algorithms on several clustering problems from the literature as well as several random problems and we report on our computational experience.ELSEVIER SCIENCE BVArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/2552/1/computational_experience_on_four_algorit_alsultan_isi_a1996uc27800009.pdf Computational Experience On Four Algorithms For The Hard Clustering Problem. PATTERN RECOGNITION LETTERS, 17. pp. 295-308. enhttps://eprints.kfupm.edu.sa/id/eprint/2552/2020info:eu-repo/semantics/openAccessoai::25522019-11-01T13:44:48Z |
| spellingShingle | Computational Experience On Four Algorithms For The Hard Clustering Problem AlSultan, K.S. Computer |
| status_str | publishedVersion |
| title | Computational Experience On Four Algorithms For The Hard Clustering Problem |
| title_full | Computational Experience On Four Algorithms For The Hard Clustering Problem |
| title_fullStr | Computational Experience On Four Algorithms For The Hard Clustering Problem |
| title_full_unstemmed | Computational Experience On Four Algorithms For The Hard Clustering Problem |
| title_short | Computational Experience On Four Algorithms For The Hard Clustering Problem |
| title_sort | Computational Experience On Four Algorithms For The Hard Clustering Problem |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/2552/1/computational_experience_on_four_algorit_alsultan_isi_a1996uc27800009.pdf |