University of British Columbia
GO_Clustering.jl : a unified unified framework for globally optimal clustering
Abstract
dc:descriptionThis thesis studies globally optimal solution methods for three classical centroid-based clustering problems: K-means, K-centers, and K-medoids. The work has two closely related objectives. First, it presents a unified mathematical treatment of these models, including mixed-integer formulations and a common branch-and-bound viewpoint that clarifies the roles of lower bounds, upper bounds, domain reduction, and branching. Second, it implements this viewpoint in a Julia package, GO_Clustering.jl, that brings together exact and gap-certifying methods from the literature within a consistent computational framework. The package provides common data structures, solver interfaces, MPI-based parallel execution, structured logging, and experiment drivers, so that one software environment can be used to solve and compare K-means, K-centers, and K-medoids under a unified workflow. By integrating these methods into a single package, the thesis supports systematic computational study and makes it easier to report certified lower and upper bounds and global optimality certificates. Overall, the thesis provides a reproducible software foundation for research on globally optimal centroid-based clustering.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Mathematics
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2026
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Wang, Yu
- Contributors dc:contributor
-
- Cao, Yankai
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/94162