pca by projection pursuit
play

PCA by Projection Pursuit Department of Statistics and Probability - PowerPoint PPT Presentation

Joint work with . . . P. Filzmoser PCA by Projection Pursuit Department of Statistics and Probability Theory Vienna University of Technology, Austria The Package pcaPP C. Croux Heinrich Fritz Department of Applied Economics Vienna University


  1. Joint work with . . . P. Filzmoser PCA by Projection Pursuit Department of Statistics and Probability Theory Vienna University of Technology, Austria The Package pcaPP C. Croux Heinrich Fritz Department of Applied Economics Vienna University of Technology, Austria K.U. Leuven, Belgium Vienna, Austria M.R. Oliveira June, 2006 Department of Mathematics Instituto Superior T´ ecnico, Lisbon, Portugal K. Kalcher Vienna University of Technology Vienna University of Technology, Austria Agenda Principal Component Analysis (PCA) 4 • Principal components 3 • Robust approaches y 2 • The implementation 1 • Supporting methods • Covariance estimation by PCAs 0 0 1 2 3 4 x

  2. Principal Component Analysis (PCA) Principal Component Analysis (PCA) 4 4 PC1 3 3 y 2 y 2 PC2 1 1 0 0 0 1 2 3 4 0 1 2 3 4 x x Outliers Outliers 4 4 PC2 3 3 y 2 y 2 1 1 PC1 0 0 0 1 2 3 4 0 1 2 3 4 x x

  3. Outliers The Classical Approach 4 PC2 • PCA by decomposition of the covariance matrix PC1 3 Σ = ΓΛΓ t ˆ x t � � Y = X − 1¯ Γ y 2 • Robustness due to robust covariance estimates. PC2 1 PC1 – package rrcov : covMCD , covMest – package robustbase : covGK , covOGK 0 0 1 2 3 4 x PCA by Projection Pursuit Defining the Data Center 4 • No covariance estimation necessary 3 • Especially for high dimensional data • Procedure y 2 – Define a data center ( mean , median , l1median , . . . ) 1 – Search for promising directions by maximizing a spread estimation ( sd , mad , qn ) of the data projected onto these directions 0 – Reduce the amount of candidate directions 0 1 2 3 4 x

  4. Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.62 s = 0.62 0 0 MAD = 0.54 MAD = 0.46 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.63 s = 0.63 0 0 MAD = 0.4 MAD = 0.32 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x

  5. Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.64 s = 0.65 0 0 MAD = 0.26 MAD = 0.25 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.65 s = 0.66 0 0 MAD = 0.3 MAD = 0.35 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x

  6. Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.66 s = 0.67 0 0 MAD = 0.43 MAD = 0.52 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.67 s = 0.66 0 0 MAD = 0.63 MAD = 0.67 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x

  7. Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.66 s = 0.65 0 0 MAD = 0.7 MAD = 0.69 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.65 s = 0.64 0 0 MAD = 0.67 MAD = 0.61 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x

  8. Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.63 s = 0.63 0 0 MAD = 0.64 MAD = 0.63 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x Maximizing Spread Maximizing Spread 5 5 4 4 3 3 y y 2 2 1 1 s = 0.62 s = 0.62 0 0 MAD = 0.66 MAD = 0.59 −1 −1 −1 0 1 2 3 4 5 −1 0 1 2 3 4 5 x x

  9. Maximizing Spread PCAproj 4 5 4 3 3 y y 2 2 1 1 s = 0.62 0 MAD = 0.54 −1 0 −1 0 1 2 3 4 5 0 1 2 3 4 x x PCAproj PCAproj 4 4 3 3 y 2 y 2 1 1 0 0 0 1 2 3 4 0 1 2 3 4 x x

  10. PCAproj PCAproj 4 Candidate Directions: 4 • each data point 3 3 • additionally random di- rections through center • additional directions by y 2 y 2 linear combinations of data points 1 • update algorithm (based 1 on eigenvalues) 0 0 1 2 3 4 0 x 0 1 2 3 4 x PCAgrid Implementation Grid Algorithm: 4 • Implementation in C Optimization is done on a 3 regular grid in the plane. • Wrapping functions 2 • select two variables y – PCAproj (x, k = 2, method = c("sd", "mad", "qn"), CalcMethod • optimization on the grid = c("eachobs", "lincomb", "sphere"), nmax = 1000, update = • select other variables 1 TRUE, scores = TRUE, maxit = 5, maxhalf = 5, control, ...) • . . . – PCAgrid (x, k = 2, method = c("sd", "mad", "qn"), maxiter = 0 10, splitcircle = 10, scores = TRUE, anglehalving = TRUE, 0 1 2 3 4 fact2dim = 10, control, ...) x

  11. Common Parameters PCAproj - Individual Parameters • x : Data matrix (data frame) • CalcMethod : "eachobs" , "lincomb" or "sphere" • k : Number of principal components • nmax : Max directions to search in each step (for "lincomb" or "sphere" ) • method : Spread estimator for projection pursuit • update : Perform update steps? • scores : Return scores-matrix? – maxhalf : Maximum number of steps for angle halving – maxit : Maximum number of iterations • control : Control-structure • ... Passed to ScaleAdv PCAgrid - Individual Parameters Return Structure • (S3) class pcaPP derived from princomp : • splitcircle : Number of directions – sdev : Spread of principal components • anglehalving : Perform anglehalving – loadings : Matrix containing the loadings – center : Center applied to the data matrix • fact2dim : Behavior in 2 dimensional case. – scale : Scale applied to the data matrix • maxiter : Maximum number of iterations. – n.obs : Number of observations – scores : Matrix containing the scores – call : Function call

  12. Additional Functions Robust Covariance Estimation • Robust covariance estimation based on PCs • l1median(X, MaxStep = 200, ItTol = 10 − 8 ) Robust center estimator Σ = ˆ ˆ Γˆ Λˆ Γ t • qn(x) • covPCAproj(x, control) Robust scale estimator • covPCAgrid(x, control) • ScaleAdv(x, center = mean, scale = sd) Advanced scaling method (takes functions or vectors as input values) • covPC (x, k, method) (under construction . . . ) Example Example screeplot(result) > library(pcaPP) Scree−plot > data(swiss) > result = PCAproj(swiss, k = 6, method = "mad") 1500 > summary(result) Importance of components: Variances Comp.1 Comp.2 Comp.3 Comp.4 Comp.5 1000 Standard deviation 44.1005199 41.0302723 17.09114152 6.92022550 4.619893062 Proportion of Variance 0.4859749 0.4206639 0.07299087 0.01196649 0.005333229 Cumulative Proportion 0.4859749 0.9066387 0.97962962 0.99159611 0.996929342 500 Comp.6 Standard deviation 3.505520822 Proportion of Variance 0.003070658 Cumulative Proportion 1.000000000 0 Comp.1 Comp.2 Comp.3 Comp.4 Comp.5 Comp.6

  13. Example Covariance Estimation biplot(result) Biplot −200 −100 0 100 200 300 Herens Sierre Conthey Entremont 300 Martigwy St Maurice Glane > library (covrob) 0.2 Monthey Veveyse Broye Sion > covswiss.mad <- covrob (swiss, method="covPCAproj", control = list Gruyere Agriculture 200 Franches−Mnt (k=6,method="mad")) Sarine Delemont Catholic 0.1 Porrentruy > covswiss.sd <- covrob (swiss, method="covPCAproj", control = list 100 Echallens Comp.2 Fertility (k=6,method="sd")) Oron Paysd’enhaut Lavaux Aubonne Infant.Mortality Cossonay Moutier Rive Droite Payerne > plot (covswiss.mad, covswiss.sd) 0.0 Aigle Rolle Avenches 0 Morges Moudon Nyone Yverdon Orbe Rive Gauche Education Neuveville Val de Ruz Examination −100 Boudry Grandson Vevey −0.1 Courtelary Le Locle ValdeTravers Neuchatel Lausanne −200 La Chauxdfnd La Vallee V. De Geneve −0.2 −0.2 −0.1 0.0 0.1 0.2 Comp.1 Covariance Estimation Infant.Mortality Examination Agriculture Education Catholic Fertility Fertility 56.08 Agriculture 410.6773 −62.8119 −120.8495 Examination −233.6847 −467.9115 −78.4054 −130.6045 65.9795 Education −140.1594 −318.3069 144.4185 230.4597 255.309 −210.4271 −106.3998 Catholic −166.5624 −20.9876 2.7944 31.8595 11.9388 6.665 −3.9372 −5.1075 11.3704 Infant.Mortality 195.156 127.608 −80.5001 −49.1052 −226.1518 Robust cov − estimation based on PCs (projection mode − sd) Robust cov − estimation based on PCs (projection mode − mad)

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend