Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Data Science (13)
- Engineering (10)
- Graphics and Human Computer Interfaces (8)
- Social and Behavioral Sciences (6)
- Theory and Algorithms (6)
-
- Computer Engineering (5)
- Arts and Humanities (4)
- Life Sciences (4)
- Medicine and Health Sciences (4)
- Biomedical Engineering and Bioengineering (3)
- Other Computer Sciences (3)
- Robotics (3)
- Statistics and Probability (3)
- Art and Design (2)
- Communication (2)
- Computational Neuroscience (2)
- Health Information Technology (2)
- Interactive Arts (2)
- Interdisciplinary Arts and Media (2)
- Neuroscience and Neurobiology (2)
- Software Engineering (2)
- Applied Mathematics (1)
- Applied Statistics (1)
- Biochemistry (1)
- Biochemistry, Biophysics, and Structural Biology (1)
- Bioimaging and Biomedical Optics (1)
- Bioinformatics (1)
- Keyword
-
- Machine Learning (11)
- Machine learning (8)
- Artificial Intelligence (7)
- Deep learning (6)
- AI (5)
-
- Large Language Models (5)
- Natural Language Processing (5)
- Robotics (5)
- Interpretability (3)
- NLP (3)
- Artificial intelligence (2)
- BERT (2)
- Bias (2)
- Clustering (2)
- Computer vision (2)
- Data Science (2)
- Deep Learning (2)
- Explainable AI (2)
- Field robotics (2)
- LLM (2)
- LLMs (2)
- Marine robotics (2)
- Mental Health (2)
- Multimodal (2)
- Perception (2)
- Reinforcement Learning (2)
- Transformers (2)
- Twitter (2)
- 3-D reconstruction (1)
- 3D recording (1)
- Publication Year
- Publication
- Publication Type
Articles 61 - 61 of 61
Full-Text Articles in Artificial Intelligence and Robotics
Improving Structure Mcmc For Bayesian Networks Through Markov Blanket Resampling, Chengwei Su, Mark E. Borsuk
Improving Structure Mcmc For Bayesian Networks Through Markov Blanket Resampling, Chengwei Su, Mark E. Borsuk
Dartmouth Scholarship
Algorithms for inferring the structure of Bayesian networks from data have become an increasingly popular method for uncovering the direct and indirect influences among variables in complex systems. A Bayesian approach to structure learning uses posterior probabilities to quantify the strength with which the data and prior knowledge jointly support each possible graph feature. Existing Markov Chain Monte Carlo (MCMC) algorithms for estimating these posterior probabilities are slow in mixing and convergence, especially for large networks. We present a novel Markov blanket resampling (MBR) scheme that intermittently reconstructs the Markov blanket of nodes, thus allowing the sampler to more effectively …