The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Pujol, J. M., Delgado, J., Ramon Sangüesa, A., & Flache, A. (2005) · International Joint Conference on Artificial Intelligence · Cited by 5,771
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
A Particle Swarm Optimization Approach for Optimum Design of PID Controller in AVR System
Gaing, Z.-L. (2004) · IEEE Transactions on Energy Conversion · doi:10.1109/tec.2003.821821 · Cited by 1,774
Krishna, K., & Narasimha Murty, M. (1999) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.764879 · Cited by 1,717
Genetic algorithm-based clustering technique
Maulik, U., & Bandyopadhyay, S. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00137-5 · Cited by 1,459
Data mining with an ant colony optimization algorithm
Parpinelli, R. S., Lopes, H. S., & Freitas, A. A. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802452 · Cited by 985
An ant colony approach for clustering
Shelokar, P. S., Jayaraman, V. K., & Kulkarni, B. D. (2004) · Analytica Chimica Acta · doi:10.1016/j.aca.2003.12.032 · Cited by 514
An efficient k′-means clustering algorithm
Žalik, K. R. (2008) · Pattern Recognition Letters · doi:10.1016/j.patrec.2008.02.014 · Cited by 370
A hybridized approach to data clustering
Kao, Y.-T., Zahara, E., & Kao, I.-W. (2007) · Expert Systems with Applications · doi:10.1016/j.eswa.2007.01.028 · Cited by 345
Mullen, R. J., Monekosso, D., Barman, S., & Remagnino, P. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.01.020 · Cited by 188
A study of some properties of Ant-Q
Dorigo, M., & Gambardella, L. M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_1029 · Cited by 176
A genetic algorithm that exchanges neighboring centers for k-means clustering
Laszlo, M. J., & Mukherjee, S. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2007.08.006 · Cited by 146
A tabu-search-based heuristic for clustering
Sung, C. S., & Jin, H. W. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00090-4 · Cited by 129
Clustering categorical data sets using tabu search techniques
Ng, M. K., & Wong, J. C. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(02)00021-3 · Cited by 97
Niknam, T. (2006) · Annual Conference of the IEEE Industrial Electronics Society (IECON) · doi:10.1109/iecon.2006.347222 · Cited by 29
Self-citationAn Ant Colony Optimization Algorithm for Learning Classification Rules
Ji, J., Zhang, N., Liu, C., & Zhong, N. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.35 · Cited by 25
Phe-Q : A Pheromone Based Q-Learning
Monekosso, D., & Remagnino, P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45656-2_30 · Cited by 21
The analysis and performance evaluation of the pheromone‐Q‐learning algorithm
Monekosso, D., & Remagnino, P. (2004) · Expert Systems · doi:10.1111/j.1468-0394.2004.00265.x · Cited by 19
Cited by
Black hole: A new heuristic optimization approach for data clustering
Hatamlou, A. (2013) · Information Sciences · doi:10.1016/j.ins.2012.08.023 · Cited by 1,370
A survey on nature inspired metaheuristic algorithms for partitional clustering
Nanda, S. J., & Panda, G. (2014) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.11.003 · Cited by 574
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
Clustering using firefly algorithm: Performance study
Senthilnath, J., Omkar, S. N., & Mani, V. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.06.003 · Cited by 474
Improved salp swarm algorithm based on particle swarm optimization for feature selection
Ibrahim, R. A., Ewees, A. A., Oliva, D., Abd Elaziz, M., & Lu, S. (2019) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-018-1031-9 · Cited by 374
Metadata
- Authors
- Niknam, T., & Amiri, B.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2010-01
- Volume
- 10
- Issue
- 1
- Pages
- 183-197
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W1984779822
- Cited by
- 433
- References
- 20
- FWCI
- 15.18
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.