default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSilvia Pandolfi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Maria Francesca Marino
, Silvia Pandolfi:
Hybrid maximum likelihood inference for stochastic block models. Comput. Stat. Data Anal. 171: 107449 (2022)- 2021
- [j11]David Aristei, Silvia Bacci, Francesco Bartolucci, Silvia Pandolfi:
A bivariate finite mixture growth model with selection. Adv. Data Anal. Classif. 15(3): 759-793 (2021) - 2020
- [j10]Francesco Bartolucci, Silvia Pandolfi:
An exact algorithm for time-dependent variational inference for the dynamic stochastic block model. Pattern Recognit. Lett. 138: 362-369 (2020)
2010 – 2019
- 2018
- [j9]Francesco Bartolucci, Giorgio Eduardo Montanari, Silvia Pandolfi:
Latent Ignorability and Item Selection for Nursing Home Case-Mix Evaluation. J. Classif. 35(1): 172-193 (2018) - [j8]Francesco Bartolucci, Maria Francesca Marino, Silvia Pandolfi:
Dealing with reciprocity in dynamic stochastic block models. Comput. Stat. Data Anal. 123: 86-100 (2018) - [j7]Giorgio Eduardo Montanari, Silvia Pandolfi:
Evaluation of long-term health care services through a latent Markov model with covariates. Stat. Methods Appl. 27(1): 151-173 (2018) - 2016
- [j6]Francesco Bartolucci, Giorgio Eduardo Montanari, Silvia Pandolfi:
Item selection by latent class-based methods: an application to nursing home evaluation. Adv. Data Anal. Classif. 10(2): 245-262 (2016) - 2015
- [j5]Francesco Bartolucci, Giorgio Eduardo Montanari, Silvia Pandolfi:
Three-step estimation of latent Markov models with covariates. Comput. Stat. Data Anal. 83: 287-301 (2015) - 2014
- [j4]Silvia Bacci, Silvia Pandolfi, Fulvia Pennoni:
A comparison of some criteria for states selection in the latent Markov model for longitudinal data. Adv. Data Anal. Classif. 8(2): 125-145 (2014) - [j3]Silvia Pandolfi, Francesco Bartolucci, Nial Friel:
A generalized multiple-try version of the Reversible Jump algorithm. Comput. Stat. Data Anal. 72: 298-314 (2014) - [j2]Francesco Bartolucci, Silvia Pandolfi:
A New Constant Memory Recursion for Hidden Markov Models. J. Comput. Biol. 21(2): 99-117 (2014) - [j1]Francesco Bartolucci, Silvia Pandolfi:
Comment on the paper "On the memory complexity of the forward-backward algorithm, " by Khreich W., Granger E., Miri A., Sabourin, R. Pattern Recognit. Lett. 38: 15-19 (2014) - 2010
- [c1]Silvia Pandolfi, Francesco Bartolucci, Nial Friel:
A generalization of the Multiple-try Metropolis algorithm for Bayesian estimation and model selection. AISTATS 2010: 581-588
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
