A new semi-supervised algorithm using silhouette width for clustering arbitrary-scaled data
From MaRDI portal
Cites work
- A new algorithm for clustering based on kernel density estimation
- A new clustering accuracy measure based on relative distances and its cross-validation using Dirichlet distribution
- A new interpoint distance-based clustering algorithm using kernel density estimation
- A new measure for assessment of clustering based on kernel density estimation
- A new nonparametric interpoint distance-based measure for assessment of clustering
- Algorithm AS 136: A K-Means Clustering Algorithm
- An introduction to copulas.
- Applied multivariate statistical analysis.
- Cluster analysis.
- Clustering of gamma-ray bursts through kernel principal component analysis
- Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data
- Determination of the number of clusters through logistic regression analysis
- Evaluation of the number of clusters in a data set using p -values from multiple tests of hypotheses
- Finite mixture models
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 1964693 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Pattern classification.
- SELP: semi-supervised evidential label propagation algorithm for graph data clustering
- Semi-supervised clustering methods
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Unsupervised classification of eclipsing binary light curves through \(k\)-medoids clustering
- Validity index for crisp and fuzzy clusters
This page was built for publication: A new semi-supervised algorithm using silhouette width for clustering arbitrary-scaled data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391332)
