Decision Predicate Graphs: Enhancing Interpretability in Tree Ensembles

• URL: http://arxiv.org/abs/2404.02942v1
• Date: Wed, 3 Apr 2024 12:38:12 GMT
• Title: Decision Predicate Graphs: Enhancing Interpretability in Tree Ensembles
• Abstract summary: Decision Predicate Graph (DPG) is a graph structure that captures the tree-based ensemble model and learned dataset details. DPG offers additional quantitative insights into the model, complementing visualisation techniques, expanding the problem space descriptions. Empirical experiments demonstrate the potential of DPG in addressing traditional benchmarks and complex classification scenarios.
• Score: 1.6021728114882514
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Understanding the decisions of tree-based ensembles and their relationships is pivotal for machine learning model interpretation. Recent attempts to mitigate the human-in-the-loop interpretation challenge have explored the extraction of the decision structure underlying the model taking advantage of graph simplification and path emphasis. However, while these efforts enhance the visualisation experience, they may either result in a visually complex representation or compromise the interpretability of the original ensemble model. In addressing this challenge, especially in complex scenarios, we introduce the Decision Predicate Graph (DPG) as a model-agnostic tool to provide a global interpretation of the model. DPG is a graph structure that captures the tree-based ensemble model and learned dataset details, preserving the relations among features, logical decisions, and predictions towards emphasising insightful points. Leveraging well-known graph theory concepts, such as the notions of centrality and community, DPG offers additional quantitative insights into the model, complementing visualisation techniques, expanding the problem space descriptions, and offering diverse possibilities for extensions. Empirical experiments demonstrate the potential of DPG in addressing traditional benchmarks and complex classification scenarios.

Related papers

• U-CECE: A Universal Multi-Resolution Framework for Conceptual Counterfactual Explanations [12.949562489002304]
  U-CECE is a unified, model-agnostic multi-resolution framework for conceptual counterfactual explanations.<n>It spans three levels of expressivity: atomic concepts for broad explanations, relational sets-of-sets for simple interactions, and structural graphs for full semantic structure.
  arXiv  Detail & Related papers  (2026-04-09T14:30:00Z)
• Enhancing Explainability of Graph Neural Networks Through Conceptual and Structural Analyses and Their Extensions [0.9645196221785692]
  Graph Neural Networks (GNNs) have become a powerful tool for modeling and analyzing data with graph structures.<n>Current Explainable AI (XAI) methods struggle to untangle the intricate relationships and interactions within graphs.<n>This thesis seeks to develop a novel XAI framework tailored for graph-based machine learning.
  arXiv  Detail & Related papers  (2025-12-09T08:13:31Z)
• Learning Decision Trees as Amortized Structure Inference [59.65621207449269]
  We propose a hybrid amortized structure inference approach to learn predictive decision tree ensembles given data. We show that our approach, DT-GFN, outperforms state-of-the-art decision tree and deep learning methods on standard classification benchmarks.
  arXiv  Detail & Related papers  (2025-03-10T07:05:07Z)
• Generative Risk Minimization for Out-of-Distribution Generalization on Graphs [71.48583448654522]
  We propose an innovative framework, named Generative Risk Minimization (GRM), designed to generate an invariant subgraph for each input graph to be classified, instead of extraction. We conduct extensive experiments across a variety of real-world graph datasets for both node-level and graph-level OOD generalization.
  arXiv  Detail & Related papers  (2025-02-11T21:24:13Z)
• Towards Graph Foundation Models: The Perspective of Zero-shot Reasoning on Knowledge Graphs [14.392577069212292]
  We introduce SCORE, a unified graph reasoning framework that effectively generalizes diverse graph tasks using zero-shot learning. We evaluate SCORE using 38 diverse graph datasets, covering node-level, link-level, and graph-level tasks across multiple domains.
  arXiv  Detail & Related papers  (2024-10-16T14:26:08Z)
• Introducing Diminutive Causal Structure into Graph Representation Learning [19.132025125620274]
  We introduce a novel method that enables Graph Neural Networks (GNNs) to glean insights from specialized diminutive causal structures. Our method specifically extracts causal knowledge from the model representation of these diminutive causal structures.
  arXiv  Detail & Related papers  (2024-06-13T00:18:20Z)
