Machine Learning Styles (Supervised vs Unsupervised)

Context: FIT1043_MOC Β· how Machine Learning algorithms learn Β· split by whether the data is labelled Β· supervised builds predictive models

Quick Revision

  • 🎯 Objective: classify an algorithm by its data βž” supervised (labelled β†’ predict from ) vs unsupervised (unlabelled β†’ find structure).
  • πŸ“¦ Core Components: supervised β†’ classification + regression | unsupervised β†’ clustering + association.
  • ⚑ Key Constraint: the deciding question is simply β€œis the data labelled?” β€” that alone picks the style and the task family.

πŸ“ How It Works

1. Supervised

  • Setup βž” all data labelled; learn to predict output from input by approximating the mapping well enough to predict for new .
  • Tasks βž” classification (output a category, e.g. Red/Blue fish) Β· regression (output a real value, e.g. dollars/weight).
  • Algorithms βž” linear regression (regression); random forest (both); SVM (classification).

2. Unsupervised

  • Setup βž” all data unlabelled; learn the inherent structure / distribution of the input to learn more about it.
  • Tasks βž” clustering (discover natural groupings, e.g. customers by purchasing behaviour) Β· association (rules describing large parts of the data, e.g. buy X β‡’ also buy Y).
  • Algorithms βž” k-means (clustering); Apriori (association-rule learning).

βš–οΈ Core Decision Matrix

StyleDataTasksExample algorithms
Supervisedlabelledclassification, regressionlinear regression, random forest, SVM
Unsupervisedunlabelledclustering, associationk-means, Apriori

When It Flips: supervised = "learn a mapping to a known answer"; unsupervised = "learn the structure with no answer key" β€” classification/regression need labels, clustering/association do not.

🧠 Active Recall