Module 3: Clustering & Anomalies

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/13

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering unsupervised learning, k-means clustering mechanics, data transformation, model diagnostics, dimensionality reduction via PCA, and anomaly detection.

14 Terms

1
New cards

Supervised Learning

An analytical approach where a model learns from historical training data containing a known answer column (target labels) and is evaluated using an accuracy score.

2
New cards

Unsupervised Learning

An analytical approach operating on data with no answer column or target labels, designed to discover inherent structure by determining which rows resemble other rows.

3
New cards

kk-means Clustering

An algorithm that groups data points into kk clusters by dropping kk markers at random, assigning each observation to the nearest marker, moving each marker to the centroid of its assigned points, and repeating until convergence.

4
New cards

kk

The user-specified input parameter defining the number of clusters to form in kk-means; it is supplied by the analyst rather than determined automatically by the algorithm.

5
New cards

Standardization

The preparation technique of converting each feature column into standard deviations from its own mean so that attributes measured on different scales have equal influence in distance calculations.

6
New cards

Log Transformation

Converting skewed numerical data (such as monetary spend) to a logarithmic scale so the column measures order of magnitude, preventing single massive outliers from claiming an entire cluster marker.

7
New cards

Elbow Method

A heuristic tool for selecting kk that plots cluster tightness against the number of clusters to identify the bend where incremental improvements in tightness slow down.

8
New cards

Silhouette Score

A geometric metric ranging from −1-1 to 11 that measures how much closer an observation is to its own cluster compared to the next nearest cluster, where values above 0.50.5 indicate reasonable structure.

9
New cards

Coverage

The proportion of genuinely problematic or irregular entities in a population that a selected partition successfully places before an audit or review team.

10
New cards

Wasted Effort

The proportion of reviewed entities that turn out to be completely fine, expending audit capacity and poking supplier relationships without finding issues.

11
New cards

Principal Component Analysis (PCA)

A mathematical dimensionality reduction method that finds orthogonal directions of maximum variance to flatten high-dimensional data onto a two-dimensional map.

12
New cards

Centroid

The geometric center point of a cluster in kk-means, calculated as the mathematical average across all feature dimensions of every observation assigned to that cluster.

13
New cards

Anomaly

An observation that sits unusually far from its assigned cluster centroid because its specific combination of attributes across multiple dimensions does not fit any standard profile.

14
New cards

Random Restarts

The procedure of running the kk-means algorithm multiple times from different initial random marker positions and selecting the tightest overall result to avoid settling into suboptimal local arrangements.