Back to search

Cal Poly

CRAB: A Novel Clustering Score using Clustering with Rivals and Buddies for Unsupervised Learning

Abstract

dc:description.abstract

Unsupervised clustering algorithms today are used across a wide variety of fields such as biology, engineering, and industry in order to classify observations into groups where labels are not provided. This can provide important latent information regarding the observations within groups, as well as insight regarding the groups themselves. In order to judge the optimal number of clusters for an unsupervised clustering algorithm, many methods exist such as the Elbow Method and Silhouette Score; however, these methods come with drawbacks and are not necessarily flexible across many unsupervised methods. We present a novel clustering score framework relying on a resampling-based approach that classifies pairs of points as either “rivals” or “buddies”, constructing a score for a given number of clusters. We then present results demonstrating the properties of this metric on various simulated and real datasets, measuring the performance of the algorithm as well.

Degree

thesis:*
Name thesis:degree_name
MS in Statistics
Discipline thesis:degree_discipline
Statistics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Choi, Allen
Contributors dc:contributor
  • Kelly Bodwin
  • Statistics
  • College of Science and Mathematics

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.calpoly.edu/theses/3283

Chain of custody

source
Harvested from
Cal Poly
Base URL
digitalcommons.calpoly.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Choi, Allen. CRAB: A Novel Clustering Score using Clustering with Rivals and Buddies for Unsupervised Learning. https://digitalcommons.calpoly.edu/theses/3283