Cassio P. de Campos

Orcid: 0000-0001-9130-1287

Affiliations:
  • Eindhoven University of Technology, Department of Mathematics and Computer Science, The Netherlands (since 2019)
  • Utrecht University, Department of Information and Computing Sciences, The Netherlands (2017-2019)
  • Queen's University Belfast, Centre for Data Science and Scalable Computing, UK (2014-2017)
  • Dalle Molle Institute for Artificial Intelligence, Switzerland (2008-2014)


According to our database1, Cassio P. de Campos authored at least 88 papers between 2003 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Probabilistic Integral Circuits.
CoRR, 2023

Continuous Mixtures of Tractable Probabilistic Models.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
High-Value Token-Blocking: Efficient Blocking Method for Record Linkage.
ACM Trans. Knowl. Discov. Data, 2022

2021
Special Issue on Robustness in Probabilistic Graphical Models.
Int. J. Approx. Reason., 2021

Bayesian Kernelised Test of (In)dependence with Mixed-type Variables.
CoRR, 2021

Bayesian Independence Test with Mixed-type Variables.
Proceedings of the 8th IEEE International Conference on Data Science and Advanced Analytics, 2021

2020
A structured view on weighted counting with relations to counting, quantum computation and applications.
Inf. Comput., 2020

Towards Robust Classification with Deep Generative Forests.
CoRR, 2020

Almost No News on the Complexity of MAP in Bayesian Networks.
Proceedings of the International Conference on Probabilistic Graphical Models, 2020

Joints in Random Forests.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

On Pruning for Score-Based Bayesian Network Structure Learning.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
A hierarchy of sum-product networks using robustness.
Int. J. Approx. Reason., 2019

An unsupervised blocking technique for more efficient record linkage.
Data Knowl. Eng., 2019

Towards Scalable and Robust Sum-Product Networks.
Proceedings of the Scalable Uncertainty Management - 13th International Conference, 2019

Robustness in Sum-Product Networks with Continuous and Categorical Data.
Proceedings of the International Symposium on Imprecise Probabilities: Theories and Applications, 2019

An Experimental Study of Prior Dependence in Bayesian Network Structure Learning.
Proceedings of the International Symposium on Imprecise Probabilities: Theories and Applications, 2019

2018
Approximate structure learning for large Bayesian networks.
Mach. Learn., 2018

A new technique of selecting an optimal blocking method for better record linkage.
Inf. Syst., 2018

Robustifying sum-product networks.
Int. J. Approx. Reason., 2018

Entropy-based pruning for learning Bayesian networks using BIC.
Artif. Intell., 2018

Cascading Sum-Product Networks using Robustness.
Proceedings of the International Conference on Probabilistic Graphical Models, 2018

2017
Joint Analysis of Multiple Algorithms and Performance Measures.
New Gener. Comput., 2017

Efficient learning of Bayesian networks with bounded tree-width.
Int. J. Approx. Reason., 2017

Introduction to the special issue on statistical and computational methods for genomics and integrative genomics.
Int. J. Approx. Reason., 2017

Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks.
CoRR, 2017

Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Credal Sum-Product Networks.
Proceedings of the Tenth International Symposium on Imprecise Probability: Theories and Applications, 2017

Learning Bayesian Networks with Incomplete Data by Augmentation.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Hidden Markov models with set-valued parameters.
Neurocomputing, 2016

Learning extended tree augmented naive structures.
Int. J. Approx. Reason., 2016

Ordering Quantiles through Confidence Statements.
Entropy, 2016

Bayesian Dependence Tests for Continuous, Binary and Mixed Continuous-Binary Variables.
Entropy, 2016

Bayesian network data imputation with application to survival tree analysis.
Comput. Stat. Data Anal., 2016

Learning Bounded Treewidth Bayesian Networks with Thousands of Variables.
CoRR, 2016

Learning Bayesian Networks without Assuming Missing at Random.
CoRR, 2016

Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Learning Bayesian Networks with Bounded Tree-width via Guided Search.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Approximate credal network updating by linear programming with applications to decision making.
Int. J. Approx. Reason., 2015

Averaged Extended Tree Augmented Naive Classifier.
Entropy, 2015

