Merging \(K\)-means with hierarchical clustering for identifying general-shaped groups

DOI10.1002/STA4.172WikidataQ57709220 ScholiaQ57709220MaRDI QIDQ6541443

Anna D. Peterson, Arka P. Ghosh, Ranjan Maitra

Publication date: 19 May 2024

Published in: Stat (Search for Journal in Brave)

zbMATH Keywords

distance measurehierarchical clustering\(K\)-means algorithmsingle linkagecomplete linkage

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Estimating the number of clusters in a data set via the gap statistic
• Algorithm AS 136: A K-Means Clustering Algorithm
• Methods for merging Gaussian mixture components
• Statistical theory in clustering
• A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
• Clustering in the Presence of Scatter
• Finding Groups in Data
• Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• Finding the Number of Clusters in a Dataset
• Finite mixture models
• Bootstrapping for Significance of Compact Clusters in Multidimensional Datasets
• Tight Clustering: A Resampling‐Based Approach for Identifying Stable and Tight Patterns in Data

Related Items (2)

Fast and robust clustering of general-shaped structures with tk-merge ⋮ Skeleton Clustering: Dimension-Free Density-Aided Clustering

This page was built for publication: Merging \(K\)-means with hierarchical clustering for identifying general-shaped groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541443)