The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Semi‐supervised clustering methods
Open accessAbstract
Cluster analysis methods seek to partition a data set into homogeneous subgroups. It is useful in a wide variety of applications, including document processing and modern genetics. Conventional clustering methods are unsupervised, meaning that there is no outcome variable nor is anything known about the relationship between the observations in the data set. In many situations, however, information about the clusters is available in addition to the values of the features. For example, the cluster labels of some observations may be known, or certain observations may be known to belong to the same cluster. In other cases, one may wish to identify clusters that are associated with a particular outcome variable. This review describes several clustering algorithms (known as ‘semi‐supervised clustering’ methods) that can be applied in these situations. The majority of these methods are modifications of the popular k‐means clustering method, and several of them will be described in detail. A brief description of some other semi‐supervised clustering algorithms is also provided. This article is categorized under:Statistical Learning and Exploratory Methods of the Data Sciences > Clustering and Classification
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
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736
A framework for feature selection in clustering
Witten, D. M., & Tibshirani, R. (2010) · Journal of the American Statistical Association · doi:10.1198/jasa.2010.tm09415 · Cited by 696 · cited 4×
“Witten and Tibshirani 67 maximize (5) by using an algorithm that sets w j = 1 / √ n at the beginning of the procedure and then updates the w j ’s iteratively.”
MethodInfluential
Cited by
A survey on semi-supervised learning
van Engelen, J. E., & Hoos, H. H. (2020) · Machine Learning · doi:10.1007/s10994-019-05855-6 · Cited by 2,666
Machine Learning Methods for Small Data Challenges in Molecular Science
Dou, B., Zhu, Z., Merkurjev, E., Ke, L., Chen, L., Jiang, J., Zhu, Y., Liu, J., Zhang, B., & Wei, G.-W. (2023) · Chemical Reviews · doi:10.1021/acs.chemrev.3c00189 · Cited by 499
Deep Clustering: A Comprehensive Survey
Ren, Y., Pu, J., Yang, Z., Xu, J., Li, G., Pu, X., Yu, P. S., & He, L. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3403155 · Cited by 276
Danchin, A., Ouzounis, C., Tokuyasu, T., & Zucker, J. (2018) · Microbial Biotechnology · doi:10.1111/1751-7915.13284 · Cited by 56
Metadata
- Authors
- Bair, E.
- Venue
- WIREs Computational Statistics
- Publisher
- Wiley
- Published
- 2013-07-23
- Volume
- 5
- Issue
- 5
- Pages
- 349-361
- ISSN
- 1939-0068 (ISSN-L)
- 1939-5108
- OpenAlex
- W2952733303
- Cited by
- 200
- References
- 5
- FWCI
- 4.42
- 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: Semi‐supervised clustering methods. https://app.cochat.ai/papers/10.1002/wics.1270
- The paper
- Bair, E. (2013). Semi‐supervised clustering methods. WIREs Computational Statistics. https://doi.org/10.1002/wics.1270
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.