A new partitioning around medoids algorithm
From MaRDI portal
Publication:4470105
DOI10.1080/0094965031000136012zbMATH Open1054.62075OpenAlexW1967702193WikidataQ56532423 ScholiaQ56532423MaRDI QIDQ4470105FDOQ4470105
Authors: Katherine Pollard, Jennifer Bryan, Mark J. Van der Laan 
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
Recommendations
- Clapper: a clustering algorithm based on path-distances for experimental replicates
- \(K\)-medoids clustering algorithm based on distance inequality
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- A Partitive Rough Clustering Algorithm
- A general partition cluster algorithm
Cited In (20)
- Clustering with the average silhouette width
- Discrete facility location in machine learning
- Clustering and classification based on the L\(_{1}\) data depth
- Maxima of moving maxima of continuous functions
- A new criterion for clustering algorithm
- A general partition cluster algorithm
- Stability estimation for unsupervised clustering: a review
- Model-based and nonparametric approaches to clustering for data compression in actuarial applications
- Constructing motion primitive sets to summarize periodic orbit families and hyperbolic invariant manifolds in a multi-body system
- Bayesian hierarchical profile regression for binary covariates
- An illustration of model agnostic explainability methods applied to environmental data
- Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data
- Binary whale optimization algorithm and binary moth flame optimization with clustering algorithms for clinical breast cancer diagnoses
- Clustering ranking data in market segmentation: a case study on the Italian McDonald's customers' preferences
- Learning context-dependent choice functions
- \(K\)-medoids clustering algorithm based on distance inequality
- Clustering on the torus by conformal prediction
- Covariance-based soft clustering of functional data based on the Wasserstein-Procrustes metric
- Hybrid cluster ensemble framework based on the random combination of data transformation operators
- Recovery guarantees for exemplar-based clustering
This page was built for publication: A new partitioning around medoids algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470105)
