Back to search

Cal Poly

Birch With Tidyclust In R

Abstract

dc:description.abstract

This thesis introduces a new implementation of the BIRCH clustering algorithm within the tidyclust framework in R. Traditional hierarchical clustering methods face scalability limitations with large datasets, due to their computational complexity. BIRCH offers a scalable alternative by summarizing data into microclusters using a CF-tree. This work shows the integration of the phases of the BIRCH algorithm into tidyclust, which enables a streamlined workflow for model specification, evaluation, and prediction. Through this implementation, scalable hierarchical clustering has been brought to R users within the tidyclust interface, enhacing the ability to better analyze large datasets.

Degree

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

Author and committee

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

Subjects

dc:subject × 3

Identifiers

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

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
related terms
citation

Perez, Jacob. Birch With Tidyclust In R. https://digitalcommons.calpoly.edu/theses/3141