Save this video free

UUtah Data Mining | Fall 2026 | L20: Outliers

UofU Data Science · 1:21:56 · Watch on YouTube

Part of University of Utah CS 5140/6140 Data Mining. See all 20 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Outlier detection depends on how the data’s noise is generated and on whether the model used to identify unusual points is itself distorted by them. The lecture develops a residual-based pruning loop, explains why clustered adversarial outliers can defeat simple distance thresholds in high dimensions, and presents covariance-guided pruning, breakdown point, DBSCAN, and reverse nearest neighbors as complementary approaches.

Key takeaways

Chapters

0:00 Course Roadmap: Noise, Anomaly Detection, and Graph Embeddings
4:31 Spurious Readings and Measurement Noise
11:00 Background Data That Does Not Belong to the Target Population
15:27 The Residual-Based Outlier Detection Pipeline
22:00 Three Failure Modes for Residual-Based Pruning
29:00 Conservative Iterative Pruning
36:00 Gaussian Noise and the Ambiguity of an Outlier Threshold
43:30 High-Dimensional Mean Estimation Under Gaussian Noise
50:30 Why Dimension Matters, and When Normalization Helps
53:30 Simple Mean-Based Filtering for Obvious Outliers
59:00 Clustered Adversarial Outliers Can Hide Inside the Expected Radius
1:01:30 Covariance Eigenvalues Reveal Structured Outlier Effects
1:08:20 Breakdown Point: Comparing the Mean and Median
1:13:00 Why Median-Based Robustness Does Not Solve High-Dimensional Estimation
1:15:10 DBSCAN Identifies Outliers Outside Dense Clusters
1:17:20 Reverse Nearest Neighbors Adapt to Local Density

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:16 Welcome back everyone. So, let's get started. Uh oh. Um so, today we're kind of uh transitioning into a kind of newer kind of um so section of the lecture thinking about and modeling the noise in the data and so we'll start today talking about outliers um before we get started I want to look at a couple things uh um so the schedule let's see so we we kind of finished dimensionality reduction looking um and we're looking into the noise section we'll talk about next week we'll talk about anom anomaly detection um at least a slight view into this and then so some privacy um and

1:07 then the Tuesday before Thanksgiving break we're going to start moving into graphs but I'm going to start with graph embeddings and we're going to have like a little ethics module during the class as well where we're going to kind of look at the ethics involved in bias inside of embeddings. Um, and so that's will it will it will kind of build on a bunch of the stuff that we talked about in the course that you guys now will understand. Uh, so we can dig a little bit deeper into this issue than you could in like um just one of the pure ethics courses where you may not have understood this machinery as well. Um, there will be an in-class activity on that day. This is on this is you'll see

1:56 there's a homework or some assignment on canvas. Um so it is it is definitely kind of uh it's good to be in class for that day. If there are reasons you can't be in class, I will try and provide some sort of like zoom zoom online option. It's not as essential as some of the

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, UofU Data Science.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.