Power transform

Uses your system voice; voice and rate in settings.

Snapshot

≈ 9 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In statistics, a power transform is a family of functions applied to create a monotonic transformation of data using power functions. It is a data transformation technique used to stabilize variance, make the data more normal distribution-like, improve the validity of measures of association (such as the Pearson correlation between variables), and for other data stabilization procedures. Power transforms are used in multiple fields, including multi-resolution and wavelet analysis, statistical data analysis, medical research, modeling of physical processes, geochemical data analysis, epidemiology and many other clinical, environmental and social research areas.

In statistics, a power transform is a family of functions applied to create a monotonic transformation of data using power functions. It is a data transformation technique used to stabilize variance, make the data more normal distribution-like, improve the validity of measures of association (such as the Pearson correlation between variables), and for other data stabilization procedures. Power transforms are used in multiple fields, including multi-resolution and wavelet analysis, statistical data analysis, medical research, modeling of physical processes, geochemical data analysis, epidemiology and many other clinical, environmental and social research areas. ==Definition== The power transformation is defined as a continuous function of power parameter λ, typically given in piece-wise form that makes it continuous at the point of singularity (λ = 0). For data vectors (y 1 ,..., y n ) in which each y i  > 0, the power transform is y_i^{(\lambda)} = \begin{cases} \dfrac{y_i^\lambda-1}{\lambda(\operatorname{GM}(y))^{\lambda -1}} , &\text{if } \lambda \neq 0 \\[12pt] \operatorname{GM}(y)\ln{y_i} , &\text{if } \lambda = 0 \end{cases} where \operatorname{GM}(y) = \left(\prod_{i=1}^n y_i\right)^\frac{1}{n} = \sqrt[n]{y_1 y_2 \cdots y_n} \, is the geometric mean of the observations y 1 , ..., y n . The case for \lambda = 0 is the limit as \lambda approaches 0. To see this, note that y_i^\lambda = \exp({\lambda \ln(y_i)}) = 1 + \lambda \ln(y_i) + O((\lambda \ln(y_i))^2) - using Taylor series. Then \dfrac{y_i^\lambda-1}\lambda = \ln(y_i) + O(\lambda) , and everything but \ln(y_i) becomes negligible for \lambda sufficiently small. The inclusion of the (λ − 1)th power of the geometric mean in the denominator simplifies the scientific interpretation of any equation involving y_i^{(\lambda)} , because the units of measurement do not change as λ changes. Box and Cox (1964) introduced the geometric mean into this transformation by first including the Jacobian of rescaled power transformation \frac{y^\lambda-1} \lambda. with the likelihood. This Jacobian is as follows: J(\lambda; y_1, \ldots, y_n) = \prod_{i=1}^n |d y_i^{(\lambda)} / dy| = \prod_{i=1}^n y_i^{\lambda-1} & = (-n/2)(\log(2\pi\hat\sigma^2 / \operatorname{GM}(y)^{2(\lambda-1)}) + 1). \end{align} From here, absorbing \operatorname{GM}(y)^{2(\lambda-1)} into the expression for \hat\sigma^2 produces an expression that establishes that minimizing the sum of squares of residuals from y_i^{(\lambda)} is equivalent to maximizing the sum of the normal log likelihood of deviations from (y^\lambda-1)/\lambda and the log of the Jacobian of the transformation. The value at Y = 1 for any λ is 0, and the derivative with respect to Y there is 1 for any λ. Sometimes Y is a version of some other variable scaled to give Y = 1 at some sort of average value. The transformation is a power transformation, but done in such a way as to make it continuous with the parameter λ at λ = 0. It has proved popular in regression analysis, including econometrics. Box and Cox also proposed a more general form of the transformation that incorporates a shift parameter. \tau(y_i;\lambda, \alpha) = \begin{cases} \dfrac{(y_i + \alpha)^\lambda - 1}{\lambda (\operatorname{GM}(y+\alpha))^{\lambda - 1}} & \text{if } \lambda\neq 0, \\ \\ \operatorname{GM}(y+\alpha)\ln(y_i + \alpha)& \text{if } \lambda=0,\end{cases} which holds if y i  + α > 0 for all i. If τ(Y, λ, α) follows a truncated normal distribution, then Y is said to follow a Box–Cox distribution. Bickel and Doksum eliminated the need to use a truncated distribution by extending the range of the transformation to all y, as follows: \tau(y_i;\lambda, \alpha) = \begin{cases} \dfrac{\operatorname{sgn}(y_i + \alpha)|y_i + \alpha|^\lambda - 1}{\lambda (\operatorname{GM}(y+\alpha))^{\lambda - 1}} & \text{if } \lambda\neq 0, \\ \\ \operatorname{GM}(y+\alpha)\operatorname{sgn}(y+\alpha)\ln(y_i + \alpha)& \text{if } \lambda=0,\end{cases} where sgn(.) is the sign function. This change in definition has little practical import as long as \alpha is less than \operatorname{min}(y_i) , which it usually is. Bickel and Doksum also proved that the parameter estimates are consistent and asymptotically normal under appropriate regularity conditions, though the standard Cramér–Rao lower bound can substantially underestimate the variance when parameter values are small relative to the noise variance. However, this problem of underestimating the variance may not be a substantive problem in many applications. ==Box–Cox transformation== The one-parameter Box–Cox transformations are defined as y_i^{(\lambda)} = \begin{cases} \dfrac{y_i^\lambda - 1}{\lambda} & \text{if } \lambda \neq 0, \\ \ln y_i & \text{if } \lambda = 0, \end{cases} and the two-parameter Box–Cox transformations as y_i^{(\boldsymbol{\lambda})} = \begin{cases} \dfrac{(y_i + \lambda_2)^{\lambda_1} - 1}{\lambda_1} & \text{if } \lambda_1 \neq 0, \\ \ln (y_i + \lambda_2) & \text{if } \lambda_1 = 0, \end{cases} as described in the original article. Moreover, the first transformations hold for y_i > 0 , and the second for y_i > -\lambda_2 . The parameter \lambda is estimated using the profile likelihood function and using goodness-of-fit tests. ===Confidence interval=== Confidence interval for the Box–Cox transformation can be asymptotically constructed using Wilks's theorem on the profile likelihood function to find all the possible values of \lambda that fulfill the following restriction: \ln \big(L(\lambda)\big) \ge \ln \big(L(\hat\lambda)\big) - \frac{1}{2} {\chi^2}_{1,1 - \alpha}. ===Example=== The BUPA liver data set contains data on liver enzymes ALT and γGT. Suppose we are interested in using log(γGT) to predict ALT. A plot of the data appears in panel (a) of the figure. There appears to be non-constant variance, and a Box–Cox transformation might help. The log-likelihood of the power parameter appears in panel (b). The horizontal reference line is at a distance of χ 1 2 /2 from the maximum and can be used to read off an approximate 95% confidence interval for λ. It appears as though a value close to zero would be good, so we take logs. Possibly, the transformation could be improved by adding a shift parameter to the log transformation. Panel (c) of the figure shows the log-likelihood. In this case, the maximum of the likelihood is close to zero suggesting that a shift parameter is not needed. The final panel shows the transformed data with a superimposed regression line. Note that although Box–Cox transformations can make big improvements in model fit, there are some issues that the transformation cannot help with. In the current example, the data are rather heavy-tailed so that the assumption of normality is not realistic and a robust regression approach leads to a more precise model. ===Econometric application=== Economists often characterize production relationships by some variant of the Box–Cox transformation. Consider a common representation of production Q as dependent on services provided by a capital stock K and by labor hours N: \tau(Q)=\alpha \tau(K)+ (1-\alpha)\tau(N).\, Solving for Q by inverting the Box–Cox transformation we find Q=\big(\alpha K^\lambda + (1-\alpha) N^\lambda\big)^{1/\lambda},\, which is known as the constant elasticity of substitution (CES) production function. The CES production function is a homogeneous function of degree one. When λ = 1, this produces the linear production function: Q=\alpha K + (1-\alpha)N.\, When λ → 0 this produces the famous Cobb–Douglas production function: Q=K^\alpha N^{1-\alpha}.\, ===Activities and demonstrations=== The SOCR resource pages contain a number of hands-on interactive activities demonstrating the Box–Cox (power) transformation using Java applets and charts. These directly illustrate the effects of this transform on Q–Q plots, X–Y scatterplots, time-series plots and histograms. ==Yeo–Johnson transformation== The Yeo–Johnson transformation allows also for zero and negative values of y . \lambda can be any real number, where \lambda = 1 produces the identity transformation. The transformation law reads: y_i^{(\lambda)} = \begin{cases} ((y_i+1)^\lambda-1)/\lambda & \text{if }\lambda \neq 0, y \geq 0 \\[4pt] \ln(y_i + 1) & \text{if }\lambda = 0, y \geq 0 \\[4pt] -((-y_i + 1)^{(2-\lambda)} - 1) / (2 - \lambda) & \text{if }\lambda \neq 2, y ==Box-Tidwell transformation== The Box-Tidwell transformation is a statistical technique used to assess and correct non-linearity between predictor variables and the logit in a generalized linear model, particularly in logistic regression. This transformation is useful when the relationship between the independent variables and the outcome is non-linear and cannot be adequately captured by the standard model. X_i' = X_i^{\lambda} Where \lambda is the parameter estimated from the data. If Box-Tidwell Transformation is significantly different from 1, this indicates a non-linear relationship between Xi and the logit, and the transformation improves the model fit. The Box-Tidwell test is typically performed by augmenting the regression model with terms like X_i \log(X_i) and testing the significance of the coefficients. If significant, this suggests that a transformation should be applied to achieve a linear relationship between the predictor and the logit. ==Alternative names and related concepts== The power transform appears under different names in various scientific and applied contexts: Box-Cox transformation – as discussed above. Alpha-fairness – introduced in the study of network utility maximization by Frank Kelly and collaborators as the α-fair utility function family. Tsallis entropy – a generalization of Shannon entropy proposed in non-extensive statistical mechanics, which reduces to Shannon entropy as the Tsallis parameter converges to 1. Q-exponential family – a generalization of the standard exponential family that replaces the exponential function with the q-exponential form derived from Tsallis statistics. ==Notes== ==References== Box, G.E.P. and Tidwell, P.W. (1962) Transformation of Independent Variables. Technometrics, 4, 531-550. https://doi.org/10.1080/00401706.1962.10490038 (a.k.a. Box-Tidwell transformation) ==External links== (fixed link) Sanford Weisberg, Yeo-Johnson Power Transformations

Text derived from https://en.wikipedia.org/w/index.php?oldid=1349174835 under CC BY-SA 4.0; modifications have been made.