Silvia Pandolfi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Silvia Pandolfi has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Francesco Bartolucci
University of Perugia
3 shared publications - Fulvia Pennoni
University of Milano-Bicocca
2 shared publications F. Bartolucci
Department of Economics, Finance and Statistics University of Perugia Via A. Pascoli, 20 06123 Perugia
1 shared publication- Giorgio Eduardo Montanari
University of Perugia
1 shared publication N. Friel
School of Mathematical Sciences INSIGHT: The National Centre for Big Data Analytics University College Dublin IE
1 shared publication- Nial Friel
Insight Centre for Data Analytics, University College Dublin
1 shared publication
Latest Publications
- 1 April 2014
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 72, 298-314
A generalized multiple-try version of the Reversible Jump algorithm
- 1 April 2014
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 72, 298-314
A generalized multiple-try version of the Reversible Jump algorithm
- 7 November 2013
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 8 (2) , 125-145
A comparison of some criteria for states selection in the latent Markov model for longitudinal data
- 7 November 2013
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 8 (2) , 125-145
A comparison of some criteria for states selection in the latent Markov model for longitudinal data
- Open Access
A generalized Multiple-try Metropolis version of the Reversible Jump algorithm
The Reversible Jump algorithm is one of the most widely used Markov chain Monte Carlo algorithms for Bayesian estimation and model selection. A generalized multiple-try version of this algorithm is proposed. The algorithm is based on drawing several proposals at each step and randomly choosing one of them on the basis of weights (selection probabilities) that may be arbitrary chosen. Among the possible choices, a method is employed which is based on selection probabilities depending on a quadratic approximation of the posterior distribution. Moreover, the implementation of the proposed algorithm for challenging model selection problems, in which the quadratic approximation is not feasible, is considered. The resulting algorithm leads to a gain in efficiency with respect to the Reversible Jump algorithm, and also in terms of computational effort. The performance of this approach is illustrated for real examples involving a logistic regression model and a latent class model.
Open AccessA generalized Multiple-try Metropolis version of the Reversible Jump algorithm
The Reversible Jump algorithm is one of the most widely used Markov chain Monte Carlo algorithms for Bayesian estimation and model selection. A generalized multiple-try version of this algorithm is proposed. The algorithm is based on drawing several proposals at each step and randomly choosing one of them on the basis of weights (selection probabilities) that may be arbitrary chosen. Among the possible choices, a method is employed which is based on selection probabilities depending on a quadratic approximation of the posterior distribution. Moreover, the implementation of the proposed algorithm for challenging model selection problems, in which the quadratic approximation is not feasible, is considered. The resulting algorithm leads to a gain in efficiency with respect to the Reversible Jump algorithm, and also in terms of computational effort. The performance of this approach is illustrated for real examples involving a logistic regression model and a latent class model.
- Open Access
A comparison of some criteria for states selection in the latent Markov model for longitudinal data
We compare different selection criteria to choose the number of latent states of a multivariate latent Markov model for longitudinal data. This model is based on an underlying Markov chain to represent the evolution of a latent characteristic of a group of individuals over time. Then, the response variables observed at the different occasions are assumed to be conditionally independent given this chain. Maximum likelihood of the model is carried out through an Expectation-Maximization algorithm based on forward-backward recursions which are well known in the hidden Markov literature for time series. The selection criteria we consider in our comparison are based on penalized versions of the maximum log-likelihood or on the posterior probabilities of belonging to each latent state, that is the conditional probability of the latent state given the observed data. A Monte Carlo simulation study shows that the indices referred to the log-likelihood based information criteria perform in general better with respect to those referred to the classification based criteria. This is due to the fact that the latter tend to underestimate the true number of latent states, especially in the univariate case.
Open AccessA comparison of some criteria for states selection in the latent Markov model for longitudinal data
We compare different selection criteria to choose the number of latent states of a multivariate latent Markov model for longitudinal data. This model is based on an underlying Markov chain to represent the evolution of a latent characteristic of a group of individuals over time. Then, the response variables observed at the different occasions are assumed to be conditionally independent given this chain. Maximum likelihood of the model is carried out through an Expectation-Maximization algorithm based on forward-backward recursions which are well known in the hidden Markov literature for time series. The selection criteria we consider in our comparison are based on penalized versions of the maximum log-likelihood or on the posterior probabilities of belonging to each latent state, that is the conditional probability of the latent state given the observed data. A Monte Carlo simulation study shows that the indices referred to the log-likelihood based information criteria perform in general better with respect to those referred to the classification based criteria. This is due to the fact that the latter tend to underestimate the true number of latent states, especially in the univariate case.
- 1 October 2012
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 77 (4) , 782-802
Dimensionality of the Latent Structure and Item Selection Via Latent Class Multidimensional IRT Models
With reference to a questionnaire aimed at assessing the performance of Italian nursing homes on the basis of the health conditions of their patients, we investigate two relevant issues: dimensionality of the latent structure and discriminating power of the items composing the questionnaire. The approach is based on a multidimensional item response theory model, which assumes a two-parameter logistic parameterization for the response probabilities. This model represents the health status of a patient by latent variables having a discrete distribution and, therefore, it may be seen as a constrained version of the latent class model. On the basis of the adopted model, we implement a hierarchical clustering algorithm aimed at assessing the actual number of dimensions measured by the questionnaire. These dimensions correspond to disjoint groups of items. Once the number of dimensions is selected, we also study the discriminating power of every item, so that it is possible to select the subset of these items which is able to provide an amount of information close to that of the full set. We illustrate the proposed approach on the basis of the data collected on 1,051 elderly people hosted in a sample of Italian nursing homes.
- 1 October 2012
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 77 (4) , 782-802
Dimensionality of the Latent Structure and Item Selection Via Latent Class Multidimensional IRT Models
With reference to a questionnaire aimed at assessing the performance of Italian nursing homes on the basis of the health conditions of their patients, we investigate two relevant issues: dimensionality of the latent structure and discriminating power of the items composing the questionnaire. The approach is based on a multidimensional item response theory model, which assumes a two-parameter logistic parameterization for the response probabilities. This model represents the health status of a patient by latent variables having a discrete distribution and, therefore, it may be seen as a constrained version of the latent class model. On the basis of the adopted model, we implement a hierarchical clustering algorithm aimed at assessing the actual number of dimensions measured by the questionnaire. These dimensions correspond to disjoint groups of items. Once the number of dimensions is selected, we also study the discriminating power of every item, so that it is possible to select the subset of these items which is able to provide an amount of information close to that of the full set. We illustrate the proposed approach on the basis of the data collected on 1,051 elderly people hosted in a sample of Italian nursing homes.
- Open Access
Bayesian inference for a class of latent Markov models for categorical longitudinal data
We propose a Bayesian inference approach for a class of latent Markov models. These models are widely used for the analysis of longitudinal categorical data, when the interest is in studying the evolution of an individual unobservable characteristic. We consider, in particular, the basic latent Markov, which does not account for individual covariates, and its version that includes such covariates in the measurement model. The proposed inferential approach is based on a system of priors formulated on a transformation of the initial and transition probabilities of the latent Markov chain. This system of priors is equivalent to one based on Dirichlet distributions. In order to draw samples from the joint posterior distribution of the parameters and the number of latent states, we implement a reversible jump algorithm which alternates moves of Metropolis-Hastings type with moves of split/combine and birth/death types. The proposed approach is illustrated through two applications based on longitudinal datasets.
Open AccessBayesian inference for a class of latent Markov models for categorical longitudinal data
We propose a Bayesian inference approach for a class of latent Markov models. These models are widely used for the analysis of longitudinal categorical data, when the interest is in studying the evolution of an individual unobservable characteristic. We consider, in particular, the basic latent Markov, which does not account for individual covariates, and its version that includes such covariates in the measurement model. The proposed inferential approach is based on a system of priors formulated on a transformation of the initial and transition probabilities of the latent Markov chain. This system of priors is equivalent to one based on Dirichlet distributions. In order to draw samples from the joint posterior distribution of the parameters and the number of latent states, we implement a reversible jump algorithm which alternates moves of Metropolis-Hastings type with moves of split/combine and birth/death types. The proposed approach is illustrated through two applications based on longitudinal datasets.