Support Vector Machines (Part 1) and Classification Evaluation

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

1/19

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering the core concepts of Support Vector Machines (SVM), hyperplanes, margins, the C parameter, feature scaling pipelines, and classification evaluation metrics.

20 Terms

1
New cards

Regression

A supervised learning task that predicts a continuous numeric target value (such as temperature or power demand) based on input features.

2
New cards

Classification

A supervised learning task that predicts a categorical class label (such as normal versus faulty) for an observation based on input features.

3
New cards

Hyperplane

A flat decision boundary in feature space that separates different classes, appearing as a line in two dimensions and as a higher-dimensional flat subspace when more features are present.

4
New cards
<p>Support Vectors</p>

Support Vectors

The critical training observations that lie closest to the decision boundary (touching or entering the margin) and solely determine the position and orientation of the fitted boundary.

5
New cards

Maximum Margin

The criterion by which SVM chooses a decision boundary that remains as far as possible from the nearest training observations of both classes to ensure geometric robustness.

6
New cards

Hard Margin

An SVM optimization formulation that strictly forbids any misclassifications or margin violations, requiring all training points to satisfy yi(wTxi+b)≥1y_i(\mathbf{w}^T \mathbf{x}_i + b) \ge 1.

7
New cards

Soft Margin

An SVM formulation that incorporates non-negative slack variables (ξi\xi_i) into the objective function to permit and control margin violations when data contains noise or overlap.

8
New cards

Slack Variable (ξi\xi_i)

A penalty variable in soft-margin SVM optimization that quantifies the degree by which a specific training observation violates the margin or crosses the decision boundary.

9
New cards

Regularization Parameter CC

A hyperparameter in soft-margin SVM that balances margin width against violation penalties: a small CC tolerates more violations to produce a wider margin, while a large CC penalizes violations heavily to fit the training data closely.

<p>A hyperparameter in soft-margin SVM that balances margin width against violation penalties: a small $$C$$ tolerates more violations to produce a wider margin, while a large $$C$$ penalizes violations heavily to fit the training data closely.</p>
10
New cards

StandardScaler

A preprocessing technique that standardizes continuous features to zero mean and unit variance, preventing large-magnitude measurement units from dominating distance-based SVM optimization.

11
New cards

Data Leakage

An evaluation error that occurs when information from validation or test data inadvertently influences training, avoided in SVM by fitting preprocessing scalers strictly within cross-validation folds.

12
New cards

LinearSVC

A scikit-learn linear SVM implementation based on liblinear that scales efficiently for large dense or sparse datasets but does not explicitly store support vectors.

13
New cards

One-Class SVM

An unsupervised or semi-supervised SVM variant used in fault detection to learn boundaries around normal machine operational data and flag anomalous deviations.

14
New cards

Confusion Matrix

A layout table used to evaluate classification performance where rows represent actual classes and columns represent predicted classes, partitioning results into TP, FP, FN, and TN.

<p>A layout table used to evaluate classification performance where rows represent actual classes and columns represent predicted classes, partitioning results into TP, FP, FN, and TN.</p>
15
New cards

Precision

The fraction of positive predictions that are truly correct, calculated across the predicted positive column as TPTP+FP\frac{\text{TP}}{\text{TP} + \text{FP}}.

16
New cards

Recall

The fraction of actual positive instances successfully detected by the model, calculated across the actual positive row as TPTP+FN\frac{\text{TP}}{\text{TP} + \text{FN}}.

17
New cards

F1F_1 Score

The harmonic mean of precision and recall calculated as 2×Precision×RecallPrecision+Recall2 \times \frac{\text{Precision} \times \text{Recall}}{\text{Precision} + \text{Recall}}, providing a single balance metric that ignores true negatives.

18
New cards

ROC Curve

A graphical plot representing classification ranking performance by plotting the true-positive rate (recall) against the false-positive rate across varying decision thresholds.

19
New cards

AUC (Area Under the Curve)

A scalar summary metric indicating the area under an ROC curve across all thresholds, where 1.01.0 indicates perfect class ranking and 0.50.5 represents random chance.

20
New cards

Classification Threshold

The cutoff value applied to continuous model prediction scores to assign binary class labels; lowering the threshold increases recall while generally decreasing precision.