L3_LDA Flashcards
Solution for Correlated Data
(Fisher’s) Linear Discriminant Analysis LDA
What measures the Correlation?
the linear relationship between X and Y
1,0 monotonic increasing
-1,0 monotonic decreasing
0,0
Goal of Linear Discriminant Analysis - View classification in terms of dimensionality reduction
Find a (normal vector of a linear decision boundary) w that showing the greatly improved class separation by Maximizes mean class difference, and Minimizes variance in each class
LDA is the optimal classifer
If data is Gaussian with equal class covariances
The goal of classification is
generalization: Correct categorization/prediction of new data
How can we estimate generalization performance?
Cross-validation
Characteristic of Cross-validation:
- Train model on part of data
- Test model on other part of data
- Repeat on different cross-validation folds
- Average performance on test set across all folds
Algorithm 1: Cross-Validation (6)
Require: Data (x1,y1)...,(xN,yN), Number of CV folds F 1.# Split data in F disjunct 2. folds for folds f = 1,...,F do 3.# Train model on folds {1,...,F} \ f 4.# Compute prediction error on fold f 5.end for 6.# Average prediction error
BCI Based on Event-Related Potentials (ERPs)
• User concentrates on a symbol
• Rows and columns are intensified
randomly
• Target rows and columns elicit specific ERPs
• BCI detects target ERPs (averaged over few repetitions)
Linear Discriminant Algorithm (4)
Computes: Normal vector w of decision hyperplane, threshold (der Entscheidungs-Hyperebene, Schwelle) β
1. Compute class mean vectors
2. Compute within-class covariance matrices SW
Compute normal vector w
3. Compute normal vector w
4. Compute threshold