The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
A modified version of the K-means algorithm with a distance based on cluster symmetry
Abstract
We propose a modified version of the K-means algorithm to cluster data. The proposed algorithm adopts a novel nonmetric distance measure based on the idea of "point symmetry". This kind of "point symmetry distance" can be applied in data clustering and human face detection. Several data sets are used to illustrate its effectiveness.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Pattern Recognition Principles
(2009) · Classification Methods for Remotely Sensed Data, Second Edition · doi:10.1201/9781420090741.ch2 · Cited by 3,188
Gordon, A. D., & Hartigan, J. A. (1976) · Journal of the American Statistical Association · doi:10.2307/2286880 · Cited by 2,569
A massively parallel architecture for a self-organizing neural pattern recognition machine
Carpenter, G. A., & Grossberg, S. (1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80014-2 · Cited by 2,525
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
ART 2: self-organization of stable category recognition codes for analog input patterns
Carpenter, G. A., & Grossberg, S. (1987) · Applied Optics · doi:10.1364/ao.26.004919 · Cited by 1,442
Cited by
The k-means Algorithm: A Comprehensive Survey and Performance Evaluation
Ahmed, M., Seraj, R., & Islam, S. M. S. (2020) · Electronics · doi:10.3390/electronics9081295 · Cited by 1,717
K‐means clustering: A half‐century synthesis
Steinley, D. (2006) · British Journal of Mathematical and Statistical Psychology · doi:10.1348/000711005x48266 · Cited by 1,120
A new cluster validity measure and its application to image compression
Chou, C.-H., Su, M.-C., & Lai, E. (2004) · Pattern Analysis and Applications · doi:10.1007/s10044-004-0218-1 · Cited by 326
Self-citationYang, Y., Campana, P. E., & Yan, J. (2020) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2020.109967 · Cited by 82
Mapping and classifying molecules from a high-throughput structural database
De, S., Musil, F., Ingram, T., Baldauf, C., & Ceriotti, M. (2017) · Journal of Cheminformatics · doi:10.1186/s13321-017-0192-4 · Cited by 42
Metadata
- Authors
- Su, M.-C., & Chou, C.-H.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2001-06
- Volume
- 23
- Issue
- 6
- Pages
- 674-680
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2164947855
- Cited by
- 389
- References
- 21
- FWCI
- 6.38
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A modified version of the K-means algorithm with a distance based on cluster symmetry. https://app.cochat.ai/papers/10.1109/34.927466
- The paper
- Su, M.-C., & Chou, C.-H. (2001). A modified version of the K-means algorithm with a distance based on cluster symmetry. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.927466
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.
