Fitting semiparametric clustering models to dissimilarity data
From MaRDI portal
Publication:484231
DOI10.1007/s11634-008-0025-4zbMath1306.62147OpenAlexW2051845845MaRDI QIDQ484231
Publication date: 18 December 2014
Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11634-008-0025-4
Related Items (3)
Classification of asymmetric proximity data ⋮ Clustering via finite nonparametric ICA mixture models ⋮ Hierarchical means clustering
Uses Software
Cites Work
- Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
- Cluster-wise assessment of cluster stability
- The best Euclidean fit to a given distance matrix in prescribed dimensions
- Parsimonious trees
- NP-hard problems in hierarchical-tree clustering
- A cutting plane algorithm for a clustering problem
- Factorization of matrices by least-squares
- Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
- Finding Groups in Data
- Recognition of Tree Metrics
- Fast Parallel Recognition of Ultrametrics and Tree Metrics
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Some distance properties of latent root and vector methods used in multivariate analysis
- Admissible clustering procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fitting semiparametric clustering models to dissimilarity data