Visualization of Decision Trees based on General Line Coordinates to Support Explainable Models

• URL: http://arxiv.org/abs/2205.04035v1
• Date: Mon, 9 May 2022 04:49:29 GMT
• Title: Visualization of Decision Trees based on General Line Coordinates to Support Explainable Models
• Authors: Alex Worland, Sridevi Wagle, Boris Kovalerchuk
• Abstract summary: This paper proposes a new method SPC-DT to visualize the Decision Tree (DT) as interpretable models. In SPC, each n-D point is visualized in a set of shifted pairs of 2-D Cartesian coordinates as a directed graph. It shows: (1) relations between attributes, (2) individual cases relative to the DT structure, (3) data flow in the DT, (4) how tight each split is to thresholds in the DT nodes, and (5) the density of cases in parts of the n-D space.
• Score: 5.276232626689567
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Visualization of Machine Learning (ML) models is an important part of the ML process to enhance the interpretability and prediction accuracy of the ML models. This paper proposes a new method SPC-DT to visualize the Decision Tree (DT) as interpretable models. These methods use a version of General Line Coordinates called Shifted Paired Coordinates (SPC). In SPC, each n-D point is visualized in a set of shifted pairs of 2-D Cartesian coordinates as a directed graph. The new method expands and complements the capabilities of existing methods, to visualize DT models. It shows: (1) relations between attributes, (2) individual cases relative to the DT structure, (3) data flow in the DT, (4) how tight each split is to thresholds in the DT nodes, and (5) the density of cases in parts of the n-D space. This information is important for domain experts for evaluating and improving the DT models, including avoiding overgeneralization and overfitting of models, along with their performance. The benefits of the methods are demonstrated in the case studies, using three real datasets.

Related papers

• Enhancing Generalizability of Representation Learning for Data-Efficient 3D Scene Understanding [50.448520056844885]
  We propose a generative Bayesian network to produce diverse synthetic scenes with real-world patterns. A series of experiments robustly display our method's consistent superiority over existing state-of-the-art pre-training approaches.
  arXiv  Detail & Related papers  (2024-06-17T07:43:53Z)
• Spatiotemporal Implicit Neural Representation as a Generalized Traffic Data Learner [46.866240648471894]
  Spatiotemporal Traffic Data (STTD) measures the complex dynamical behaviors of the multiscale transportation system. We present a novel paradigm to address the STTD learning problem by parameterizing STTD as an implicit neural representation. We validate its effectiveness through extensive experiments in real-world scenarios, showcasing applications from corridor to network scales.
  arXiv  Detail & Related papers  (2024-05-06T06:23:06Z)
• 4DBInfer: A 4D Benchmarking Toolbox for Graph-Centric Predictive Modeling on Relational DBs [67.47600679176963]
  RDBs store vast amounts of rich, informative data spread across interconnected tables. The progress of predictive machine learning models falls behind advances in other domains such as computer vision or natural language processing. We explore a class of baseline models predicated on converting multi-table datasets into graphs. We assemble a diverse collection of large-scale RDB datasets and (ii) coincident predictive tasks.
  arXiv  Detail & Related papers  (2024-04-28T15:04:54Z)
• Towards interpretable-by-design deep learning algorithms [11.154826546951414]
  A proposed framework named I recasts the standard supervised classification problem into a function of similarity to a set of prototypes derived from the training data. We show that one can turn such DL models into conceptually simpler, explainable-through-prototypes ones.
  arXiv  Detail & Related papers  (2023-11-19T18:40:49Z)
• Neural Semantic Surface Maps [52.61017226479506]
  We present an automated technique for computing a map between two genus-zero shapes, which matches semantically corresponding regions to one another. Our approach can generate semantic surface-to-surface maps, eliminating manual annotations or any 3D training data requirement.
  arXiv  Detail & Related papers  (2023-09-09T16:21:56Z)
• Full High-Dimensional Intelligible Learning In 2-D Lossless Visualization Space [7.005458308454871]
  This study explores a new methodology for machine learning classification tasks in 2-D visualization space (2-D ML) It is shown that this is a full machine learning approach that does not require processing n-dimensional data in an abstract n-dimensional space. It enables discovering n-D patterns in 2-D space without loss of n-D information using graph representations of n-D data in 2-D.
  arXiv  Detail & Related papers  (2023-05-29T00:21:56Z)
• Interactive Decision Tree Creation and Enhancement with Complete Visualization for Explainable Modeling [0.0]
  Decision Trees (DTs) are essential in machine learning (ML) because they are used to understand many black box ML models. Two new methods for creation and enhancement with complete visualizing Decision Trees are suggested.
  arXiv  Detail & Related papers  (2023-05-28T23:44:15Z)
• A Model for Multi-View Residual Covariances based on Perspective Deformation [88.21738020902411]
  We derive a model for the covariance of the visual residuals in multi-view SfM, odometry and SLAM setups. We validate our model with synthetic and real data and integrate it into photometric and feature-based Bundle Adjustment.
  arXiv  Detail & Related papers  (2022-02-01T21:21:56Z)
• Contrastive Neighborhood Alignment [81.65103777329874]
  We present Contrastive Neighborhood Alignment (CNA), a manifold learning approach to maintain the topology of learned features. The target model aims to mimic the local structure of the source representation space using a contrastive loss. CNA is illustrated in three scenarios: manifold learning, where the model maintains the local topology of the original data in a dimension-reduced space; model distillation, where a small student model is trained to mimic a larger teacher; and legacy model update, where an older model is replaced by a more powerful one.
  arXiv  Detail & Related papers  (2022-01-06T04:58:31Z)
• Joint Characterization of Spatiotemporal Data Manifolds [0.0]
  Dimensionality reduction (DR) is a type of characterization designed to mitigate the "curse of dimensionality" on high-D signals. Recent years have seen the additional development of a suite of nonlinear DR algorithms, frequently categorized as "manifold learning" Here, we show these three DR approaches can yield complementary information about ST manifold topology.
  arXiv  Detail & Related papers  (2021-08-21T16:42:22Z)
• Mix Dimension in Poincar\'{e} Geometry for 3D Skeleton-based Action Recognition [57.98278794950759]
  Graph Convolutional Networks (GCNs) have already demonstrated their powerful ability to model the irregular data. We present a novel spatial-temporal GCN architecture which is defined via the Poincar'e geometry. We evaluate our method on two current largest scale 3D datasets.
  arXiv  Detail & Related papers  (2020-07-30T18:23:18Z)

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.