Semi-supervised clustering methods
From MaRDI portal
Publication:6607905
DOI10.1002/WICS.1270zbMATH Open1545.62006MaRDI QIDQ6607905FDOQ6607905
Authors: Eric Bair 
Publication date: 19 September 2024
Published in: Wiley Interdisciplinary Reviews. WIREs Computational Statistics (Search for Journal in Brave)
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- A framework for feature selection in clustering
- Estimating the number of clusters in a data set via the gap statistic
- Title not available (Why is that?)
- Finding the Number of Clusters in a Dataset
- Least squares quantization in PCM
- Title not available (Why is that?)
- Title not available (Why is that?)
- Text classification from labeled and unlabeled documents using EM
- The Elements of Statistical Learning
- Learning a Mahalanobis distance metric for data clustering and classification
- Semi-supervised graph clustering: a kernel approach
- Semi-supervised clustering with user feedback
- Semi-supervised clustering with metric learning: an adaptive kernel method
- Complementary hierarchical clustering
Cited In (4)
- Network-based semisupervised clustering
- Stability estimation for unsupervised clustering: a review
- Selection of number of clusters and warping penalty in clustering functional electrocardiogram
- Semi-supervised clustering of time-dependent categorical sequences with application to discovering education-based life patterns
This page was built for publication: Semi-supervised clustering methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607905)
