Full High-Dimensional Intelligible Learning In 2-D Lossless Visualization Space

• URL: http://arxiv.org/abs/2305.19132v1
• Date: Mon, 29 May 2023 00:21:56 GMT
• Title: Full High-Dimensional Intelligible Learning In 2-D Lossless Visualization Space
• Authors: Boris Kovalerchuk, Hoang Phan
• Abstract summary: 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.
• Score: 7.005458308454871
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This study explores a new methodology for machine learning classification tasks in 2-dimensional visualization space (2-D ML) using Visual knowledge Discovery in lossless General Line Coordinates. 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. Specifically, this study shows that it can be done with static and dynamic In-line Based Coordinates in different modifications, which are a category of General Line Coordinates. Based on these inline coordinates, classification and regression methods were developed. The viability of the strategy was shown by two case studies based on benchmark datasets (Wisconsin Breast Cancer and Page Block Classification datasets). The characteristics of page block classification data led to the development of an algorithm for imbalanced high-resolution data with multiple classes, which exploits the decision trees as a model design facilitator producing a model, which is more general than a decision tree. This work accelerates the ongoing consolidation of an emerging field of full 2-D machine learning and its methodology. Within this methodology the end users can discover models and justify them as self-service. Providing interpretable ML models is another benefit of this approach.

Related papers

• General Line Coordinates in 3D [2.9465623430708905]
  Interpretable interactive visual pattern discovery in 3D visualization is a promising way to advance machine learning. It is conducted in 3D General Line Coordinates (GLC) visualization space, which preserves all n-D information in 3D.
  arXiv  Detail & Related papers  (2024-03-17T17:42:20Z)
• Dual-Perspective Knowledge Enrichment for Semi-Supervised 3D Object Detection [55.210991151015534]
  We present a novel Dual-Perspective Knowledge Enrichment approach named DPKE for semi-supervised 3D object detection. Our DPKE enriches the knowledge of limited training data, particularly unlabeled data, from two perspectives: data-perspective and feature-perspective.
  arXiv  Detail & Related papers  (2024-01-10T08:56:07Z)
• 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)
• Visualization of Decision Trees based on General Line Coordinates to Support Explainable Models [5.276232626689567]
  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.
  arXiv  Detail & Related papers  (2022-05-09T04:49:29Z)
• Interpretable Machine Learning for Self-Service High-Risk Decision-Making [7.005458308454871]
  This paper contributes to interpretable machine learning via visual knowledge discovery in general line coordinates. The concepts of hyperblocks as interpretable dataset units and general line coordinates are combined to create a visual self-service machine learning model.
  arXiv  Detail & Related papers  (2022-05-09T04:37:07Z)
• Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach [80.8446673089281]
  We propose a new learning paradigm with graph representation and learning. Our framework contains two modules: 1) a backbone network (e.g., feedforward neural nets) as a lower model takes features as input and outputs predicted labels; 2) a graph neural network as an upper model learns to extrapolate embeddings for new features via message passing over a feature-data graph built from observed data.
  arXiv  Detail & Related papers  (2021-10-09T09:02:45Z)
• Full interpretable machine learning in 2D with inline coordinates [9.13755431537592]
  It is a full machine learning approach that does not require to deal with n-dimensional data in n-dimensional space. It allows discovering n-D patterns in 2-D space without loss of n-D information using graph representations of n-D data in 2-D. The classification and regression algorithms based on these inline coordinates were introduced.
  arXiv  Detail & Related papers  (2021-06-14T16:21:06Z)
• TSGCNet: Discriminative Geometric Feature Learning with Two-Stream GraphConvolutional Network for 3D Dental Model Segmentation [141.2690520327948]
  We propose a two-stream graph convolutional network (TSGCNet) to learn multi-view information from different geometric attributes. We evaluate our proposed TSGCNet on a real-patient dataset of dental models acquired by 3D intraoral scanners.
  arXiv  Detail & Related papers  (2020-12-26T08:02:56Z)
• SelfVoxeLO: Self-supervised LiDAR Odometry with Voxel-based Deep Neural Networks [81.64530401885476]
  We propose a self-supervised LiDAR odometry method, dubbed SelfVoxeLO, to tackle these two difficulties. Specifically, we propose a 3D convolution network to process the raw LiDAR data directly, which extracts features that better encode the 3D geometric patterns. We evaluate our method's performances on two large-scale datasets, i.e., KITTI and Apollo-SouthBay.
  arXiv  Detail & Related papers  (2020-10-19T09:23:39Z)
• 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)
• Two-Dimensional Semi-Nonnegative Matrix Factorization for Clustering [50.43424130281065]
  We propose a new Semi-Nonnegative Matrix Factorization method for 2-dimensional (2D) data, named TS-NMF. It overcomes the drawback of existing methods that seriously damage the spatial information of the data by converting 2D data to vectors in a preprocessing step.
  arXiv  Detail & Related papers  (2020-05-19T05:54:14Z)

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.