{"id":{"repo_id":"calpoly","oai_identifier":"oai:digitalcommons.calpoly.edu:theses-4953"},"canonical_url":"https://search.ndltd.org/etd/calpoly/oai:digitalcommons.calpoly.edu:theses-4953","repository":{"repo_id":"calpoly","name":"Cal Poly","base_url":"https://digitalcommons.calpoly.edu/do/oai/"},"display":{"title":"CRAB: A Novel Clustering Score using Clustering with Rivals and Buddies for Unsupervised Learning","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Choi, Allen"],"institution":null,"degree_name":"MS in Statistics","degree_level":null,"degree_discipline":"Statistics","degree_department":null,"school":null,"contributors":["Kelly Bodwin","Statistics","College of Science and Mathematics"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:12:51Z","subjects":["Clustering","unsupervised clustering","machine learning","Applied Statistics","Data Science","Theory and Algorithms"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.calpoly.edu/theses/3283","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.calpoly.edu/theses/3283","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.calpoly.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.calpoly.edu%3Atheses-4953","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kelly Bodwin","Statistics","College of Science and Mathematics"]},{"key":"dc:creator","label":"Author","values":["Choi, Allen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2026-06-07T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2026-06-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Statistics"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS in Statistics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Clustering","unsupervised clustering","machine learning","Applied Statistics","Data Science","Theory and Algorithms"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.calpoly.edu/theses/3283"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["CRAB: A Novel Clustering Score using Clustering with Rivals and Buddies for Unsupervised Learning"]}]}],"canonical_facts":{"dc:contributor":["Kelly Bodwin","Statistics","College of Science and Mathematics"],"dc:creator":["Choi, Allen"],"dc:date.available":["2026-06-07T07:00:00Z"],"dc:date.created":["2026-06-01T07:00:00Z"],"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."],"dc:identifier":["https://digitalcommons.calpoly.edu/theses/3283"],"dc:subject":["Clustering","unsupervised clustering","machine learning","Applied Statistics","Data Science","Theory and Algorithms"],"dc:title":["CRAB: A Novel Clustering Score using Clustering with Rivals and Buddies for Unsupervised Learning"],"thesis:degree_discipline":["Statistics"],"thesis:degree_name":["MS in Statistics"]},"updated_at":"2026-11-19T07:12:51Z"}