Directional component analysis
This article, Directional component analysis, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Inform author |
A request that this article title be changed is under discussion. Please do not move this article until the discussion is closed. |
Directional component analysis(DCA) is a statistical method used in the atmospheric sciences for extracting patterns of extremes from space-time data-sets. For instance, in a rainfall dataset, it can be used to find the spatial pattern that has both highest probability density for a given total rainfall anomaly, and, conversely, the highest total rainfall anomaly for a given probability density (subject to certain statistical assumptions about the nature of the variability of data: see below). In comparison with PCA the main differences are that PCA is a function of just the covariance matrix, and is defined so as to maximise explained variance, while DCA is a function of the covariance matrix and a vector direction, and is defined so as to maximise probability density for a given value of the total anomaly.
Example
Derivation of the First DCA Pattern
Consider a space-time data-set , containing individual spatial pattern vectors , where the individual patterns are each considered a single realisation of a multivariate normal distribution with mean zero and covariance matrix .
As a function of , the log probability density is proportional to .
Define a linear impact function of a spatial pattern as , where is a vector of spatial weights.
We seek to find the spatial pattern that maximises the probability density for a given value of the linear impact function, which is equivalent to finding the spatial pattern that maximises the log probability density for a given value of the linear impact function.
This is a constrained maximisation problem, and can be solved using the method of Lagrange multipliers.
The Lagrangian function is given by
Differentiating by and setting to zero gives the solution
Normalising so that is unit vector gives
This is the first DCA pattern.
Subsequent patterns can be derived which are orthogonal to the first, to form an orthonormal set and a method for matrix factorisation.
Extensions
The revision history of this page may contain copyright violations. Certain historical revisions of this page may meet criterion RD1 for revision deletion, as they contain significant copyright violations of https://www.mdpi.com/2073-4433/11/4/354/htm (Copyvios report) that have been removed in the meantime.
Note to admins: In case of doubt, remove this template and post a message asking for review at WT:CP. With this script, go to the history with auto-selected revisions. Note to the requestor: Make sure the page has already been reverted to a non-infringing revision or that infringing text has been removed or replaced before submitting this request. This template is reserved for obvious cases only, for other cases refer to Wikipedia:Copyright problems. Note to others: Please do not remove this template until an administrator has reviewed it. |