An efficient k‐means‐type algorithm for clustering datasets with incomplete records
From MaRDI portal
Publication:4970437
Cites work
- k-POD: A Method for k-Means Clustering of Missing Data
- A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
- Algorithm AS 136: A K-Means Clustering Algorithm
- Applied multivariate statistical analysis.
- Bootstrapping for Significance of Compact Clusters in Multidimensional Datasets
- CARP: software for fishing out good clustering algorithms
- Clustering in the Presence of Scatter
- Clustering with missing values
- Finding the Number of Clusters in a Dataset
- Finite mixture models and model-based clustering
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 4088699 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Least squares quantization in PCM
- MM optimization algorithms
- Rough fuzzy subspace clustering for data with missing values
- Rough subspace neuro-fuzzy system
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- The statistical analysis of functional MRI data
Cited in
(2)
This page was built for publication: An efficient k‐means‐type algorithm for clustering datasets with incomplete records
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4970437)