Visual Exploration of Machine Learning Model Behavior with Hierarchical
Surrogate Rule Sets
- URL: http://arxiv.org/abs/2201.07724v1
- Date: Wed, 19 Jan 2022 17:03:35 GMT
- Title: Visual Exploration of Machine Learning Model Behavior with Hierarchical
Surrogate Rule Sets
- Authors: Jun Yuan, Brian Barr, Kyle Overton, Enrico Bertini
- Abstract summary: We present Hierarchical Surrogate Rules (HSR), an algorithm that generates hierarchical rules based on user-defined parameters.
We also contribute SuRE, a visual analytics (VA) system that integrates HSR and interactive surrogate rule visualizations.
We evaluate the algorithm in terms of parameter sensitivity, time performance, and comparison with surrogate decision trees.
- Score: 13.94542147252982
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: One of the potential solutions for model interpretation is to train a
surrogate model: a more transparent model that approximates the behavior of the
model to be explained. Typically, classification rules or decision trees are
used due to the intelligibility of their logic-based expressions. However,
decision trees can grow too deep and rule sets can become too large to
approximate a complex model. Unlike paths on a decision tree that must share
ancestor nodes (conditions), rules are more flexible. However, the unstructured
visual representation of rules makes it hard to make inferences across rules.
To address these issues, we present a workflow that includes novel algorithmic
and interactive solutions. First, we present Hierarchical Surrogate Rules
(HSR), an algorithm that generates hierarchical rules based on user-defined
parameters. We also contribute SuRE, a visual analytics (VA) system that
integrates HSR and interactive surrogate rule visualizations. Particularly, we
present a novel feature-aligned tree to overcome the shortcomings of existing
rule visualizations. We evaluate the algorithm in terms of parameter
sensitivity, time performance, and comparison with surrogate decision trees and
find that it scales reasonably well and outperforms decision trees in many
respects. We also evaluate the visualization and the VA system by a usability
study with 24 volunteers and an observational study with 7 domain experts. Our
investigation shows that the participants can use feature-aligned trees to
perform non-trivial tasks with very high accuracy. We also discuss many
interesting observations that can be useful for future research on designing
effective rule-based VA systems.
Related papers
- Optimized Feature Generation for Tabular Data via LLMs with Decision Tree Reasoning [53.241569810013836]
We propose a new framework based on large language models (LLMs) and decision Tree reasoning (OCTree)
Our key idea is to leverage LLMs' reasoning capabilities to find good feature generation rules without manually specifying the search space.
Our empirical results demonstrate that this simple framework consistently enhances the performance of various prediction models.
arXiv Detail & Related papers (2024-06-12T08:31:34Z) - Learning accurate and interpretable decision trees [27.203303726977616]
We develop approaches to design decision tree learning algorithms given repeated access to data from the same domain.
We study the sample complexity of tuning prior parameters in Bayesian decision tree learning, and extend our results to decision tree regression.
We also study the interpretability of the learned decision trees and introduce a data-driven approach for optimizing the explainability versus accuracy trade-off using decision trees.
arXiv Detail & Related papers (2024-05-24T20:10:10Z) - ViTree: Single-path Neural Tree for Step-wise Interpretable Fine-grained
Visual Categorization [56.37520969273242]
We introduce ViTree, a novel approach for fine-grained visual categorization.
By traversing the tree paths, ViTree effectively selects patches from transformer-processed features to highlight informative local regions.
This patch and path selectivity enhances model interpretability of ViTree, enabling better insights into the model's inner workings.
arXiv Detail & Related papers (2024-01-30T14:32:25Z) - Greedy Algorithm for Inference of Decision Trees from Decision Rule
Systems [0.0]
Decision trees and decision rule systems play important roles as attributes, knowledge representation tools, and algorithms.
In this paper, we consider the inverse transformation problem, which is not so simple.
Instead of constructing an entire decision tree, our study focuses on a greedy time algorithm that simulates the operation of a decision tree on a given attribute.
arXiv Detail & Related papers (2024-01-08T09:28:55Z) - DeforestVis: Behavior Analysis of Machine Learning Models with Surrogate Decision Stumps [46.58231605323107]
We propose DeforestVis, a visual analytics tool that offers summarization of the behaviour of complex ML models.
DeforestVis helps users to explore the complexity versus fidelity trade-off by incrementally generating more stumps.
We show the applicability and usefulness of DeforestVis with two use cases and expert interviews with data analysts and model developers.
arXiv Detail & Related papers (2023-03-31T21:17:15Z) - Unboxing Tree Ensembles for interpretability: a hierarchical
visualization tool and a multivariate optimal re-built tree [0.34530027457862006]
We develop an interpretable representation of a tree-ensemble model that can provide valuable insights into its behavior.
The proposed model is effective in yielding a shallow interpretable tree approxing the tree-ensemble decision function.
arXiv Detail & Related papers (2023-02-15T10:43:31Z) - Unsupervised Knowledge Graph Alignment by Probabilistic Reasoning and
Semantic Embedding [22.123001954919893]
We propose an iterative framework named PRASE which is based on probabilistic reasoning and semantic embedding.
The PRASE framework is compatible with different embedding-based models, and our experiments on multiple datasets have demonstrated its state-of-the-art performance.
arXiv Detail & Related papers (2021-05-12T11:27:46Z) - Probabilistic Case-based Reasoning for Open-World Knowledge Graph
Completion [59.549664231655726]
A case-based reasoning (CBR) system solves a new problem by retrieving cases' that are similar to the given problem.
In this paper, we demonstrate that such a system is achievable for reasoning in knowledge-bases (KBs)
Our approach predicts attributes for an entity by gathering reasoning paths from similar entities in the KB.
arXiv Detail & Related papers (2020-10-07T17:48:12Z) - MurTree: Optimal Classification Trees via Dynamic Programming and Search [61.817059565926336]
We present a novel algorithm for learning optimal classification trees based on dynamic programming and search.
Our approach uses only a fraction of the time required by the state-of-the-art and can handle datasets with tens of thousands of instances.
arXiv Detail & Related papers (2020-07-24T17:06:55Z) - Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies [76.83991682238666]
Branch and Bound (B&B) is the exact tree search method typically used to solve Mixed-Integer Linear Programming problems (MILPs)
We propose a novel imitation learning framework, and introduce new input features and architectures to represent branching.
arXiv Detail & Related papers (2020-02-12T17:43:23Z)
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.