The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Automatic Clustering Using an Improved Differential Evolution Algorithm
Abstract
Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the automatic clustering of large unlabeled data sets. In contrast to most of the existing clustering techniques, the proposed algorithm requires no prior knowledge of the data to be classified. Rather, it determines the optimal number of partitions of the data “on the run.” Superiority of the new method is demonstrated by comparing it with two recently developed partitional clustering techniques and one popular hierarchical clustering algorithm. The partitional clustering algorithms are based on two powerful well-known optimization algorithms, namely the genetic algorithm and the particle swarm optimization. An interesting real-world application of the proposed method to automatic segmentation of images is also reported.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
(1967) · Cited by 23,719
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
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Self-citationBlack 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
Differential Evolution Using a Neighborhood-Based Mutation Operator
Das, S., Abraham, A., Chakraborty, U. K., & Konar, A. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009457 · Cited by 1,165
Self-citationA Survey of Evolutionary Algorithms for Clustering
Hruschka, E. R., Campello, R. J. G. B., Freitas, A. A., & de Carvalho, A. C. P. L. F. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2008.2007252 · Cited by 759
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
Differential Evolution With Ranking-Based Mutation Operators
Gong, W., & Cai, Z. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2239988 · Cited by 401
Wang, Y., Li, H.-X., Huang, T., & Li, L. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.01.038 · Cited by 335
Kang, Q., Wang, J., Zhou, M., & Ammari, A. C. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2487323 · Cited by 328
Differential Evolution With an Individual-Dependent Mechanism
Tang, L., Dong, Y., & Liu, J. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2360890 · Cited by 310
Aliguliyev, R. M. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.11.022 · Cited by 265
Wu, G., Peng, W., Hu, X., Wang, R., & Chen, H. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100690 · Cited by 13
Metadata
- Authors
- Das, S., Abraham, A., & Konar, A.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Published
- 2008-01
- Volume
- 38
- Issue
- 1
- Pages
- 218-237
- ISSN
- 1083-4427 (ISSN-L)
- OpenAlex
- W2138810473
- Cited by
- 726
- References
- 58
- FWCI
- 24.82
- 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.