The DOI matches its Crossref record; 21 of the 21 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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
(1967) · Cited by 23,719
Davies, D. L., & Bouldin, D. W. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766909 · Cited by 9,145
Hubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Adams, R., & Bischof, L. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.295913 · Cited by 3,138
Statistical Analysis of Finite Mixture Distributions.
Lindsay, B. G., Titterington, D. M., Smith, A. F. M., & Makov, U. E. (1987) · Journal of the American Statistical Association · doi:10.2307/2289504 · Cited by 2,905
Well-Separated Clusters and Optimal Fuzzy Partitions
Dunn†, J. C. (1974) · Journal of Cybernetics · doi:10.1080/01969727408546059 · Cited by 2,510
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
Some new indexes of cluster validity
Bezdek, J. C., & Pal, N. R. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.678624 · Cited by 1,132
Clustering Using a Similarity Measure Based on Shared Near Neighbors
Jarvis, R. A., & Patrick, E. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223640 · Cited by 955
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
Clustering with a genetically optimized approach
Hall, L. O., Ozyurt, I. B., & Bezdek, J. C. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771164 · Cited by 409
Agglomerative clustering using the concept of mutual nearest neighbourhood
Chidananda Gowda, K., & Krishna, G. (1978) · Pattern Recognition · doi:10.1016/0031-3203(78)90018-3 · Cited by 405
Competitive Environments Evolve Better Solutions for Complex Tasks
Angeline, P. J., & Pollack, J. B. (1993) · Cited by 263
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
Finding Salient Regions in Images
Pauwels, E., & Frederix, G. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0763 · Cited by 125
A cellular coevolutionary algorithm for image segmentation
Veenman, C. J., Reinders, M. J. T., & Backer, E. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.806256 · Cited by 53
Self-citationA stochastic connectionist approach for global optimization with application to pattern clustering
Babu, G. P., Narasimha Murty, M., & Keerthi, S. S. (2000) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/3477.826943 · Cited by 15
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
Study on density peaks clustering based on k-nearest neighbors and principal component analysis
Du, M., Ding, S., & Jia, H. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.02.001 · Cited by 520
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
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
- 21
- 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
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.