default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCassio P. de Campos
- > Home > Persons > Cassio P. de Campos
Publications
- 2018
[j28]Cassio P. de Campos
, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon:
Entropy-based pruning for learning Bayesian networks using BIC. Artif. Intell. 260: 42-50 (2018)- [j25]Mauro Scanagatta, Giorgio Corani, Cassio Polpo de Campos, Marco Zaffalon:
Approximate structure learning for large Bayesian networks. Mach. Learn. 107(8-10): 1209-1227 (2018) - 2017
- [i14]Cassio P. de Campos, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon:
Entropy-based Pruning for Learning Bayesian Networks using BIC. CoRR abs/1707.06194 (2017) - 2016
- [j21]Paola M. V. Rancoita, Marco Zaffalon, Emanuele Zucca, Francesco Bertoni, Cassio P. de Campos:
Bayesian network data imputation with application to survival tree analysis. Comput. Stat. Data Anal. 93: 373-387 (2016) - [j18]Cassio P. de Campos, Giorgio Corani, Mauro Scanagatta, Marco Cuccu, Marco Zaffalon:
Learning extended tree augmented naive structures. Int. J. Approx. Reason. 68: 153-163 (2016) - [c33]Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon:
Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables. NIPS 2016: 1462-1470 - [i13]Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon:
Learning Bounded Treewidth Bayesian Networks with Thousands of Variables. CoRR abs/1605.03392 (2016) - 2015
- [j14]Alessandro Antonucci, Cassio P. de Campos, David Huber, Marco Zaffalon:
Approximate credal network updating by linear programming with applications to decision making. Int. J. Approx. Reason. 58: 25-38 (2015) - [c29]Mauro Scanagatta, Cassio P. de Campos, Giorgio Corani, Marco Zaffalon:
Learning Bayesian Networks with Thousands of Variables. NIPS 2015: 1864-1872 - 2014
- [c24]Cassio P. de Campos, Marco Cuccu, Giorgio Corani, Marco Zaffalon:
Extended Tree Augmented Naive Classifier. Probabilistic Graphical Models 2014: 176-189 - [c23]Mauro Scanagatta, Cassio P. de Campos, Marco Zaffalon:
Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks. Probabilistic Graphical Models 2014: 426-441 - 2013
- [j10]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables. Artif. Intell. 205: 30-38 (2013) - [c21]Alessandro Antonucci, Cassio P. de Campos, David Huber, Marco Zaffalon:
Approximating Credal Network Inferences by Linear Programming. ECSQARU 2013: 13-24 - 2012
- [j9]Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Updating credal networks is approximable in polynomial time. Int. J. Approx. Reason. 53(8): 1183-1199 (2012) - [j8]Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Solving Limited Memory Influence Diagrams. J. Artif. Intell. Res. 44: 97-140 (2012) - [c18]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
The Complexity of Approximately Solving Influence Diagrams. UAI 2012: 604-613 - [i5]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
The Complexity of Approximately Solving Influence Diagrams. CoRR abs/1210.4890 (2012) - 2011
- [i3]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
Solving Limited Memory Influence Diagrams. CoRR abs/1109.1754 (2011) - 2010
- [j5]Alessandro Antonucci, Yi Sun, Cassio P. de Campos, Marco Zaffalon:
Generalized loopy 2U: A new algorithm for approximate inference in credal networks. Int. J. Approx. Reason. 51(5): 474-484 (2010)
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.
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.
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.
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 2025-06-23 21:07 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:
