A new partitioning around medoids algorithm

DOI10.1080/0094965031000136012zbMath1054.62075OpenAlexW1967702193WikidataQ56532423 ScholiaQ56532423MaRDI QIDQ4470105

Katherine S. Pollard, Jennifer Bryan

Publication date: 22 June 2004

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://biostats.bepress.com/cgi/viewcontent.cgi?article=1003&context=ucbbiostat

zbMATH Keywords

Cluster analysisGene expressionParameterSilhouette

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (13)

Clustering and classification based on the L\(_{1}\) data depth ⋮ Clustering with the average silhouette width ⋮ Constructing motion primitive sets to summarize periodic orbit families and hyperbolic invariant manifolds in a multi-body system ⋮ Discrete facility location in machine learning ⋮ Recovery guarantees for exemplar-based clustering ⋮ Maxima of moving maxima of continuous functions ⋮ Model-Based and Nonparametric Approaches to Clustering for Data Compression in Actuarial Applications ⋮ Clustering ranking data in market segmentation: a case study on the Italian McDonald's customers’ preferences ⋮ Hybrid cluster ensemble framework based on the random combination of data transformation operators ⋮ Learning context-dependent choice functions ⋮ Clustering on the torus by conformal prediction ⋮ Binary whale optimization algorithm and binary moth flame optimization with clustering algorithms for clinical breast cancer diagnoses ⋮ Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data

This page was built for publication: A new partitioning around medoids algorithm