Modern algorithms of cluster analysis
From MaRDI portal
Recommendations
Cited in
(17)- A feasible \(k\)-means kernel trick under non-Euclidean feature space
- Data clustering based on the modified relaxation Cheeger cut model
- Methodically unified procedures for a conditional approach to outlier detection, clustering, and classification
- Detecting anomalies in fibre systems using 3-dimensional image data
- Clustering analysis in large graphs with rich attributes
- Approximating spectral clustering via sampling: a review
- scientific article; zbMATH DE number 4007495 (Why is no real title available?)
- Quasifibrations of graphs to find symmetries and reconstruct biological networks
- Fast cluster tendency assessment for big, high-dimensional data
- A new clustering preserving transformation for \(k\)-means algorithm output
- Biclustering multivariate discrete longitudinal data
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- Reducing the dimensionality and granularity in hierarchical categorical variables
- Hierarchical clustering with OWA-based linkages, the Lance-Williams formula, and dendrogram inversions
- Clustering with minimum spanning trees: how good can it be?
- Cluster validation based on Fisher's linear discriminant analysis
- Structure in complex networks
This page was built for publication: Modern algorithms of cluster analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602704)