The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
This vignette illustrates the standard use of the PLNPCA
function and the methods accompanying the R6 Classes
PLNPCAfamily
and PLNPCAfit
.
The packages required for the analysis are PLNmodels plus some others for data manipulation and representation:
The main function PLNPCA
integrates some features of the
future package to perform parallel computing: you can
set your plan now to speed the fit by relying on 2 workers as
follows:
We illustrate our point with the trichoptera data set, a full description of which can be found in the corresponding vignette. Data preparation is also detailed in the specific vignette.
The trichoptera
data frame stores a matrix of counts
(trichoptera$Abundance
), a matrix of offsets
(trichoptera$Offset
) and some vectors of covariates
(trichoptera$Wind
, trichoptera$Temperature
,
etc.)
In the vein of Tipping and Bishop (1999), we introduce in Chiquet, Mariadassou, and Robin (2018) a probabilistic PCA model for multivariate count data which is a variant of the Poisson Lognormal model of Aitchison and Ho (1989) (see the PLN vignette as a reminder). Indeed, it can be viewed as a PLN model with an additional rank constraint on the covariance matrix \(\boldsymbol\Sigma\) such that \(\mathrm{rank}(\boldsymbol\Sigma)= q\).
This PLN-PCA model can be written in a hierarchical framework where a sample of \(p\)-dimensional observation vectors \(\mathbf{Y}_i\) is related to some \(q\)-dimensional vectors of latent variables \(\mathbf{W}_i\) as follows: \[\begin{equation} \begin{array}{rcl} \text{latent space } & \mathbf{W}_i \quad \text{i.i.d.} & \mathbf{W}_i \sim \mathcal{N}(\mathbf{0}_q, \mathbf{I}_q) \\ \text{parameter space } & \mathbf{Z}_i = {\boldsymbol\mu} + \mathbf{C}^\top \mathbf{W}_i & \\ \text{observation space } & Y_{ij} | Z_{ij} \quad \text{indep.} & Y_{ij} | Z_{ij} \sim \mathcal{P}\left(\exp\{Z_{ij}\}\right) \end{array} \end{equation}\]
The parameter \({\boldsymbol\mu}\in\mathbb{R}^p\) corresponds to the main effects, the \(p\times q\) matrix \(\mathbf{C}\) to the loadings in the parameter spaces and \(\mathbf{W}_i\) to the scores of the \(i\)-th observation in the low-dimensional latent subspace of the parameter space. The dimension of the latent space \(q\) corresponds to the number of axes in the PCA or, in other words, to the rank of \(\mathbf{C}\mathbf{C}^\intercal\). An hopefully more intuitive way of writing this model is the following: \[\begin{equation} \begin{array}{rcl} \text{latent space } & \mathbf{Z}_i \sim \mathcal{N}({\boldsymbol\mu},\boldsymbol\Sigma), \qquad \boldsymbol\Sigma = \mathbf{C}\mathbf{C}^\top \\ \text{observation space } & Y_{ij} | Z_{ij} \quad \text{indep.} & Y_{ij} | Z_{ij} \sim \mathcal{P}\left(\exp\{Z_{ij}\}\right), \end{array} \end{equation}\] where the interpretation of PLN-PCA as a rank-constrained PLN model is more obvious.
Just like PLN, PLN-PCA generalizes to a formulation close to a multivariate generalized linear model where the main effect is due to a linear combination of \(d\) covariates \(\mathbf{x}_i\) and to a vector \(\mathbf{o}_i\) of \(p\) offsets in sample \(i\). The latent layer then reads \[\begin{equation} \mathbf{Z}_i \sim \mathcal{N}({\mathbf{o}_i + \mathbf{x}_i^\top\mathbf{B}},\boldsymbol\Sigma), \qquad \boldsymbol\Sigma = \mathbf{C}\mathbf{C}^\top, \end{equation}\] where \(\mathbf{B}\) is a \(d\times p\) matrix of regression parameters.
Dimension reduction and visualization is the main objective in (PLN)-PCA. To reach this goal, we need to first estimate the model parameters. Inference in PLN-PCA focuses on the regression parameters \(\mathbf{B}\) and on the covariance matrix \(\boldsymbol\Sigma\). Technically speaking, we adopt a variational strategy to approximate the log-likelihood function and optimize the consecutive variational surrogate of the log-likelihood with a gradient-ascent-based approach. To this end, we rely on the CCSA algorithm of Svanberg (2002) implemented in the C++ library (Johnson 2011), which we link to the package. Technical details can be found in Chiquet, Mariadassou, and Robin (2018).
In the package, the PLNPCA model is adjusted with the function
PLNPCA
, which we review in this section. This function
adjusts the model for a series of value of \(q\) and provides a collection of objects
PLNPCAfit
stored in an object with class
PLNPCAfamily
.
The class PLNPCAfit
inherits from the class
PLNfit
, so we strongly recommend the reader to be
comfortable with PLN
and PLNfit
before using
PLNPCA
(see the PLN vignette).
We fit a collection of \(q\) models as follows:
##
## Initialization...
##
## Adjusting 4 PLN models for PCA analysis.
## Rank approximation = 1
Rank approximation = 4
Rank approximation = 3
Rank approximation = 2
## Post-treatments
## DONE!
Note the use of the formula
object to specify the model,
similar to the one used in the function PLN
.
PLNPCAfamily
The PCA_models
variable is an R6
object
with class PLNPCAfamily
, which comes with a couple of
methods. The most basic is the show/print
method, which
sends a brief summary of the estimation process:
## --------------------------------------------------------
## COLLECTION OF 4 POISSON LOGNORMAL MODELS
## --------------------------------------------------------
## Task: Principal Component Analysis
## ========================================================
## - Ranks considered: from 1 to 4
## - Best model (greater BIC): rank = 4
## - Best model (greater ICL): rank = 3
One can also easily access the successive values of the criteria in the collection
param | nb_param | loglik | BIC | ICL |
---|---|---|---|---|
1 | 34 | -1042.0194 | -1108.1803 | -1120.6693 |
2 | 50 | -730.4119 | -827.7074 | -860.0172 |
3 | 65 | -637.7068 | -764.1910 | -823.5549 |
4 | 79 | -600.4474 | -754.1743 | -840.4781 |
A quick diagnostic of the optimization process is available via the
convergence
field:
param | nb_param | status | backend | iterations | |
---|---|---|---|---|---|
out | 1 | 34 | 3 | nlopt | 637 |
elt | 2 | 50 | 3 | nlopt | 888 |
elt.1 | 3 | 65 | 3 | nlopt | 1776 |
elt.2 | 4 | 79 | 3 | nlopt | 2209 |
Comprehensive information about PLNPCAfamily
is
available via ?PLNPCAfamily
.
The plot
method of PLNPCAfamily
displays
evolution of the criteria mentioned above, and is a good starting point
for model selection:
Note that we use the original definition of the BIC/ICL criterion
(\(\texttt{loglik} -
\frac{1}{2}\texttt{pen}\)), which is on the same scale as the
log-likelihood. A popular
alternative consists in using \(-2\texttt{loglik} + \texttt{pen}\) instead.
You can do so by specifying reverse = TRUE
:
In this case, the variational lower bound of the log-likelihood is
hopefully strictly increasing (or rather decreasing if using
reverse = TRUE
) with the number of axes (or subspace
dimension). Also note the (approximated) \(R^2\) which is displayed for each value of
\(q\) (see (Chiquet, Mariadassou, and Robin 2018) for
details on its computation).
From this plot, we can see that the best model in terms of BIC or ICL
is obtained for a rank \(q=4\) or \(q=3\). We may extract the corresponding
model with the method getBestModel("ICL")
. A model with a
specific rank can be extracted with the getModel()
method:
PLNPCAfit
Objects myPCA_ICL
and myPCA_BIC
are
R6Class
objects of class PLNPCAfit
which in
turns own a couple of methods, some inherited from PLNfit
and some others specific, mostly for visualization purposes. The
plot
method provides individual maps and correlation
circles as in usual PCA. If an additional classification exists for the
observations – which is the case here with the available classification
of the trapping nights – , it can be passed as an argument to the
function.1
Among other fields and methods (see ?PLNPCAfit
for a
comprehensive view), the most interesting for the end-user in the
context of PCA are
Che | Hyc | Hym | Hys | Psy | Aga | Glo | Ath | Cea | Ced | Set | All | Han | Hfo | Hsp | Hve | Sta | |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
(Intercept) | -7.477938 | -8.155196 | -3.024737 | -6.951128 | -0.5291654 | -3.801335 | -6.473411 | -5.843781 | -7.351607 | -3.536337 | -4.188803 | -4.957483 | -4.329473 | -6.016332 | -4.010422 | -7.219023 | -2.586614 |
PC1 | PC2 | PC3 | |
---|---|---|---|
Che | -0.2231321 | 0.3110463 | -0.0093206 |
Hyc | -0.4214850 | -0.2641016 | 0.2052376 |
Hym | -0.1287011 | 0.1467647 | 0.3027083 |
Hys | -0.4324644 | 0.3570255 | 0.3076425 |
Psy | 0.0470472 | 0.0221703 | -0.0695115 |
Aga | 0.0515875 | 0.2722061 | 0.2097285 |
PC1 | PC2 | PC3 |
---|---|---|
-1.720737 | -0.6013759 | 0.7615114 |
3.364219 | 0.9189416 | 2.0972647 |
7.371906 | -1.1048745 | 0.4357619 |
6.467576 | -1.1580873 | -1.8281372 |
4.643847 | 0.1494355 | -1.0721778 |
3.856800 | 0.8941048 | 0.4476054 |
PLNPCAfit
also inherits from the methods of
PLNfit
(see the appropriate
vignette). Most are recalled via the show method:
## Poisson Lognormal with rank constrained for PCA (rank = 3)
## ==================================================================
## nb_param loglik BIC ICL
## 65 -637.707 -764.191 -823.555
## ==================================================================
## * Useful fields
## $model_par, $latent, $latent_pos, $var_par, $optim_par
## $loglik, $BIC, $ICL, $loglik_vec, $nb_param, $criteria
## * Useful S3 methods
## print(), coef(), sigma(), vcov(), fitted()
## predict(), predict_cond(), standard_error()
## * Additional fields for PCA
## $percent_var, $corr_circle, $scores, $rotation, $eig, $var, $ind
## * Additional S3 methods for PCA
## plot.PLNPCAfit()
We provide simple plotting functions but a wealth of plotting
utilities are available for factorial analyses results. The following
bindings allow you to use widely popular tools to make your own plots:
$eig
, $var
and $ind
.
## List of 4
## $ coord : num [1:49, 1:3] -1.72 3.36 7.37 6.47 4.64 ...
## ..- attr(*, "dimnames")=List of 2
## .. ..$ : chr [1:49] "1" "2" "3" "4" ...
## .. ..$ : chr [1:3] "Dim.1" "Dim.2" "Dim.3"
## $ cos2 : num [1:49, 1:3] 0.759 0.683 0.975 0.899 0.948 ...
## ..- attr(*, "dimnames")=List of 2
## .. ..$ : chr [1:49] "1" "2" "3" "4" ...
## .. ..$ : chr [1:3] "Dim.1" "Dim.2" "Dim.3"
## $ contrib: num [1:49, 1:3] 0.6 2.29 11.02 8.48 4.37 ...
## ..- attr(*, "dimnames")=List of 2
## .. ..$ : chr [1:49] "1" "2" "3" "4" ...
## .. ..$ : chr [1:3] "Dim.1" "Dim.2" "Dim.3"
## $ dist : Named num [1:49] 1.98 4.07 7.47 6.82 4.77 ...
## ..- attr(*, "names")= chr [1:49] "1" "2" "3" "4" ...
## Dim.1 Dim.2 Dim.3
## 1 -1.720737 -0.6013759 0.7615114
## 2 3.364219 0.9189416 2.0972647
## 3 7.371906 -1.1048745 0.4357619
## 4 6.467576 -1.1580873 -1.8281372
## 5 4.643848 0.1494355 -1.0721778
## 6 3.856800 0.8941048 0.4476054
You can also use high level functions from the factoextra package to extract relevant informations
## eigenvalue variance.percent cumulative.variance.percent
## Dim.1 493.2719 38.59008 38.59008
## Dim.2 308.4458 24.13060 62.72067
## Dim.3 225.6850 17.65599 80.37666
## Principal Component Analysis Results for variables
## ===================================================
## Name Description
## 1 "$coord" "Coordinates for the variables"
## 2 "$cor" "Correlations between variables and dimensions"
## 3 "$cos2" "Cos2 for the variables"
## 4 "$contrib" "contributions of the variables"
## Principal Component Analysis Results for individuals
## ===================================================
## Name Description
## 1 "$coord" "Coordinates for the individuals"
## 2 "$cos2" "Cos2 for the individuals"
## 3 "$contrib" "contributions of the individuals"
And some of the very nice plotting methods such as biplots, correlation circles and scatter plots of the scores.
You can project new data in the PCA space although it’s slightly involved at the moment. We demonstrate that by projecting the original data on top of the original graph. As expected, the projections of the new data points (small red points) are superimposed to the original data points (large black points).
A contribution of PLN-PCA is to let the possibility to taking into account some covariates in the parameter space. Such a strategy often completely changes the interpretation of PCA. Indeed, the covariates are often responsible for some strong structure in the data. The effect of the covariates should be removed since they are often quite obvious for the analyst and may hide some more important and subtle effects.
In the case at hand, the covariates corresponds to the meteorological variables. Let us try to introduce some of them in our model, for instance, the temperature, the wind and the cloudiness. This can be done thanks to the model formula:
PCA_models_cov <-
PLNPCA(
Abundance ~ 1 + offset(log(Offset)) + Temperature + Wind + Cloudiness,
data = trichoptera,
ranks = 1:4
)
##
## Initialization...
##
## Adjusting 4 PLN models for PCA analysis.
## Rank approximation = 3
Rank approximation = 4
Rank approximation = 1
Rank approximation = 2
## Post-treatments
## DONE!
Again, the best model is obtained for \(q=3\) classes.
Suppose that we want to have a closer look to the first two axes. This can be done thanks to the plot method:
gridExtra::grid.arrange(
plot(myPCA_cov, map = "individual", ind_cols = trichoptera$Group, plot = FALSE),
plot(myPCA_cov, map = "variable", plot = FALSE),
ncol = 2
)
We can check that the fitted value of the counts – even with this low-rank covariance matrix – are close to the observed ones:
data.frame(
fitted = as.vector(fitted(myPCA_cov)),
observed = as.vector(trichoptera$Abundance)
) %>%
ggplot(aes(x = observed, y = fitted)) +
geom_point(size = .5, alpha =.25 ) +
scale_x_log10(limits = c(1,1000)) +
scale_y_log10(limits = c(1,1000)) +
theme_bw() + annotation_logticks()
When you are done, do not forget to get back to the standard sequential plan with future.
With our PLN-PCA (and any pPCA model for count data, where successive models are not nested), it is important to performed the model selection of \(q\) prior to visualization, since the model with rank \(q=3\) is not nested in the model with rank \(q=4\). Hence, percentage of variance must be interpreted with care: it sums to 100% but must be put in perspective with the model \(R^2\), giving an approximation of the total percentage of variance explained with the current model.↩︎
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.