Sparse Logistic Maximum Likelihood Estimation for Optimal Well-Being Determinants
Autor: | Jianyi Lin, Emiliano Sironi |
---|---|
Rok vydání: | 2021 |
Předmět: |
Generalized linear model
Optimization problem Computer science Settore ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI Sparse approximation Logistic regression Computer Science Applications European Social Survey Human-Computer Interaction Set (abstract data type) wellbeing Quadratic equation Statistics Computer Science (miscellaneous) Information Systems Variable (mathematics) |
Zdroj: | IEEE Transactions on Emerging Topics in Computing. 9:1316-1327 |
ISSN: | 2376-4562 |
DOI: | 10.1109/tetc.2020.3009295 |
Popis: | Optimal well-being is a new multi-dimensional construct, which incorporates the well-known preexisting notions of subjective and psychological well-being. Classical models for describing the predictors of optimal well-being binary response variable are generalized linear models (GLM), such as logistic regression model. Since the number of predictors might be relatively large in these models, we devise a sparse optimization method for the regression problem based on subsequent iterations of a suitable sparse quadratic approximant problem, so that the resulting parameter vector estimate is sparse and indicates few significant predictors. We conduct empirical assessments using data of the European Social Survey (ESS), in order to identify the set of determinants which better predict optimal well-being by means of the proposed sparse regression method. ESS data analysis confirms that few selected predictors provide good data interpretation and no loss of information in the frequency of correct classification for people meeting the criteria of optimal well-being. Moreover, simulations with different structural parameter values indicate that sparse logistic model performs better in terms of the estimation of the true vector of parameters in a more parsimonious setting compared to classical logistic regression. The benefits increase as the structural sparsity of the optimization problem becomes stronger. |
Databáze: | OpenAIRE |
Externí odkaz: |