Modified ACS centroid memory for data clustering
Ant Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity and adaptiveness to different optimization problems. The key component that governs the search process in this algorithm is the management of its memory model. In...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Science Publications
2019
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/27858/1/jcssp%2015%2010%202019%201439%201449.pdf |
| _version_ | 1825805702667436032 |
|---|---|
| author | Jabbar, Ayad Mohammed Ku-Mahamud, Ku Ruhana Sagban, Rafid |
| author_facet | Jabbar, Ayad Mohammed Ku-Mahamud, Ku Ruhana Sagban, Rafid |
| author_sort | Jabbar, Ayad Mohammed |
| collection | UUM |
| description | Ant Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity
and adaptiveness to different optimization problems. The key component that governs the search process in this algorithm is the management of its memory model. In contrast to other algorithms, ACO explicitly utilizes an
adaptive memory, which is important to its performance in terms of producing optimal results. The algorithm’s memory records previous search regions and is fully responsible for transferring the neighborhood of the current structures to the next iteration. Ant Colony Optimization for
Clustering (ACOC) is a swarm algorithm inspired from nature to solve clustering issues as optimization problems. However, ACOC defined
implicit memory (pheromone matrix) inability to retain previous information on an ant’s movements in the pheromone matrix. The problem arises because ACOC is a centroid-label clustering algorithm, in which the relationship between a centroid and instance is unstable. The label of the current centroid value changes from one iteration to another because of changes in centroid label. Thus the pheromone values are lost because they are associated with the label (position) of the centroid. ACOC cannot
transfer the current clustering solution to the next iterations due to the history of the search being lost during the algorithm run. This study
proposes a new centroid memory (A-ACOC) for data clustering that can retain the information of a previous clustering solution. This is possible
because the pheromone is associated with the adaptive instance and not with label of the centroid. Centroids will be identified based on the adaptive instance route. A comparison of the performance of several common clustering algorithms using real-world data sets shows that the accuracy of the proposed algorithm surpasses those of its counterparts. |
| first_indexed | 2024-07-04T06:36:35Z |
| format | Article |
| id | uum-27858 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:36:35Z |
| publishDate | 2019 |
| publisher | Science Publications |
| record_format | eprints |
| spelling | uum-278582020-11-10T05:41:00Z https://repo.uum.edu.my/id/eprint/27858/ Modified ACS centroid memory for data clustering Jabbar, Ayad Mohammed Ku-Mahamud, Ku Ruhana Sagban, Rafid QA75 Electronic computers. Computer science Ant Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity and adaptiveness to different optimization problems. The key component that governs the search process in this algorithm is the management of its memory model. In contrast to other algorithms, ACO explicitly utilizes an adaptive memory, which is important to its performance in terms of producing optimal results. The algorithm’s memory records previous search regions and is fully responsible for transferring the neighborhood of the current structures to the next iteration. Ant Colony Optimization for Clustering (ACOC) is a swarm algorithm inspired from nature to solve clustering issues as optimization problems. However, ACOC defined implicit memory (pheromone matrix) inability to retain previous information on an ant’s movements in the pheromone matrix. The problem arises because ACOC is a centroid-label clustering algorithm, in which the relationship between a centroid and instance is unstable. The label of the current centroid value changes from one iteration to another because of changes in centroid label. Thus the pheromone values are lost because they are associated with the label (position) of the centroid. ACOC cannot transfer the current clustering solution to the next iterations due to the history of the search being lost during the algorithm run. This study proposes a new centroid memory (A-ACOC) for data clustering that can retain the information of a previous clustering solution. This is possible because the pheromone is associated with the adaptive instance and not with label of the centroid. Centroids will be identified based on the adaptive instance route. A comparison of the performance of several common clustering algorithms using real-world data sets shows that the accuracy of the proposed algorithm surpasses those of its counterparts. Science Publications 2019 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/27858/1/jcssp%2015%2010%202019%201439%201449.pdf Jabbar, Ayad Mohammed and Ku-Mahamud, Ku Ruhana and Sagban, Rafid (2019) Modified ACS centroid memory for data clustering. Journal of Computer Science, 15 (10). pp. 1439-1449. ISSN 1549-3636 http://doi.org/10.3844/jcssp.2019.1439.1449 doi:10.3844/jcssp.2019.1439.1449 doi:10.3844/jcssp.2019.1439.1449 |
| spellingShingle | QA75 Electronic computers. Computer science Jabbar, Ayad Mohammed Ku-Mahamud, Ku Ruhana Sagban, Rafid Modified ACS centroid memory for data clustering |
| title | Modified ACS centroid memory for data clustering |
| title_full | Modified ACS centroid memory for data clustering |
| title_fullStr | Modified ACS centroid memory for data clustering |
| title_full_unstemmed | Modified ACS centroid memory for data clustering |
| title_short | Modified ACS centroid memory for data clustering |
| title_sort | modified acs centroid memory for data clustering |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/27858/1/jcssp%2015%2010%202019%201439%201449.pdf |
| work_keys_str_mv | AT jabbarayadmohammed modifiedacscentroidmemoryfordataclustering AT kumahamudkuruhana modifiedacscentroidmemoryfordataclustering AT sagbanrafid modifiedacscentroidmemoryfordataclustering |