The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A maximum variance cluster algorithm
Open accessAbstract
We present a partitional cluster algorithm that minimizes the sum-of-squared-error criterion while imposing a hard constraint on the cluster variance. Conceptually, hypothesized clusters act in parallel and cooperate with their neighboring clusters in order to minimize the criterion and to satisfy the variance constraint. In order to enable the demarcation of the cluster neighborhood without crucial parameters, we introduce the notion of foreign cluster samples. Finally, we demonstrate a new method for cluster tendency assessment based on varying the variance constraint parameter.
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
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
Hubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
Cited by
dbscan: Fast Density-Based Clustering with R
Hahsler, M., Piekenbrock, M., & Doran, D. (2019) · Journal of Statistical Software · doi:10.18637/jss.v091.i01 · Cited by 802
Identification of cell types from single-cell transcriptomes using a novel clustering method
Xu, C., & Su, Z. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv088 · Cited by 559
Shared-nearest-neighbor-based clustering by fast search and find of density peaks
Liu, R., Wang, H., & Yu, X. (2018) · Information Sciences · doi:10.1016/j.ins.2018.03.031 · Cited by 429
An overview of clustering methods
Omran, M. G. H., Engelbrecht, A. P., & Salman, A. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11602 · Cited by 424
Symbolic time series analysis via wavelet-based partitioning
Rajagopalan, V., & Ray, A. (2006) · Signal Processing · doi:10.1016/j.sigpro.2006.01.014 · Cited by 267
Metadata
- Authors
- Veenman, C. J., Reinders, M. J. T., & Backer, E.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-09
- Volume
- 24
- Issue
- 9
- Pages
- 1273-1280
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W1972098431
- Cited by
- 455
- References
- 2
- FWCI
- 2.34
- 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
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 maximum variance cluster algorithm. https://app.cochat.ai/papers/10.1109/tpami.2002.1033218
- The paper
- Veenman, C. J., Reinders, M. J. T., & Backer, E. (2002). A maximum variance cluster algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2002.1033218
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.
