Feature Clock: High-Dimensional Effects in Two-Dimensional Plots

• URL: http://arxiv.org/abs/2408.01294v2
• Date: Tue, 6 Aug 2024 12:24:07 GMT
• Title: Feature Clock: High-Dimensional Effects in Two-Dimensional Plots
• Authors: Olga Ovcharenko, Rita Sevastjanova, Valentina Boeva,
• Abstract summary: Feature Clock provides a novel approach that eliminates the need to inspect these k plots to grasp the influence of original features on the data depicted structure in two dimensions. It enhances the explainability and compactness of visualizations of embedded data and is available in an open-source Python library.
• Score: 3.5268517409992377
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Humans struggle to perceive and interpret high-dimensional data. Therefore, high-dimensional data are often projected into two dimensions for visualization. Many applications benefit from complex nonlinear dimensionality reduction techniques, but the effects of individual high-dimensional features are hard to explain in the two-dimensional space. Most visualization solutions use multiple two-dimensional plots, each showing the effect of one high-dimensional feature in two dimensions; this approach creates a need for a visual inspection of k plots for a k-dimensional input space. Our solution, Feature Clock, provides a novel approach that eliminates the need to inspect these k plots to grasp the influence of original features on the data structure depicted in two dimensions. Feature Clock enhances the explainability and compactness of visualizations of embedded data and is available in an open-source Python library.

Related papers

• SPreV [0.0]
  SPREV is a novel dimensionality reduction technique developed to address the challenges of reducing dimensions and visualizing labeled datasets. Its distinctive integration of geometric principles, adapted for discrete computational environments, makes it an indispensable tool in the modern data science toolkit.
  arXiv  Detail & Related papers  (2025-04-14T18:20:47Z)
• Noisy Data Visualization using Functional Data Analysis [14.255424476694946]
  We propose a new data visualization method called Functional Information Geometry (FIG) for dynamical processes. We experimentally demonstrate that the resulting method outperforms a variant of EIG designed for visualization. We then use our method to visualize EEG brain measurements of sleep activity.
  arXiv  Detail & Related papers  (2024-06-05T15:53:25Z)
• Uncovering Temporal Patterns in Visualizations of High-Dimensional Data [0.0]
  A key approach to exploring such data is dimensionality reduction, which embeds high-dimensional data in two dimensions to enable visual exploration. We propose a formal extension to existing dimensionality reduction methods that incorporates two temporal loss terms that explicitly highlight temporal progression in the embedded visualizations.
  arXiv  Detail & Related papers  (2024-03-27T22:26:50Z)
• N2F2: Hierarchical Scene Understanding with Nested Neural Feature Fields [112.02885337510716]
  Nested Neural Feature Fields (N2F2) is a novel approach that employs hierarchical supervision to learn a single feature field. We leverage a 2D class-agnostic segmentation model to provide semantically meaningful pixel groupings at arbitrary scales in the image space. Our approach outperforms the state-of-the-art feature field distillation methods on tasks such as open-vocabulary 3D segmentation and localization.
  arXiv  Detail & Related papers  (2024-03-16T18:50:44Z)
• Parametric Depth Based Feature Representation Learning for Object Detection and Segmentation in Bird's Eye View [44.78243406441798]
  This paper focuses on leveraging geometry information, such as depth, to model such feature transformation. We first lift the 2D image features to the 3D space defined for the ego vehicle via a predicted parametric depth distribution for each pixel in each view. We then aggregate the 3D feature volume based on the 3D space occupancy derived from depth to the BEV frame.
  arXiv  Detail & Related papers  (2023-07-09T06:07:22Z)
• ShaRP: Shape-Regularized Multidimensional Projections [71.30697308446064]
  We present a novel projection technique - ShaRP - that provides users explicit control over the visual signature of the created scatterplot. ShaRP scales well with dimensionality and dataset size, and generically handles any quantitative dataset.
  arXiv  Detail & Related papers  (2023-06-01T11:16:58Z)
• A Lite Fireworks Algorithm with Fractal Dimension Constraint for Feature Selection [4.526526943108398]
  We propose a Lite Fireworks Algorithm with Fractal Dimension constraint for feature selection (LFWA+FD) "LFWA+FD" focuses on searching the ideal feature subset by simplifying the fireworks algorithm and constraining the dimensionality of selected features by fractal dimensionality. The proposed method can effectively select a subset of features useful for model inference and remove a large amount of noise noise present in the original data to improve the performance.
  arXiv  Detail & Related papers  (2023-03-09T01:52:54Z)
• In search of the most efficient and memory-saving visualization of high dimensional data [0.0]
  We argue that the visualization of multidimensional data is well approximated of two-directed embedding of undimensional nearest-neighbor graphs. Existing reduction methods are too slow and do not allow interactive manipulation. We show that high-quality embeddings are produced with minimal time and memory complexity.
  arXiv  Detail & Related papers  (2023-02-27T20:56:13Z)
• UnProjection: Leveraging Inverse-Projections for Visual Analytics of High-Dimensional Data [63.74032987144699]
  We present NNInv, a deep learning technique with the ability to approximate the inverse of any projection or mapping. NNInv learns to reconstruct high-dimensional data from any arbitrary point on a 2D projection space, giving users the ability to interact with the learned high-dimensional representation in a visual analytics system.
  arXiv  Detail & Related papers  (2021-11-02T17:11:57Z)
• Spatial-Temporal Correlation and Topology Learning for Person Re-Identification in Videos [78.45050529204701]
  We propose a novel framework to pursue discriminative and robust representation by modeling cross-scale spatial-temporal correlation. CTL utilizes a CNN backbone and a key-points estimator to extract semantic local features from human body. It explores a context-reinforced topology to construct multi-scale graphs by considering both global contextual information and physical connections of human body.
  arXiv  Detail & Related papers  (2021-04-15T14:32:12Z)
• Multi-point dimensionality reduction to improve projection layout reliability [77.34726150561087]
  In ordinary Dimensionality Reduction (DR), each data instance in an m-dimensional space (original space) is mapped to one point in a d-dimensional space (visual space) Our solution, named Red Gray Plus, is built upon and extends a combination of ordinary DR and graph drawing techniques.
  arXiv  Detail & Related papers  (2021-01-15T17:17:02Z)
• Implicit Functions in Feature Space for 3D Shape Reconstruction and Completion [53.885984328273686]
  Implicit Feature Networks (IF-Nets) deliver continuous outputs, can handle multiple topologies, and complete shapes for missing or sparse input data. IF-Nets clearly outperform prior work in 3D object reconstruction in ShapeNet, and obtain significantly more accurate 3D human reconstructions.
  arXiv  Detail & Related papers  (2020-03-03T11:14:29Z)

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.