If you made any changes in Pure these will be visible here soon.

Personal profile

Academic background

(Please use de Campos, C. P. for citations. Please do not use Polpo as surname.) Cassio obtained his Habilitation in Artificial Intelligence (2013), Doctorate in Engineering (2006), MSc in Computer Science (2001) and BSc in Computer Science (1999) from the University of Sao Paulo (Brazil), where he studied both at the Department of Mathematics and Statistics and the Department of Mechatronics. He also obtained a Senior Research Qualification from Utrecht University (2018), Senior Member of ACM (2019), and elected member of the executive board of sipta.org (since 2011). His habilitation and doctorate theses were carried out on the topic of Uncertainty in Artificial Intelligence, in particular related to robust models related to imprecise probabilities. He works on works on foundations of artificial intelligence and statistical machine learning, including probabilistic graphical models, imprecise probability, and computational complexity. In 2006, Cassio was an Assistant Professor at the University of Sao Paulo (Brazil). In 2007-08, he was a visiting research fellow at the Rensselear Polytechnic Institute (USA). From 2008 to 2014, he was a (senior) researcher at the Dalle Molle Institute in Switzerland. From 2014 to 2017, he was a Reader at Queen's University Belfast (UK), and later an Associate Professor at Utrecht University, before joining TU/e in 2019.

Research profile

(Please use de Campos, C. P. for citations. Please do not use Polpo as surname.) Main research interests are reliable machine learning and robust artificial intelligence, focused on theoretical and foundational developments for learning and reasoning with graphical models such as Bayesian networks, (hidden) Markov models, Markov random fields, influence diagrams, Markov decision processes, sum-product networks, and their use in applications. This includes proofs about the computational complexity of many tasks, devising new algorithms that (when created) were orders of magnitude faster than state-of-the-art methods, new mathematical results that may considerably reduce the time to learn graphical models from data, among other challenges. Credal networks, which are graphical models aimed at greater robustness/reliability of results, are of great importance. The work on them and on credal sum-product networks includes the development of the theoretical foundations, as well as some of the best performing algorithms for learning and reasoning.

Quote

"Computer science is no more about computers than astronomy is about telescopes.", often attributed to E. W. Dijkstra.

Education/Academic qualification

Artificial intelligence, expert systems, Doctor, Universidade de Sao Paulo

Doctor, Universidade de Sao Paulo

Theoretical computer science, Master, Universidade de Sao Paulo

Computer science, other, Bachelor, Universidade de Sao Paulo

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2002 2019

Efficient structure learning of Bayesian networks using constraints

de Campos, C. P. & Ji, Q., 1 Mar 2011, In : Journal of Machine Learning Research. 12, p. 663-689 27 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Structure Learning
Bayesian networks
Bayesian Networks
Global Optimality
Dynamic Bayesian Networks
27 Citations (Scopus)

New complexity results for MAP in Bayesian networks

de Campos, C. P., 1 Dec 2011, IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence. AAAI Press, p. 2100-2106 7 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Bayesian networks
Topology
Polynomials
13 Citations (Scopus)

Probabilistic inference in credal networks: New complexity results

Mauá, D. D., de Campos, C. P., Benavoli, A. & Antonucci, A., Jul 2014, In : Journal of Artificial Intelligence Research. 50, p. 603-637 35 p.

Research output: Contribution to journalArticleAcademicpeer-review

Hidden Markov models
Computational complexity
Bayesian networks
Topology
Polynomials

The inferential complexity of bayesian and credal networks

de Campos, C. P. & Cozman, F. G., 1 Dec 2005, International Joint Conference on Artificial Intelligence (IJCAI). p. 1313-1318 6 p. (IJCAI International Joint Conference on Artificial Intelligence)

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Bayesian networks

Learning Bayesian networks with thousands of variables

Scanagatta, M., de Campos, C. P., Corani, G. & Zaffalon, M., 2015, NIPS'15 Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 2. Cambridge: MIT Press, p. 1864-1872 9 p. (Advances in Neural Information Processing Systems)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Bayesian networks

Prizes

ACM Senior Member

Cassio Polpo de Campos (Recipient), 2019

Recognition: OtherFellowships & membershipsScientific

Courses

Data Challenge 1

1/09/17 → …

Course

Data Mining

1/09/15 → …

Course