• Aucun résultat trouvé

Parsimonious additive logistic models

N/A
N/A
Protected

Academic year: 2021

Partager "Parsimonious additive logistic models"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: inserm-00402444

https://www.hal.inserm.fr/inserm-00402444

Submitted on 7 Jul 2009

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Parsimonious additive logistic models

Marta Avalos

To cite this version:

Marta Avalos. Parsimonious additive logistic models. First Workshop of the ERCIM Working Group on Computing & Statistics, Jun 2008, Neuchâtel, Switzerland. page 56. �inserm-00402444�

(2)

Parsimonious additive logistic models

Logistic regression is a standard tool in statistics for binary classification. The logistic model relates the logarithm of the odds-ratio to the predictors via a linear regression model. A generalization is the additive logistic model, which replaces each linear term by an unspecified smooth function, allowing for more flexibility while preserving interpretability. Another variant is penalized logistic regression, which shrinks coefficients to improve the accuracy of prediction. Ridge regression (L2-penalization) and lasso (L1-penalization) are the main penalization procedures. An attractive property of the later is that it performs parameter estimation and variable selection simultaneously. New theoretical results, efficient algorithms, and available software play a major role in the recent popularization of lasso. In this study, L1-penalization is adapted to additive logistic regression fitted by smoothing splines. Coefficients associated to predictors. Coefficients associated to predictors with little effect on the response may be shrunk (some of them to zero). This approach gives parsimonious models, removes irrelevant variables, and identifies non linear trends. The estimates are computed via the usual Newton-Raphson update, combined with the lars-lasso algorithm, to resolve the penalization problem, and the backfitting algorithm to fit additive models. Different criteria based on the effective degrees of freedom are proposed to choose the penalization parameters. Performance is illustrated with some examples.

Références

Documents relatifs

Hence the idea: If we saw servers or nodes of the graph as a node in an electrical circuit, and the "distances" between vertices as a resistor values in a circuit, then more

In this article I will give an improvement in space and in time of the algorithm says : we know that there exist several methods to find the Hamiltonian cycles such as the Monte

Unit´e de recherche INRIA Rocquencourt, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex Unit´e de recherche INRIA Sophia-Antipolis, 2004 route des Lucioles, BP

There was a breakthrough two years ago, when Baladi and Vall´ee [2] extended the previous method for obtaining limit distributions, for a large class of costs, the so-called

method to solve the graph oloring problem by an exat way. This

Thus, given a signed active set and a sign-compliant solution to the associated (local) QP, the set augmented with an over-correlated feature contains a better solution (lower

The dependency on the dimension and the precision is same compared to [1, Proposition 2] (up to logarithmic terms), but this result only holds if the initial distribution is a