4.5 Article

Approximate algorithms for credal networks with binary variables

期刊

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ijar.2007.09.003

关键词

credal networks; Loopy Belief Propagation; variational methods; 2U algorithm

向作者/读者索取更多资源

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Artificial Intelligence

The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws

Fabio Gagliardi Cozman, Denis Deratani Maua

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2019)

Article Computer Science, Artificial Intelligence

Complexity results for probabilistic answer set programming

Denis Deratani Maua, Fabio Gagliardi Cozman

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2020)

Article Computer Science, Artificial Intelligence

The joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference

Fabio Gagliardi Cozman, Denis Deratani Maua

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2020)

Article Computer Science, Artificial Intelligence

Graphoid properties of concepts of independence for sets of probabilities

Fabio Gagliardi Cozman

Summary: The paper examines various concepts of independence associated with different types of sets of probabilities and evaluates them based on the graphoid properties they satisfy. The analysis focuses on sets of probability measures, discussing versions of epistemic, confirmational, and type-5 independence based on regular conditioning, as well as complete and strong independence. Analogous concepts of independence for sets of full conditional probabilities, sets of lexicographic probabilities, and sets of desirable gambles are also discussed.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2021)

Article Computer Science, Artificial Intelligence

Some thoughts on knowledge-enhanced machine learning

Fabio Gagliardi Cozman, Hugo Neri Munhoz

Summary: This paper discusses how to use theoretical insights and practical tools from knowledge representation and reasoning to enhance machine learning, and when it is worthwhile to do so. It focuses on the knowledge representation and reasoning side of knowledge-enhanced machine learning, presenting case studies including probabilistic languages, explanations for embeddings, and an explainable version of the Winograd Challenge.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2021)

Article Neurosciences

Gray matter volumetric correlates of dimensional impulsivity traits in children: Sex differences and heritability

Yu Chen, Jaime S. Ide, Clara S. Li, Shefali Chaudhary, Thang M. Le, Wuyi Wang, Simon Zhornitsky, Sheng Zhang, Chiang-Shan R. Li

Summary: In this study, voxel-based morphometry analysis was used to investigate the cerebral volumetric correlates of impulsivity in a large sample of adolescent subjects. The results showed that different dimensions of impulsivity were associated with varying patterns of gray matter volumes, and there were also sex differences and genetic influences on these correlations.

HUMAN BRAIN MAPPING (2022)

Article Engineering, Marine

Sea state estimation based on the motion data of a moored FPSO using neural networks: An evaluation with multiple draft conditions

Gustavo A. Bisinotto, Joao V. Sparano, Alexandre N. Simos, Fabio G. Cozman, Marcos D. Ferreira, Eduardo A. Tannuri

Summary: This paper presents a study on motion-based wave estimation using neural networks. The performance of the data-driven inference system with motion data from different draft conditions is evaluated. The results show good agreement between estimations and reference values, but there are limitations when it comes to less frequent sea conditions. Additionally, the analysis of the estimation models' robustness with respect to draft variation demonstrates small average deviations compared to expected values.

OCEAN ENGINEERING (2023)

Proceedings Paper Computer Science, Artificial Intelligence

Augmenting a Physics-Informed Neural Network for the 2D Burgers Equation by Addition of Solution Data Points

Marlon S. Mathias, Wesley P. de Almeida, Jefferson F. Coelho, Lucas P. de Freitas, Felipe M. Moreno, Caio F. D. Netto, Fabio G. Cozman, Anna Helena Reali Costa, Eduardo A. Tannuri, Edson S. Gomi, Marcelo Dottori

Summary: In this paper, we implement a Physics-Informed Neural Network (PINN) to solve the two-dimensional Burgers equations. By comparing PINNs trained with different amounts of governing equation evaluation points and known solution points, we find that models trained with the governing equations exhibit better overall observance of the underlying physics. We also investigate the impact of changing the number of each type of point on the resulting models. Finally, we argue that adding the governing equations during training can improve the overall performance of the model, particularly when the number of known solution points is limited.

INTELLIGENT SYSTEMS, PT II (2022)

Proceedings Paper Computer Science, Artificial Intelligence

To Answer or Not to Answer? Filtering Questions for QA Systems

Paulo Pirozelli, Anarosa A. F. Brandao, Sarajane M. Peres, Fabio G. Cozman

Summary: This paper explores dual system architectures to improve the quality of answers generated by QA systems by filtering questions. Two experiments show that using classification and regression models to filter questions can enhance the accuracy of the answers.

