6
Analysis of Variance (ANOVA) From ANOVA If the independent variables are continuous and the dependant variable is also continuous then we will perform a multiple regression. Now, if the independent variables are discrete and the dependant variable is still continuous we will performed an ANOVA To GLMwhere, where,  = grand mean,  = treatment effect, e = error

8
Analysis of Variance (ANOVA) Using the GLM approach through a coding matrix Logic: If, for example, there are 3 groups and we know that the participant number 12 is not part of the first nor the second group, then we know that this participant is necessary part of group 3.

9
Analysis of Variance (ANOVA) Performing ANOVA using GLM through a coding matrix Logic: In other words, there is only 2 degrees of freedom in group assignation. Therefore, the third group column will be eliminated. A value of 1 will be assigned to the participants of group i and a value of 0 for the other groups. Whereas, the last group will receive a value of -1 for all the group (balance things).

10
Analysis of Variance (ANOVA) Then, for each subject we associate its corresponding group coding. = independent variables (X)

13
ANOVA Table The hypothesis is that the R-Square between the predictors and the criterion is null. Since F(3,32)=5.86938, p<0.05, we reject H 0 and we accept H 1. There is at least one group that is different from the others.

21
PCA Eigenvalues and eigenvectors Let’s define a random vector as v(0) = [1, 1] T. Now, if we compute the inner product between the correlation matrix (M) and V(0) an re-multiply the result by M, again, again, and again, what the results will be after k iterations?

22
PCA Eigenvalues and eigenvectors Let’s define a random vector as v(0) = [1, 1] T. Now, if we compute the inner product between the correlation matrix (M) and V(0) an re-multiply the result by M, again, again, and again, what the results will be after k iterations?

24
PCA Eigenvalues and eigenvectors Once the first eigenvector (and associated eigenvalue) has been identified, we remove it from the matrix. And we repeat the process until all the eigenvectors and eigenvalues have been extracted.

25
PCA Eigenvalues and eigenvectors There will be as many eigenvectors/eigenvalues as there are variables. Each eigenvector will be orthogonal to the others. M = PCA

26
PCA Eigenvalues and eigenvectors There will be as many eigenvectors/eigenvalues as there are variables. Each eigenvector will be orthogonal to the others. 11 22 33 44

27
PCA Eigenvalues and eigenvectors How many are important? Plot the eigenvalues, 1- If the points on the graph tend to level out (show an "elbow"), these eigenvalues are usually close enough to zero that they can be ignored. 2- Limit variance accounted for, (e.g. 90%) Method 1 Method 2

29
PCA VARIMAX Rotation Why ? To improve the readability The VARIMAX rotation aims at finding a solution where an original variable loads highly on one particular factor and loads as low as possible on other factors.  Rotation matrix

30
PCA VARIMAX Rotation The algorithm maximizes the VARIMAX index, V, the sum of the variances of the component-loading matrix. (X-X) 2 V will be a long equation that contains the  variable. An optimization technique is then used to find the value  that maximize V.