Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Genetics (11)
- Density estimation (3)
- Gene expression (3)
- Model selection (3)
- Multiple comparison (3)
-
- Survival analysis (3)
- Censored data (2)
- Cluster analysis (2)
- Comparative genomic hybridization (2)
- Counting process (2)
- Cross-validation (2)
- Family-wise error rate control (2)
- Linkage mapping (2)
- Loss function (2)
- Microarray (2)
- Multivariate outcome (2)
- Prediction (2)
- Regression trees (2)
- Risk (2)
- Additive hazards models (1)
- Adjust p value (1)
- Annotation metadata; Gene Ontology (GO); genomics; microarray; multiple hypothesis testing; resampling (1)
- Auto-correlation (1)
- BLUPs; Kernel function; Model/variable selection; Nonparametric regression; Penalized likelihood; REML; Score test; Smoothing parameter; Support vector machines (1)
- BRCA1 (1)
- BRCA2 (1)
- BRCAPRO (1)
- Bayes Factor (1)
- Bayesian (1)
- Block (1)
- Publication Year
- Publication
- Publication Type
Articles 31 - 31 of 31
Full-Text Articles in Statistical Theory
A New Partitioning Around Medoids Algorithm, Mark J. Van Der Laan, Katherine S. Pollard, Jennifer Bryan
A New Partitioning Around Medoids Algorithm, Mark J. Van Der Laan, Katherine S. Pollard, Jennifer Bryan
U.C. Berkeley Division of Biostatistics Working Paper Series
Kaufman & Rousseeuw (1990) proposed a clustering algorithm Partitioning Around Medoids (PAM) which maps a distance matrix into a specified number of clusters. A particularly nice property is that PAM allows clustering with respect to any specified distance metric. In addition, the medoids are robust representations of the cluster centers, which is particularly important in the common context that many elements do not belong well to any cluster. Based on our experience in clustering gene expression data, we have noticed that PAM does have problems recognizing relatively small clusters in situations where good partitions around medoids clearly exist. In this …