The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Genetic K-means algorithm
Abstract
In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optimal partition of a given data into a specified number of clusters. GA's used earlier in clustering employ either an expensive crossover operator to generate valid child chromosomes from parent chromosomes or a costly fitness function or both. To circumvent these expensive operations, we hybridize GA with a classical gradient descent algorithm used in clustering, viz. K-means algorithm. Hence, the name genetic K-means algorithm (GKA). We define K-means operator, one-step of K-means algorithm, and use it in GKA as a search operator instead of crossover. We also define a biased mutation operator specific to clustering called distance-based-mutation. Using finite Markov chain theory, we prove that the GKA converges to the global optimum. It is observed in the simulations that GKA converges to the best known optimum corresponding to the given data in concurrence with the convergence result. It is also observed that GKA searches faster than some of the other evolutionary algorithms used for clustering.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
An introduction to simulated evolutionary optimization
Fogel, D. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265956 · Cited by 1,503
Convergence analysis of canonical genetic algorithms
Rudolph, G. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265964 · Cited by 1,484
A simulated annealing algorithm for the clustering problem
Selim, S. Z., & Alsultan, K. (1991) · Pattern Recognition · doi:10.1016/0031-3203(91)90097-o · Cited by 459
Experiments in projection and clustering by simulated annealing
Klein, R. W., & Dubes, R. C. (1989) · Pattern Recognition · doi:10.1016/0031-3203(89)90067-8 · Cited by 176
Cited by
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Clustering of time series data—a survey
Warren Liao, T. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.01.025 · Cited by 2,401
Machine learning for medical imaging
Erickson, B. J., Korfiatis, P., Akkus, Z., & Kline, T. L. (2017) · RadioGraphics · doi:10.1148/rg.2017160130 · Cited by 1,672
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
Explainable Artificial Intelligence in education
Khosravi, H., Shum, S. B., Chen, G., Conati, C., Tsai, Y.-S., Kay, J., Knight, S., Martinez-Maldonado, R., Sadiq, S., & Gašević, D. (2022) · Computers and Education: Artificial Intelligence · doi:10.1016/j.caeai.2022.100074 · Cited by 863
Tsai, C.-W., Lai, C.-F., Chao, H.-C., & Vasilakos, A. V. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0030-3 · Cited by 818
A 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
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
Data Mining for Internet of Things: A Survey
Tsai, C.-W., Lai, C.-F., Chiang, M.-C., & Yang, L. T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.103013.00206 · Cited by 620
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
Personalized Recommendation System Based on Collaborative Filtering for IoT Scenarios
Cui, Z., Xu, X., Xue, F., Cai, X., Cao, Y., Zhang, W., & Chen, J. (2020) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.2964552 · Cited by 543
K-means properties on six clustering benchmark datasets
Fränti, P., & Sieranoja, S. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1238-7 · Cited by 518
Scaffold-GS: Structured 3D Gaussians for View-Adaptive Rendering
Lu, T., Yu, M., Xu, L., Xiangli, Y., Wang, L., Lin, D., & Dai, B. (2024) · 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52733.2024.01952 · Cited by 491
A Gentle Introduction to Memetic Algorithms
Moscato, P., & Cotta, C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_5 · Cited by 457
A maximum variance cluster algorithm
Veenman, C. J., Reinders, M. J. T., & Backer, E. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1033218 · Cited by 455
How much can k-means be improved by using better initialization and repeats?
Fränti, P., & Sieranoja, S. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.04.014 · Cited by 451
An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis
Niknam, T., & Amiri, B. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2009.07.001 · Cited by 433
Clustering Algorithms in Biomedical Research: A Review
Xu, R., & Wunsch, D. C. (2010) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2010.2083647 · Cited by 349
Machine Learning and Deep Learning in smart manufacturing: The Smart Grid paradigm
Kotsiopoulos, T., Sarigiannidis, P., Ioannidis, D., & Tzovaras, D. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2020.100341 · Cited by 341
Ranjbarzadeh, R., Caputo, A., Tirkolaee, E. B., Jafarzadeh Ghoushchi, S., & Bendechache, M. (2023) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2022.106405 · Cited by 333
Clustering: A neural network approach
Du, K.-L. (2010) · Neural Networks · doi:10.1016/j.neunet.2009.08.007 · Cited by 325
Rahaman, M. M., Li, C., Yao, Y., Kulwa, F., Wu, X., Li, X., & Wang, Q. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2021.104649 · Cited by 320
Machine Learning Based Workload Prediction in Cloud Computing
Gao, J., Wang, H., & Shen, H. (2020) · 2020 29th International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn49398.2020.9209730 · Cited by 311
Differential evolution and particle swarm optimisation in partitional clustering
Paterlini, S., & Krink, T. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.12.004 · Cited by 296
Development of a YOLO-V3-based model for detecting defects on steel strip surface
Kou, X., Liu, S., Cheng, K., & Qian, Y. (2021) · Measurement · doi:10.1016/j.measurement.2021.109454 · Cited by 294
Aliramezani, M., Koch, C. R., & Shahbakhti, M. (2022) · Progress in Energy and Combustion Science · doi:10.1016/j.pecs.2021.100967 · Cited by 288
Agglomerative Fuzzy K-Means Clustering Algorithm with Selection of Number of Clusters
Li, M. J., Ng, M. K., Cheung, Y.-M., & Huang, J. Z. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.88 · Cited by 281
K-Means Clustering Versus Validation Measures: A Data-Distribution Perspective
Xiong, H., Wu, J., & Chen, J. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.2004559 · Cited by 277
A review on particle swarm optimization algorithms and their applications to data clustering
Rana, S., Jasola, S., & Kumar, R. (2011) · Artificial Intelligence Review · doi:10.1007/s10462-010-9191-9 · Cited by 271
The Internet of Things: A Review of Enabled Technologies and Future Challenges
Ud Din, I., Guizani, M., Hassan, S., Kim, B.-S., Khurram Khan, M., Atiquzzaman, M., & Ahmed, S. H. (2019) · IEEE Access · doi:10.1109/access.2018.2886601 · Cited by 254
Improving Medical Images Classification With Label Noise Using Dual-Uncertainty Estimation
Ju, L., Wang, X., Wang, L., Mahapatra, D., Zhao, X., Zhou, Q., Liu, T., & Ge, Z. (2022) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2022.3141425 · Cited by 128
Metadata
- Authors
- Krishna, K., & Narasimha Murty, M.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 1999-06
- Volume
- 29
- Issue
- 3
- Pages
- 433-439
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2103868202
- Cited by
- 1,717
- References
- 9
- FWCI
- 5.70
- 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.