The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Particle swarm optimization algorithm and its application to clustering analysis
Abstract
Clustering analysis is applied generally to pattern recognition, color quantization and image classification. It can help the user to distinguish the structure of data and simplify the complexity of data from mass information. The user can understand the implied information behind extracting these data. In real case, the distribution of information can be any size and shape. A particle swarm optimization algorithm-based technique, called PSO-clustering, is proposed in this article. We adopt the particle swarm optimization to search the cluster center in the arbitrary data set automatically. PSO can search the best solution from the probability option of the social-only model and cognition-only model. This method is quite simple and valid, and it can avoid the minimum local value. Finally, the effectiveness of the PSO-clustering is demonstrated on four artificial data sets.
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
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Particle swarm optimization: developments, applications and resources
Eberhart, & Shi, Y. (2001) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934374 · Cited by 4,310
Pattern Recognition Principles
(2009) · Classification Methods for Remotely Sensed Data, Second Edition · doi:10.1201/9781420090741.ch2 · Cited by 3,188
Genetic algorithm-based clustering technique
Maulik, U., & Bandyopadhyay, S. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00137-5 · Cited by 1,459
K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
Selim, S. Z., & Ismail, M. A. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767478 · Cited by 1,212
Genetic-algorithm programming environments
Ribeiro Filho, J. L., Treleaven, P. C., & Alippi, C. (1994) · Computer · doi:10.1109/2.294850 · Cited by 284
Cited by
Swarm Intelligence in Optimization
Blum, C., & Li, X. (2008) · Natural Computing Series · doi:10.1007/978-3-540-74089-6_2 · Cited by 396
Esmin, A. A. A., Coelho, R. A., & Matwin, S. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-013-9400-4 · Cited by 340
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
Biswal, B., Dash, P. K., & Panigrahi, B. K. (2009) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2008.928111 · Cited by 262
Metadata
- Authors
- Chen, C.-Y., & Ye, F.
- Venue
- IEEE International Conference on Networking, Sensing and Control, 2004
- Publisher
- IEEE
- Published
- 2004-06-10
- Volume
- 2
- Pages
- 789-794
- OpenAlex
- W2163163936
- Cited by
- 263
- References
- 9
- FWCI
- 3.25
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Particle swarm optimization algorithm and its application to clustering analysis. https://app.cochat.ai/papers/10.1109/icnsc.2004.1297047
- The paper
- Chen, C.-Y., & Ye, F. (2004). Particle swarm optimization algorithm and its application to clustering analysis. IEEE International Conference on Networking, Sensing and Control, 2004. https://doi.org/10.1109/icnsc.2004.1297047
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.