Back to search

Cal Poly

Frequent Itemset Mining with tidyclust in R

Abstract

dc:description.abstract

Unsupervised learning is closely associated with clustering, however other methods fall under this umbrella such as data mining. In R, the tidyclust package provides a unified interface for clustering models, yet lacks support for data mining. This thesis addresses this gap by introducing the Apriori and ECLAT algorithms into tidyclust, with a focus on frequent itemset mining. Unlike traditional clustering models, frequent itemsets produce groupings of column variables, rather than cluster labels or partitions of observations. To address this, a novel clustering approach is proposed: items (columns) are grouped based on their ”dominant” frequent itemset. A key contribution is a new prediction method, modeled as a recommender system, to predict missing items. This implementation extends tidyclust to support column-based clustering, with applications in market basket analysis and recommender systems.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kerr, Andrew D
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/3019

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

Kerr, Andrew D. Frequent Itemset Mining with tidyclust in R. https://digitalcommons.calpoly.edu/theses/3019