Johan Kwisthout

Orcid: 0000-0003-4383-7786

Affiliations:
  • Radboud University Nijmegen, Donders Center for Cognition, The Netherlands


According to our database1, Johan Kwisthout authored at least 51 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cancer Subtype Identification Through Integrating Inter and Intra Dataset Relationships in Multi-Omics Data.
IEEE Access, 2024

Neural Population Decoding and Imbalanced Multi-Omic Datasets for Cancer Subtype Diagnosis.
Proceedings of the 17th International Joint Conference on Biomedical Engineering Systems and Technologies, 2024

2023
Motivating explanations in Bayesian networks using MAP-independence.
Int. J. Approx. Reason., 2023

Bayesian Integration of Information Using Top-Down Modulated WTA Networks.
CoRR, 2023

2022
From representations in predictive processing to degrees of representational features.
Minds Mach., 2022

Benchmarking energy consumption and latency for neuromorphic computing in condensed matter and particle physics.
CoRR, 2022

Parameterized Complexity Results for Bayesian Inference.
CoRR, 2022

Speeding up approximate MAP by applying domain knowledge about relevant variables.
Proceedings of the International Conference on Probabilistic Graphical Models, 2022

Parameterized Completeness Results for Bayesian Inference.
Proceedings of the International Conference on Probabilistic Graphical Models, 2022

2021
Explainable AI Using MAP-Independence.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2021

Certainly Strange: A Probabilistic Perspective on Ignorance.
Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

2020
On the computational power and complexity of Spiking Neural Networks.
Proceedings of the NICE '20: Neuro-inspired Computational Elements Workshop, 2020

From Models of Cognition to Robot Control and Back Using Spiking Neural Networks.
Proceedings of the Biomimetic and Biohybrid Systems - 9th International Conference, 2020

A Spiking Neuron Implementation of Genetic Algorithms for Optimization.
Proceedings of the Artificial Intelligence and Machine Learning - 32nd Benelux Conference, 2020

2019
Processing of Prediction Errors in Mentalizing Areas.
J. Cogn. Neurosci., 2019

A spiking neural algorithm for the Network Flow problem.
CoRR, 2019

Cognition and intractability: a guide to classical and parameterized complexity analysis.
Cambridge University Press, ISBN: 9781107358331, 2019

2018
Rational analysis, intractability, and the prospects of 'as if'-explanations.
Synth., 2018

Approximate inference in Bayesian networks: Parameterized complexity results.
Int. J. Approx. Reason., 2018

Finding Dissimilar Explanations in Bayesian Networks: Complexity Results.
Proceedings of the Artificial Intelligence - 30th Benelux Conference, 2018

2017
Community-based influence maximization in social networks under a competitive linear threshold model.
Knowl. Based Syst., 2017

Perception is in the Details: A Predictive Coding Account of the Psychedelic Phenomenon.
Proceedings of the 39th Annual Meeting of the Cognitive Science Society, 2017

2016
The Parameterized Complexity of Approximate Inference in Bayesian Networks.
Proceedings of the Probabilistic Graphical Models - Eighth International Conference, 2016

The mobile-paradigm as measure of infants' sense of agency? Insights from babybot simulations.
Proceedings of the 2016 Joint IEEE International Conference on Development and Learning and Epigenetic Robotics, 2016

Causal learning in the Crib: A predictive processing formalization and babybot simulation.
Proceedings of the 2016 Joint IEEE International Conference on Development and Learning and Epigenetic Robotics, 2016

2015
Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks.
J. Artif. Intell. Res., 2015

Most frugal explanations in Bayesian networks.
Artif. Intell., 2015

The developing sense of agency: Implications from cognitive phenomenology.
Proceedings of the 2015 Joint IEEE International Conference on Development and Learning and Epigenetic Robotics, 2015

What senses of agency can infants have?
Proceedings of the 37th Annual Meeting of the Cognitive Science Society, 2015

2014
Treewidth and the Computational Complexity of MAP Approximations.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

Minimizing Relative Entropy in Hierarchical Predictive Coding.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

Leaving Andy Clark's 'safe shores': Scaling predictive processing to higher cognition.
Proceedings of the 36th Annual Meeting of the Cognitive Science Society, 2014

2013
Bridging the gap between theory and practice of approximate Bayesian inference.
Cogn. Syst. Res., 2013

Structure Approximation of Most Probable Explanations in Bayesian Networks.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013

Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013

Computational complexity analysis for cognitive scientists.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

Constraints on Bayesian Explanation.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

Predictive coding and the Bayesian brain: Intractability hurdles that are yet to be overcome.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

2012
Relevancy in Problem Solving: A Computational Framework.
J. Probl. Solving, 2012

2011
Most probable explanations in Bayesian networks: Complexity and tractability.
Int. J. Approx. Reason., 2011

Bayesian Intractability Is Not an Ailment That Approximation Can Cure.
Cogn. Sci., 2011

The Complexity of Finding <i>k</i>th Most Probable Explanations in Probabilistic Networks.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Ignorance is bliss: A complexity perspective on adapting reactive architectures.
Proceedings of the 1st International Conference on Development and Learning and on Epigenetic Robotics, 2011

The computational costs of recipient design and intention recognition in communication.
Proceedings of the 33th Annual Meeting of the Cognitive Science Society, 2011

2010
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks.
Proceedings of the ECAI 2010, 2010

2008
Complexity results for enhanced qualitative probabilistic networks.
Int. J. Approx. Reason., 2008

Joint attention and language evolution.
Connect. Sci., 2008

The Computational Complexity of Sensitivity Analysis and Parameter Tuning.
Proceedings of the UAI 2008, 2008

2007
The Computational Complexity of Monotonicity in Probabilistic Networks.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Local Monotonicity in Probabilistic Networks.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2007

2005
Modelling Uncertainty in Agent Programming.
Proceedings of the Declarative Agent Languages and Technologies III, 2005


  Loading...