Riazi, Maryam
(2026)
Synthetic population for Bologna: maximum-entropy approach via persistent contrastive divergence on heterogeneous ISTAT data.
[Laurea magistrale], Università di Bologna, Corso di Studio in
Physics [LM-DM270], Documento ad accesso riservato.
Documenti full-text disponibili:
![[thumbnail of Thesis]](https://amslaurea.unibo.it/style/images/fileicons/application_pdf.png) |
Documento PDF (Thesis)
Full-text accessibile solo agli utenti istituzionali dell'Ateneo
Disponibile con Licenza: Salvo eventuali più ampie autorizzazioni dell'autore, la tesi può essere liberamente consultata e può essere effettuato il salvataggio e la stampa di una copia per fini strettamente personali di studio, di ricerca e di insegnamento, con espresso divieto di qualunque utilizzo direttamente o indirettamente commerciale. Ogni altro diritto sul materiale è riservato
Download (1MB)
| Contatta l'autore
|
Abstract
Generating a synthetic population is a very new and increasingly important problem for downstream applications. A synthetic population is required for lack of census data, and conserving individual privacy. This thesis builds a synthetic population of 500,000 inhabitants for the Comune of Bologna, each described by K=34 attributes, all based on aggregate tables acquired from ISTAT database.
The already existing approaches, fail to obtain the necessary diversity of the synthetic population, generating problems in the downstream applications. Whereas more complicated approaches become numerically hard to solve for large number of attributes.
For this project the joint space of 34 categorical attributes contains 2.6 × 10^19 possible individual profiles.
We address the first and the second problem with GibbsPCDSolver, a stochastic maximum-entropy solver based on Persistent Contrastive Divergence.
The most important problem that this project addresses as the central theme –where most existing approaches refuse to confront– is dealing with real-world heterogeneous data. The real ISTAT tables are published at five different geographical levels, and contradict
each other. No joint distribution can satisfy all published targets at once, so any solver necessarily leaves residual error somewhere.
For his problem a reliability-weighting scheme has been proposed.
A separate difficulty arises from the requirement that no individual be logically impossible. We demonstrate the effect directly and repair it with a Metropolis–Hastings move that transposes an entire block of attributes in one step.
We support this reading with four diagnostic tools developed in the thesis. The resulting population contains no logically impossible individual and retains full diversity which is precisely the property that reweighting methods such as raking lose, and which downstream agent-based simulations of Bologna require.
Abstract
Generating a synthetic population is a very new and increasingly important problem for downstream applications. A synthetic population is required for lack of census data, and conserving individual privacy. This thesis builds a synthetic population of 500,000 inhabitants for the Comune of Bologna, each described by K=34 attributes, all based on aggregate tables acquired from ISTAT database.
The already existing approaches, fail to obtain the necessary diversity of the synthetic population, generating problems in the downstream applications. Whereas more complicated approaches become numerically hard to solve for large number of attributes.
For this project the joint space of 34 categorical attributes contains 2.6 × 10^19 possible individual profiles.
We address the first and the second problem with GibbsPCDSolver, a stochastic maximum-entropy solver based on Persistent Contrastive Divergence.
The most important problem that this project addresses as the central theme –where most existing approaches refuse to confront– is dealing with real-world heterogeneous data. The real ISTAT tables are published at five different geographical levels, and contradict
each other. No joint distribution can satisfy all published targets at once, so any solver necessarily leaves residual error somewhere.
For his problem a reliability-weighting scheme has been proposed.
A separate difficulty arises from the requirement that no individual be logically impossible. We demonstrate the effect directly and repair it with a Metropolis–Hastings move that transposes an entire block of attributes in one step.
We support this reading with four diagnostic tools developed in the thesis. The resulting population contains no logically impossible individual and retains full diversity which is precisely the property that reweighting methods such as raking lose, and which downstream agent-based simulations of Bologna require.
Tipologia del documento
Tesi di laurea
(Laurea magistrale)
Autore della tesi
Riazi, Maryam
Relatore della tesi
Scuola
Corso di studio
Indirizzo
Applied Physics
Ordinamento Cds
DM270
Parole chiave
Maximum entropy,Synthetic population,machine learning,data science,urban data
Data di discussione della Tesi
24 Settembre 2026
URI
Altri metadati
Tipologia del documento
Tesi di laurea
(NON SPECIFICATO)
Autore della tesi
Riazi, Maryam
Relatore della tesi
Scuola
Corso di studio
Indirizzo
Applied Physics
Ordinamento Cds
DM270
Parole chiave
Maximum entropy,Synthetic population,machine learning,data science,urban data
Data di discussione della Tesi
24 Settembre 2026
URI
Statistica sui download
Gestione del documento: