a multiple pheromone table based ant colony optimization for clustering
Clicks: 153
ID: 147237
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
153 views
9 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #307 of 1,093 articles by views in journal of power sources
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Ant colony optimization (ACO) is an efficient heuristic algorithm for combinatorial optimization problems, such as clustering. Because the search strategy of ACO is similar to those of other well-known heuristics, the probability of searching particular regions will be increased if better results are found and kept. Although this kind of search strategy may find a better approximate solution, it also has a high probability of losing the potential search directions. To prevent the ACO from losing too many potential search directions at the early iterations, a novel pheromone updating strategy is presented in this paper. In addition to the “original” pheromone table used to keep track of the promising information, a second pheromone table is added to the proposed algorithm to keep track of the unpromising information so as to increase the probability of searching directions worse than the current solutions. Several well-known clustering datasets are used to evaluate the performance of the proposed method in this paper. The experimental results show that the proposed method can provide better results than ACO and other clustering algorithms in terms of quality.
| Reference Key |
hu2015mathematicala
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Kai-Cheng Hu;Chun-Wei Tsai;Ming-Chao Chiang;Chu-Sing Yang |
| Journal | journal of power sources |
| Year | 2015 |
| DOI |
10.1155/2015/158632
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.