DATA 155 Survey to Data Science - Module 6: Machine Learning Techniques

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

1/29

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards covering supervised, unsupervised, and semi-supervised learning setups, classification metrics, algorithms, support vector machines, clustering methods, dimensionality reduction, and neural network fundamentals.

30 Terms

1
New cards

Generalization

Useful performance of a machine learning model on new, unseen data.

2
New cards

Supervised Learning

A learning setup where a model learns from labeled data (e.g., emails labeled spam or not spam) with the goal of predicting a label for new instances.

3
New cards

Unsupervised Learning

A learning setup where an algorithm works on data with no target labels (e.g., raw email text) to discover patterns, groups of similar topics, or anomalies.

4
New cards

Semi-Supervised Learning

A learning setup that leverages both a small set of labeled data and a large set of unlabeled data (e.g., 100100 labeled and 10,00010{,}000 unlabeled emails) to learn a classifier.

5
New cards

Regression

A task where features supply inputs to predict a continuous numeric target (e.g., predicting a house sale price of $240,000\text{\$}240{,}000).

6
New cards

Classification

A task where features supply inputs to predict a discrete categorical target label (e.g., price bands such as low, medium, or high).

7
New cards

Binary Classification

A classification task that predicts an outcome between exactly two classes (e.g., spam or not spam, benign or malignant).

8
New cards

Multiclass Classification

A classification problem where the categorical target has more than two possible classes.

9
New cards

Precision

An evaluation metric that measures the accuracy of positive flags, calculated as the ratio of true positive flags to total flags raised (e.g., 810=80%\frac{8}{10} = 80\%).

10
New cards

Recall

An evaluation metric that measures how much of the target class is caught, calculated as the ratio of true positives caught to total actual positives (e.g., 820=40%\frac{8}{20} = 40\%).

11
New cards

Decision Tree

A classification method that follows a sequence of learned feature questions down branches to arrive at a predicted label.

12
New cards

K-Nearest Neighbors (KNN)

A classification method that classifies a new example by evaluating nearby labeled examples and taking a majority vote among the KK nearest neighbors.

13
New cards

Logistic Regression

A classification algorithm that estimates the probability of class membership and applies a decision threshold (e.g., 0.500.50) to make a prediction.

14
New cards

Hyperplane

The decision boundary learned by a Support Vector Machine, represented as a line in 2D space or a flat plane in 3D space.

15
New cards

Margin (SVM)

The space or distance surrounding the decision boundary line or hyperplane in a Support Vector Machine.

16
New cards

Support Vectors

The critical training data points closest to the boundary that determine the position and margin of the Support Vector Machine.

17
New cards

Feature Scaling

The data preparation process of transforming numeric attributes onto comparable numeric scales (e.g., adjusting word counts in thousands and link fractions between 00 and 11).

18
New cards

Kernel (SVM)

A function that provides boundary flexibility by projecting data into higher dimensions (e.g., an RBF kernel separating ring-shaped patterns).

19
New cards

SVM Parameter CC

A regularization hyperparameter in Support Vector Machines that controls the penalty for margin violations; larger values penalize margin violations more heavily.

20
New cards

RBF Gamma

A hyperparameter for the Radial Basis Function kernel that determines the radius of influence of each training point, where larger values result in more localized influence.

21
New cards

K-Means Clustering

An unsupervised clustering algorithm where the user specifies KK centroids and points are grouped by proximity, best suited for compact, round clusters.

22
New cards

Hierarchical Clustering

An unsupervised clustering algorithm that builds nested groups within a tree structure, allowing inspection at both broad and fine granularities.

23
New cards

DBSCAN

A density-based clustering algorithm that connects dense neighborhoods of data points to find curved, irregular groups and separate noise points.

24
New cards

Principal Component Analysis (PCA)

A linear dimensionality reduction method that extracts linear components ranked by the amount of variation they capture, used for compression and noise reduction.

25
New cards

t-SNE

A nonlinear dimensionality reduction method that maps local similarities into 2D or 3D representations, primarily used for data exploration and visual inspection.

26
New cards

Forward Pass

The initial phase in neural network training where input features are passed through layers of neurons, weights, and biases to generate an output prediction.

27
New cards

Loss

A metric calculated during neural network training that quantifies the degree of disagreement or error between a model's prediction and the true target.

28
New cards

Backpropagation

The training step in neural networks that computes the mathematical gradients of the loss function with respect to each weight and bias.

29
New cards

Optimizer

The algorithm in neural network training that uses computed gradients to update and tune weights and biases to reduce loss.

30
New cards

Epoch

One complete pass of all training examples through the neural network during training.