A set of functions allowing to implement the 'SpiceFP' approach which is iterative. It involves transformation of functional predictors into several candidate explanatory matrices (based on contingency tables), to which relative edge matrices with contiguity constraints are associated. Generalized Fused Lasso regression are performed in order to identify the best candidate matrix, the best class intervals and related coefficients at each iteration. The approach is stopped when the maximal number of iterations is reached or when retained coefficients are zeros. Supplementary functions allow to get coefficients of any candidate matrix or mean of coefficients of many candidates.

The main function of the package is the `spicefp`

function. It directly
performs the three main steps of the SpiceFP approach, by using intermediate functions of the package.

1) At he first step, contingency tables are constructed by
defining joint modalities using class intervals or bins. Several candidate
partitions are then defined.
For each statistical individual *i* and each candidate partition (denoted *u* here), the 2 (resp. 3)
functional predictors are transformed into frequency bi(resp. tri)-variate histograms (or contingency tables),
stored as row vectors. The combination of these row vectors for all individuals enables the construction of a
candidate explanatory matrix indexed by *u* (denoted here *X^u*).
The function `candidates`

is designed to build these candidate matrices.

2) At the second step, for each candidate explanatory matrix, an edge matrix is defined to
represent the contiguity constraints between modalities of the contingency table.

3) Finally at the last step, the best class intervals and related
regression coefficients are defined by: i) performing a Generalized Fused Lasso
using each candidate explanatory matrix. The SpiceFP model is the following

*y_i = X_i^u β^u + \varepsilon_i,*

where *β^u* is the coefficient to be estimated on the 2D (resp. 3D) intervals.
The estimator of *β* is obtained as follows:

* \hat{β}^{u,γ}(λ) = argmin \frac{1}{2} \|y - X^u β\|_2^2 + λ \|D ^{u,γ} β\|_1,*

where *λ* is a penalty parameter that controls the smoothness of the coefficients, and
*γ* is the ratio between the regularization parameters of parsimony and fusion.
ii) choosing the best candidate matrix
and selecting its variables using an information criterion and checking the
shutdown conditions to stop the approach. Indeed, SpiceFP may be used in an iterative way. It
therefore allows to identify up to K best candidate matrices and related coefficients.

**Maintainer**: Girault Gnanguenon Guesse girault.gnanguenon@gmail.com

Authors:

Patrice Loisel patrice.loisel@inrae.fr

Benedicte Fontez benedicte.fontez@supagro.fr

Nadine Hilgert nadine.hilgert@inrae.fr

Other contributors:

Thierry Simonneau thierry.simonneau@inrae.fr [contractor]

Isabelle Sanchez isabelle.sanchez@inrae.fr [contractor]

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.