The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Differential evolution and particle swarm optimisation in partitional clustering
Open accessAbstract
Many partitional clustering algorithms based on genetic algorithms (GA) have been proposed to tackle the problem of finding the optimal partition of a data set. Very few studies considered alternative stochastic search heuristics other than GAs or simulated annealing. Two promising algorithms for numerical optimisation, which are hardly known outside the search heuristics field, are particle swarm optimisation (PSO) and differential evolution (DE). The performance of GAs for a representative point evolution approach to clustering is compared with PSO and DE. The empirical results show that DE is clearly and consistently superior compared to GAs and PSO for hard clustering problems, both with respect to precision as well as robustness (reproducibility) of the results. Only for simple data sets, the GA and PSO can obtain the same quality of results. Apart from superior performance, DE is easy to implement and requires hardly any parameter tuning compared to substantial tuning for GAs and PSOs. Our study shows that DE rather than GAs should receive primary attention in partitional clustering algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,168
A dendrite method for cluster analysis
Caliński, T., & Harabasz, J. (1974) · Communications in Statistics · doi:10.1080/03610927408827101 · Cited by 4,480
Artificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
Lectu re Notes in Economics and Mathematical Systems
Beckmann, M. J., & Künzi, H. P. (1975) · Cited by 2,414
Model-Based Gaussian and Non-Gaussian Clustering
Banfield, J. D., & Raftery, A. E. (1993) · Biometrics · doi:10.2307/2532201 · Cited by 2,395
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
How to Solve It: Modern Heuristics
Michalewicz, Z., & Fogel, D. B. (2000) · Springer eBooks · doi:10.1007/978-3-662-04131-4 · Cited by 2,207
Cluster analysis of multivariate data : efficiency versus interpretability of classifications
Forgy, E. W. (1965) · Biometrics · Cited by 2,093
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
Vesterstrom, J., & Thomsen, R. (2005) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1331139 · Cited by 1,205
Gaussian parsimonious clustering models
Celeux, G., & Govaert, G. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00125-6 · Cited by 872
10.2 Maximum Likelihood from Incomplete Data
(2024) · Hierarchical Quantile Modeling · doi:10.1051/978-2-7598-3719-9.c026 · Cited by 780
An introduction to differential evolution
Price, K. V. (1999) · McGraw-Hill Ltd., UK eBooks · Cited by 740
Genetic Algorithms and Grouping Problems
Falkenauer, E. (1998) · Cited by 674
On Some Invariant Criteria for Grouping Data
Friedman, H. P., & Rubin, J. (1967) · Journal of the American Statistical Association · doi:10.1080/01621459.1967.10500923 · Cited by 613
Genetic Algorithms and grouping problems
Nicholson, M. (1998) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199808)28:10<1137::aid-spe192>3.0.co;2-4 · Cited by 542
Genetic clustering for automatic evolution of clusters and application to image classification
Bandyopadhyay, S., & Maulik, U. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(01)00108-x · Cited by 434
Evolutionary Computation: The Fossil Record
Fogel, D. B. (1998) · Cited by 395
An evolutionary technique based on K-Means algorithm for optimal clustering in RN
Bandyopadhyay, S., & Maulik, U. (2002) · Information Sciences · doi:10.1016/s0020-0255(02)00208-6 · Cited by 367
Evolutionary Computation: Toward a New Philosophy of Machine Intelligence
Fogel, D. B. (2005) · Wiley eBooks · doi:10.1002/0471749214 · Cited by 302
Fuzzy partitioning using a real-coded variable-length genetic algorithm for pixel classification
Maulik, U., & Bandyopadhyay, S. (2003) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2003.810924 · Cited by 268
On the Complexity of Clustering Problems
Brucker, P. (1978) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-95322-4_5 · Cited by 266
Particle swarm optimisation with spatial particle extension
Krink, T., Vesterstrom, J. S., & Riget, J. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004460 · Cited by 232
Self-citationPractical Problems in a Method of Cluster Analysis
Marriott, F. H. C. (1971) · Biometrics · doi:10.2307/2528592 · Cited by 222
A genetic approach to the automatic clustering problem
Tseng, L., & Yang, S. B. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(00)00005-4 · Cited by 208
Extending particle swarm optimisers with self-organized criticality
Løvbjerg, M., & Krink, T. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2002.1004479 · Cited by 179
Self-citationEditing for the k-nearest neighbors rule by a genetic algorithm
Kuncheva, L. I. (1995) · Pattern Recognition Letters · doi:10.1016/0167-8655(95)00047-k · Cited by 172
Noisy optimization problems - a particular challenge for differential evolution?
Krink, T., Filipič, B., & Fogel, G. B. (2004) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2004.1330876 · Cited by 130
Self-citationPattern classification with genetic algorithms
Bandyopadhyay, S., Murthy, C. A., & Pal, S. K. (1995) · Pattern Recognition Letters · doi:10.1016/0167-8655(95)00052-i · Cited by 96
Evolutionary Approaches for Cluster Analysis
Paterlini, S., & Minerva, T. (2003) · Physica-Verlag eBooks · doi:10.1007/978-3-7908-1768-3_15 · Cited by 37
Self-citationPattern classification using genetic algorithms: Determination of H
Bandyopadhyay, S., Murthy, C. A., & Pal, S. K. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(98)00097-x · Cited by 28
Simulated annealing based pattern classification
BANDYOPADHYAY, S., PAL, S., & MURTHY, C. (1998) · Information Sciences · doi:10.1016/s0020-0255(98)00017-6 · Cited by 21
Theoretical performance of genetic pattern classifier
Bandyopadhyay, S., Murthy, C. A., & Pal, S. K. (1999) · Journal of the Franklin Institute · doi:10.1016/s0016-0032(98)00035-0 · Cited by 21
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
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
Automatic Clustering Using an Improved Differential Evolution Algorithm
Das, S., Abraham, A., & Konar, A. (2008) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2007.909595 · Cited by 726
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
Das, S., Abraham, A., & Konar, A. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-78297-1_1 · Cited by 429
Metadata
- Authors
- Paterlini, S., & Krink, T.
- Venue
- Computational Statistics & Data Analysis
- Publisher
- Elsevier BV
- Published
- 2006-03
- Volume
- 50
- Issue
- 5
- Pages
- 1220-1247
- ISSN
- 0167-9473 (ISSN-L)
- OpenAlex
- W2026789128
- Cited by
- 296
- References
- 39
- FWCI
- 14.77
- Type
- journal article
- Language
- en
- Open access
- green
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.