F
Francesco Bartolucci
Researcher at University of Perugia
Publications - 225
Citations - 3077
Francesco Bartolucci is an academic researcher from University of Perugia. The author has contributed to research in topics: Latent class model & Expectation–maximization algorithm. The author has an hindex of 31, co-authored 214 publications receiving 2629 citations. Previous affiliations of Francesco Bartolucci include University of Urbino.
Papers
More filters
Journal ArticleDOI
Adaptive Quadrature for Maximum Likelihood Estimation of a Class of Dynamic Latent Variable Models
TL;DR: In this article, the adaptive GaussianHermite (AGH) numerical quadrature approximation for a particular class of continuous latent variable models for time series and longitudinal data is proposed.
Journal ArticleDOI
On the approximation of the quadratic exponential distribution in a latent variable context
TL;DR: An approximate maximum likelihood estimator of the item parameters of the two-parameter logistic model is developed which is very simply implemented and illustrated through an example based on a dataset on educational assessment.
Journal ArticleDOI
A comparison between the g-index and the h-index based on concentration
TL;DR: It is discussed how, given a certain number of articles and citations of these articles, the h‐index and the g‐index are affected by the level of concentration of the citations.
Journal ArticleDOI
An exact algorithm for time-dependent variational inference for the dynamic stochastic block model
TL;DR: Results show that there is a certain advantage of the first in terms of dynamic assignment of individuals to the latent blocks in comparison to the true blocking structure, as measured by the adjusted Rand index.
Posted Content
Model Building for Semiparametric Mixtures
TL;DR: In this article, a unified framework for finding the nonparametric maximum likelihood estimator of a multivariate mixing distribution and consequently estimating the mixture complexity is developed, which casts the mixture maximization problem in the concave optimization framework with finitely many linear inequality constraints and turns it into an unconstrained problem using a "penalty function".