Imprecision in Machine Learning and AI.
IEEE Intell. Informatics Bull., 2015

Learning Bayesian Networks with Thousands of Variables.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Statistical Tests for Joint Analysis of Performance Measures.
Proceedings of the Advanced Methodologies for Bayesian Networks, 2015

The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Learning Bounded Tree-Width Bayesian Networks via Sampling.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2015

2014
Probabilistic Inference in Credal Networks: New Complexity Results.
J. Artif. Intell. Res., 2014

Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms.
Int. J. Approx. Reason., 2014

Transform both sides model: A parametric approach.
Comput. Stat. Data Anal., 2014

Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

Extended Tree Augmented Naive Classifier.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

Advances in Learning Bayesian Networks of Bounded Treewidth.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Global Sensitivity Analysis for MAP Inference in Graphical Models.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

The Computational Complexity of Stochastic Optimization.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Algorithms for Hidden Markov Models with Imprecisely Specified Parameters.
Proceedings of the 2014 Brazilian Conference on Intelligent Systems, 2014

2013
A Structured View on Weighted Counting with Relations to Quantum Computation and Applications.
Electron. Colloquium Comput. Complex., 2013

On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables.
Artif. Intell., 2013

On the Complexity of Strong and Epistemic Credal Networks.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Approximating Credal Network Inferences by Linear Programming.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013

Complexity of Inferences in Polytree-shaped Semi-Qualitative Probabilistic Networks.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Solving Limited Memory Influence Diagrams.
J. Artif. Intell. Res., 2012

Updating credal networks is approximable in polynomial time.
Int. J. Approx. Reason., 2012

Propositional and Relational Bayesian Networks Associated with Imprecise and Qualitative Probabilistic Assesments
CoRR, 2012

The Complexity of Approximately Solving Influence Diagrams.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Anytime Marginal MAP Inference.
Proceedings of the 29th International Conference on Machine Learning, 2012

2011
Integração de evidências em redes credais e a regra de Jeffrey.
RITA, 2011

Efficient Structure Learning of Bayesian Networks using Constraints.
J. Mach. Learn. Res., 2011

Improving parameter learning of Bayesian nets from incomplete data
CoRR, 2011

Solving Decision Problems with Limited Information.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Inference with Multinomial Data: Why to Weaken the Prior Strength.
Proceedings of the IJCAI 2011, 2011

New Complexity Results for MAP in Bayesian Networks.
Proceedings of the IJCAI 2011, 2011

Bayesian Networks and the Imprecise Dirichlet Model Applied to Recognition Problems.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2011

2010
A tree augmented classifier based on Extreme Imprecise Dirichlet Model.
Int. J. Approx. Reason., 2010

Generalized loopy 2U: A new algorithm for approximate inference in credal networks.
Int. J. Approx. Reason., 2010

New Results for the MAP Problem in Bayesian Networks
CoRR, 2010

An Improved Structural EM to Learn Dynamic Bayesian Nets.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

Properties of Bayesian Dirichlet Scores to Learn Bayesian Network Structures.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence.
J. Appl. Log., 2009

Structure learning of Bayesian networks using constraints.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Inference from Multinomial Data Based on a MLE-Dominance Criterion.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2009

2008
Probabilistic logic with independence.
Int. J. Approx. Reason., 2008

Strategy Selection in Influence Diagrams using Imprecise Probabilities.
Proceedings of the UAI 2008, 2008

Improving Bayesian Network parameter learning using constraints.
Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

Constrained Maximum Likelihood Learning of Bayesian Networks for Facial Action Recognition.
Proceedings of the Computer Vision, 2008

2007
Computing lower and upper expectations under epistemic independence.
Int. J. Approx. Reason., 2007

2006
Probabilistic Logic with Strong Independence.
Proceedings of the Advances in Artificial Intelligence, 2006

2005
Belief Updating and Learning in Semi-Qualitative Probabilistic Networks.
Proceedings of the UAI '05, 2005

The Inferential Complexity of Bayesian and Credal Networks.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004
Propositional and Relational Bayesian Networks Associated with Imprecise and Qualitat.
Proceedings of the UAI '04, 2004

2003
Inference in Polytrees with Sets of Probabilities.
Proceedings of the UAI '03, 2003


  Loading...