Exploring Multi-dimensional Data via Subset Embedding
- URL: http://arxiv.org/abs/2104.11867v1
- Date: Sat, 24 Apr 2021 03:08:08 GMT
- Title: Exploring Multi-dimensional Data via Subset Embedding
- Authors: Peng Xie, Wenyuan Tao, Jie Li, Wentao Huang, Siming Chen
- Abstract summary: We propose a visual analytics approach to exploring subset patterns.
The core of the approach is a subset embedding network (SEN) that represents a group of subsets as uniformly-formatted embeddings.
The design enables to handle arbitrary subsets and capture the similarity of subsets on single features.
- Score: 13.092303047029311
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Multi-dimensional data exploration is a classic research topic in
visualization. Most existing approaches are designed for identifying record
patterns in dimensional space or subspace. In this paper, we propose a visual
analytics approach to exploring subset patterns. The core of the approach is a
subset embedding network (SEN) that represents a group of subsets as
uniformly-formatted embeddings. We implement the SEN as multiple subnets with
separate loss functions. The design enables to handle arbitrary subsets and
capture the similarity of subsets on single features, thus achieving accurate
pattern exploration, which in most cases is searching for subsets having
similar values on few features. Moreover, each subnet is a fully-connected
neural network with one hidden layer. The simple structure brings high training
efficiency. We integrate the SEN into a visualization system that achieves a
3-step workflow. Specifically, analysts (1) partition the given dataset into
subsets, (2) select portions in a projected latent space created using the SEN,
and (3) determine the existence of patterns within selected subsets. Generally,
the system combines visualizations, interactions, automatic methods, and
quantitative measures to balance the exploration flexibility and operation
efficiency, and improve the interpretability and faithfulness of the identified
patterns. Case studies and quantitative experiments on multiple open datasets
demonstrate the general applicability and effectiveness of our approach.
Related papers
- Enhancing Neural Subset Selection: Integrating Background Information into Set Representations [53.15923939406772]
We show that when the target value is conditioned on both the input set and subset, it is essential to incorporate an textitinvariant sufficient statistic of the superset into the subset of interest.
This ensures that the output value remains invariant to permutations of the subset and its corresponding superset, enabling identification of the specific superset from which the subset originated.
arXiv Detail & Related papers (2024-02-05T16:09:35Z) - Lidar Panoptic Segmentation and Tracking without Bells and Whistles [48.078270195629415]
We propose a detection-centric network for lidar segmentation and tracking.
One of the core components of our network is the object instance detection branch.
We evaluate our method on several 3D/4D LPS benchmarks and observe that our model establishes a new state-of-the-art among open-sourced models.
arXiv Detail & Related papers (2023-10-19T04:44:43Z) - infoVerse: A Universal Framework for Dataset Characterization with
Multidimensional Meta-information [68.76707843019886]
infoVerse is a universal framework for dataset characterization.
infoVerse captures multidimensional characteristics of datasets by incorporating various model-driven meta-information.
In three real-world applications (data pruning, active learning, and data annotation), the samples chosen on infoVerse space consistently outperform strong baselines.
arXiv Detail & Related papers (2023-05-30T18:12:48Z) - ALSO: Automotive Lidar Self-supervision by Occupancy estimation [70.70557577874155]
We propose a new self-supervised method for pre-training the backbone of deep perception models operating on point clouds.
The core idea is to train the model on a pretext task which is the reconstruction of the surface on which the 3D points are sampled.
The intuition is that if the network is able to reconstruct the scene surface, given only sparse input points, then it probably also captures some fragments of semantic information.
arXiv Detail & Related papers (2022-12-12T13:10:19Z) - 3DMODT: Attention-Guided Affinities for Joint Detection & Tracking in 3D
Point Clouds [95.54285993019843]
We propose a method for joint detection and tracking of multiple objects in 3D point clouds.
Our model exploits temporal information employing multiple frames to detect objects and track them in a single network.
arXiv Detail & Related papers (2022-11-01T20:59:38Z) - Attentive Multi-View Deep Subspace Clustering Net [4.3386084277869505]
We propose a novel Attentive Multi-View Deep Subspace Nets (AMVDSN)
Our proposed method seeks to find a joint latent representation that explicitly considers both consensus and view-specific information.
The experimental results on seven real-world data sets have demonstrated the effectiveness of our proposed algorithm against some state-of-the-art subspace learning approaches.
arXiv Detail & Related papers (2021-12-23T12:57:26Z) - DFC: Deep Feature Consistency for Robust Point Cloud Registration [0.4724825031148411]
We present a novel learning-based alignment network for complex alignment scenes.
We validate our approach on the 3DMatch dataset and the KITTI odometry dataset.
arXiv Detail & Related papers (2021-11-15T08:27:21Z) - Campus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical
Understanding of Outdoor Scene [76.4183572058063]
We present a richly-annotated 3D point cloud dataset for multiple outdoor scene understanding tasks.
The dataset has been point-wisely annotated with both hierarchical and instance-based labels.
We formulate a hierarchical learning problem for 3D point cloud segmentation and propose a measurement evaluating consistency across various hierarchies.
arXiv Detail & Related papers (2020-08-11T19:10:32Z) - METASET: Exploring Shape and Property Spaces for Data-Driven
Metamaterials Design [20.272835126269374]
We show that a smaller yet diverse set of unit cells leads to scalable search and unbiased learning.
Our flexible method can distill unique subsets regardless of the metric employed.
Our diverse subsets are provided publicly for use by any designer.
arXiv Detail & Related papers (2020-06-01T03:36:37Z)
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.