INTELLIGENT SYSTEMS, PT II (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Integrating Question Answering and Text-to-SQL in Portuguese

Marcos Menon Jose, Marcelo Archanjo Jose, Denis Deratani Maua, Fabio Gagliardi Cozman

Summary: Deep learning transformers have greatly improved systems that automatically answer questions in natural language. This study proposes an architecture that integrates different modules to answer two types of queries and validates the modular question answering strategy through experiments conducted in the Portuguese language.

COMPUTATIONAL PROCESSING OF THE PORTUGUESE LANGUAGE, PROPOR 2022 (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Measuring Unfairness Through Game-Theoretic Interpretability

Juliana Cesaro, Fabio Gagliardi Cozman

MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2019, PT I (2020)

Article Computer Science, Artificial Intelligence

Thirty years of credal networks: Specification, algorithms and complexity

Denis Deratani Maua, Fabio Gagliardi Cozman

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2020)

Article Computer Science, Information Systems

Navigation in Restricted Channels Under Environmental Conditions: Fast-Time Simulation by Asynchronous Deep Reinforcement Learning

Jose Amendola, Lucas S. Miura, Anna H. Reali Costa, Fabio G. Cozman, Eduardo Aoun Tannuri

IEEE ACCESS (2020)

Article Computer Science, Artificial Intelligence

The role of experts in the public perception of risk of artificial intelligence

Hugo Neri, Fabio Cozman

AI & SOCIETY (2020)

Proceedings Paper Computer Science, Artificial Intelligence

Natural Language Explanations of Classifier Behavior

Rodrigo Monteiro de Aquino, Fabio Gagliardi Cozman

2019 IEEE SECOND INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND KNOWLEDGE ENGINEERING (AIKE) (2019)

Article Computer Science, Artificial Intelligence

Change in quantitative bipolar argumentation: Sufficient, necessary, and counterfactual explanations

Timotheus Kampik, Kristijonas Cyras, Jose Ruiz Alarcon

Summary: This paper presents a formal approach to explaining changes in inference in Quantitative Bipolar Argumentation Frameworks (QBAFs). The approach traces the causes of strength inconsistencies and provides explanations for them.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

A direct approach to representing algebraic domains by formal contexts

Xiangnan Zhou, Longchun Wang, Qingguo Li

Summary: This paper aims to establish a closer connection between domain theory and Formal Concept Analysis (FCA) by introducing the concept of an optimized concept for a formal context. With the utilization of optimized concepts, it is demonstrated that the class of formal contexts directly corresponds to algebraic domains. Additionally, two subclasses of formal contexts are identified to characterize algebraic L-domains and Scott domains. An application is presented to address the open problem of reconstructing bounded complete continuous domains using attribute continuous contexts, and the presentation of algebraic domains is extended to a categorical equivalence.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Exploiting fuzzy rough entropy to detect anomalies

Sihan Wang, Zhong Yuan, Chuan Luo, Hongmei Chen, Dezhong Peng

Summary: Anomaly detection is widely used in various fields, but most current methods only work for specific data and ignore uncertain information such as fuzziness. This paper proposes an anomaly detection algorithm based on fuzzy rough entropy, which effectively addresses the similarity between high-dimensional objects using distance and correlation measures. The algorithm is compared and analyzed with mainstream anomaly detection algorithms on publicly available datasets, showing superior performance and flexibility.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality

Mario Alviano, Francesco Bartoli, Marco Botta, Roberto Esposito, Laura Giordano, Daniele Theseider Dupre

Summary: This paper investigates the relationships between a multipreferential semantics in defeasible reasoning and a multilayer neural network model. Weighted knowledge bases are considered for a simple description logic with typicality under a concept-wise multipreference semantics. The semantics is used to interpret MultiLayer Perceptrons (MLPs) preferentially. Model checking and entailment based approach are employed in verifying conditional properties of MLPs.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Polyadic relational concept analysis

Bazin Alexandre, Galasso Jessie, Kahn Giacomo

Summary: Formal concept analysis is a mathematical framework that represents the information in binary object-attribute datasets using a lattice of formal concepts. It has been extended to handle more complex data types, such as relational data and n-ary relations. This paper presents a framework for polyadic relational concept analysis, which extends relational concept analysis to handle relational datasets consisting of n-ary relations.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Verified propagation of imprecise probabilities in non-linear ODEs

Ander Gray, Marcelo Forets, Christian Schilling, Scott Ferson, Luis Benet

Summary: The presented method combines reachability analysis and probability bounds analysis to handle imprecisely known random variables. It can rigorously compute the temporal evolution of p-boxes and provide interval probabilities for formal verification problems. The method does not impose strict constraints on the input probability distribution or p-box and can handle multivariate p-boxes with a consonant approximation method.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

How to choose a completion method for pairwise comparison matrices with missing entries: An axiomatic result

Laszlo Csato

Summary: This paper studies a special type of incomplete pairwise comparison matrices and proposes a new method to determine the missing elements without violating the ordinal property.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)