Bayesian Networks for Named Entity Prediction in Programming Community Question Answering

• URL: http://arxiv.org/abs/2302.13253v1
• Date: Sun, 26 Feb 2023 07:26:36 GMT
• Title: Bayesian Networks for Named Entity Prediction in Programming Community Question Answering
• Authors: Alexey Gorbatovski and Sergey Kovalchuk
• Abstract summary: We propose a new approach for natural language processing using Bayesian networks to predict and analyze the context. We compare the Bayesian networks with different score metrics, such as the BIC, BDeu, K2 and Chow-Liu trees. In addition, we examine the visualization of directed acyclic graphs to analyze semantic relationships.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Within this study, we propose a new approach for natural language processing using Bayesian networks to predict and analyze the context and how this approach can be applied to the Community Question Answering domain. We discuss how Bayesian networks can detect semantic relationships and dependencies between entities, and this is connected to different score-based approaches of structure-learning. We compared the Bayesian networks with different score metrics, such as the BIC, BDeu, K2 and Chow-Liu trees. Our proposed approach out-performs the baseline model at the precision metric. We also discuss the influence of penalty terms on the structure of Bayesian networks and how they can be used to analyze the relationships between entities. In addition, we examine the visualization of directed acyclic graphs to analyze semantic relationships. The article further identifies issues with detecting certain semantic classes that are separated in the structure of directed acyclic graphs. Finally, we evaluate potential improvements for the Bayesian network approach.

Related papers

• On Discprecncies between Perturbation Evaluations of Graph Neural Network Attributions [49.8110352174327]
  We assess attribution methods from a perspective not previously explored in the graph domain: retraining. The core idea is to retrain the network on important (or not important) relationships as identified by the attributions. We run our analysis on four state-of-the-art GNN attribution methods and five synthetic and real-world graph classification datasets.
  arXiv  Detail & Related papers  (2024-01-01T02:03:35Z)
• SEM-GAT: Explainable Semantic Pose Estimation using Learned Graph Attention [10.883346969896621]
  This paper proposes a Graph Neural Network(GNN)-based method for exploiting semantics and local geometry to guide the identification of reliable pointcloud registration candidates. Semantic and morphological features of the environment serve as key reference points for registration, enabling accurate lidar-based pose estimation. We test our method on the KITTI odometry dataset, achieving competitive accuracy compared to benchmark methods and a higher track smoothness while relying on significantly fewer network parameters.
  arXiv  Detail & Related papers  (2023-08-07T16:43:46Z)
• Parallel Reasoning Network for Human-Object Interaction Detection [53.422076419484945]
  We propose a new transformer-based method named Parallel Reasoning Network(PR-Net) PR-Net constructs two independent predictors for instance-level localization and relation-level understanding. Our PR-Net has achieved competitive results on HICO-DET and V-COCO benchmarks.
  arXiv  Detail & Related papers  (2023-01-09T17:00:34Z)
• Bayesian Structure Learning with Generative Flow Networks [85.84396514570373]
  In Bayesian structure learning, we are interested in inferring a distribution over the directed acyclic graph (DAG) from data. Recently, a class of probabilistic models, called Generative Flow Networks (GFlowNets), have been introduced as a general framework for generative modeling. We show that our approach, called DAG-GFlowNet, provides an accurate approximation of the posterior over DAGs.
  arXiv  Detail & Related papers  (2022-02-28T15:53:10Z)
• A Coupled CP Decomposition for Principal Components Analysis of Symmetric Networks [11.988825533369686]
  We propose a principal components analysis (PCA) framework for sequence network data. We derive efficient algorithms for computing our proposed "Coupled CP" decomposition. We demonstrate the effectiveness of our proposal on simulated data and on examples from political science and financial economics.
  arXiv  Detail & Related papers  (2022-02-09T20:52:19Z)
• NOTMAD: Estimating Bayesian Networks with Sample-Specific Structures and Parameters [70.55488722439239]
  We present NOTMAD, which learns to mix archetypal networks according to sample context. We demonstrate the utility of NOTMAD and sample-specific network inference through analysis and experiments, including patient-specific gene expression networks.
  arXiv  Detail & Related papers  (2021-11-01T17:17:34Z)
• Oil and Gas Reservoirs Parameters Analysis Using Mixed Learning of Bayesian Networks [0.0]
  The method is based on extended algorithm MixLearn@BN for structural learning of Bayesian networks. The method was applied to the database of more than a thousand petroleum reservoirs across the globe.
  arXiv  Detail & Related papers  (2021-03-02T15:27:49Z)
• SOSD-Net: Joint Semantic Object Segmentation and Depth Estimation from Monocular images [94.36401543589523]
  We introduce the concept of semantic objectness to exploit the geometric relationship of these two tasks. We then propose a Semantic Object and Depth Estimation Network (SOSD-Net) based on the objectness assumption. To the best of our knowledge, SOSD-Net is the first network that exploits the geometry constraint for simultaneous monocular depth estimation and semantic segmentation.
  arXiv  Detail & Related papers  (2021-01-19T02:41:03Z)
• A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations [3.81379858342235]
  A Bayesian network can be learned from data using the well-known score-and-search approach. We show how to extend the score-and-search approach to the important and widely useful case of noisy-OR relations.
  arXiv  Detail & Related papers  (2020-11-03T03:20:44Z)
• Bayesian Topological Learning for Classifying the Structure of Biological Networks [1.644043499620662]
  Actin cytoskeleton networks generate local topological signatures due to the natural variations in the number, size, and shape of holes of the networks. Persistent homology is a method that explores these topological properties of data and summarizes them as persistence diagrams. We implement a Bayes factor algorithm to classify the actin filament networks and benchmark it against several state-of-the-art classification methods.
  arXiv  Detail & Related papers  (2020-09-24T22:43:03Z)
• Weakly-Supervised Semantic Segmentation by Iterative Affinity Learning [86.45526827323954]
  Weakly-supervised semantic segmentation is a challenging task as no pixel-wise label information is provided for training. We propose an iterative algorithm to learn such pairwise relations. We show that the proposed algorithm performs favorably against the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-02-19T10:32:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.