• Structure Your Data: Towards Semantic Graph Counterfactuals [1.8817715864806608]
  Counterfactual explanations (CEs) based on concepts are explanations that consider alternative scenarios to understand which high-level semantic features contributed to model predictions. In this work, we propose CEs based on the semantic graphs accompanying input data to achieve more descriptive, accurate, and human-aligned explanations.
  arXiv  Detail & Related papers  (2024-03-11T08:40:37Z)
• Factorized Explainer for Graph Neural Networks [7.382632811417645]
  Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. Post-hoc instance-level explanation methods have been proposed to understand GNN predictions. We introduce a novel factorized explanation model with theoretical performance guarantees.
  arXiv  Detail & Related papers  (2023-12-09T15:29:45Z)
• PGODE: Towards High-quality System Dynamics Modeling [40.76121531452706]
  This paper studies the problem of modeling multi-agent dynamical systems, where agents could interact mutually to influence their behaviors. Recent research predominantly uses geometric graphs to depict these mutual interactions, which are then captured by graph neural networks (GNNs) We propose a new approach named Prototypical Graph ODE to address the problem.
  arXiv  Detail & Related papers  (2023-11-11T12:04:47Z)
• A Comprehensive Study on Knowledge Graph Embedding over Relational Patterns Based on Rule Learning [49.09125100268454]
  Knowledge Graph Embedding (KGE) has proven to be an effective approach to solving the Knowledge Completion Graph (KGC) task. Relational patterns are an important factor in the performance of KGE models. We introduce a training-free method to enhance KGE models' performance over various relational patterns.
  arXiv  Detail & Related papers  (2023-08-15T17:30:57Z)
• DEGREE: Decomposition Based Explanation For Graph Neural Networks [55.38873296761104]
  We propose DEGREE to provide a faithful explanation for GNN predictions. By decomposing the information generation and aggregation mechanism of GNNs, DEGREE allows tracking the contributions of specific components of the input graph to the final prediction. We also design a subgraph level interpretation algorithm to reveal complex interactions between graph nodes that are overlooked by previous methods.
  arXiv  Detail & Related papers  (2023-05-22T10:29:52Z)
• Towards Explanation for Unsupervised Graph-Level Representation Learning [108.31036962735911]
  Existing explanation methods focus on the supervised settings, eg, node classification and graph classification, while the explanation for unsupervised graph-level representation learning is still unexplored. In this paper, we advance the Information Bottleneck principle (IB) to tackle the proposed explanation problem for unsupervised graph representations, which leads to a novel principle, textitUnsupervised Subgraph Information Bottleneck (USIB) We also theoretically analyze the connection between graph representations and explanatory subgraphs on the label space, which reveals that the robustness of representations benefit the fidelity of explanatory subgraphs.
  arXiv  Detail & Related papers  (2022-05-20T02:50:15Z)
• Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised Node Classification [59.06717774425588]
  We propose the Explicit Pairwise Factorized Graph Neural Network (EPFGNN), which models the whole graph as a partially observed Markov Random Field. It contains explicit pairwise factors to model output-output relations and uses a GNN backbone to model input-output relations. We conduct experiments on various datasets, which shows that our model can effectively improve the performance for semi-supervised node classification on graphs.
  arXiv  Detail & Related papers  (2021-07-27T19:47:53Z)
• GraphSVX: Shapley Value Explanations for Graph Neural Networks [81.83769974301995]
  Graph Neural Networks (GNNs) achieve significant performance for various learning tasks on geometric data. In this paper, we propose a unified framework satisfied by most existing GNN explainers. We introduce GraphSVX, a post hoc local model-agnostic explanation method specifically designed for GNNs.
  arXiv  Detail & Related papers  (2021-04-18T10:40:37Z)
• Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classification [50.83222170524406]
  We study the intrinsic difficulty in graph classification under the unified concept of resolution dilemmas'' We propose SLIM'', an inductive neural network model for Structural Landmarking and Interaction Modelling.
  arXiv  Detail & Related papers  (2020-06-29T01:01:42Z)

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.