Decomposable Principal Component Analysis

08/18/2008
by   Ami Wiesel, et al.
0

We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. For this purpose, we reformulate the problem in the sparse inverse covariance (concentration) domain and solve the global eigenvalue problem using a sequence of local eigenvalue problems in each of the cliques of the decomposable graph. We demonstrate the application of our methodology in the context of decentralized anomaly detection in the Abilene backbone network. Based on the topology of the network, we propose an approximate statistical graphical model and distribute the computation of PCA.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2019

Eigenvalue and Generalized Eigenvalue Problems: Tutorial

This paper is a tutorial for eigenvalue and generalized eigenvalue probl...
research
08/28/2018

Convergence of Krasulina Scheme

Principal component analysis (PCA) is one of the most commonly used stat...
research
07/28/2023

Stratified Principal Component Analysis

This paper investigates a general family of models that stratifies the s...
research
06/08/2015

Stay on path: PCA along graph paths

We introduce a variant of (sparse) PCA in which the set of feasible supp...
research
04/28/2022

Derivation of Learning Rules for Coupled Principal Component Analysis in a Lagrange-Newton Framework

We describe a Lagrange-Newton framework for the derivation of learning r...
research
09/08/2019

Shapley Values of Reconstruction Errors of PCA for Explaining Anomaly Detection

We present a method to compute the Shapley values of reconstruction erro...
research
07/25/2023

Do algorithms and barriers for sparse principal component analysis extend to other structured settings?

We study a principal component analysis problem under the spiked Wishart...

Please sign up or login with your details

Forgot password? Click here to reset