A Spectral Method for Assessing and Combining Multiple Data Visualizations

• URL: http://arxiv.org/abs/2210.13711v1
• Date: Tue, 25 Oct 2022 02:13:19 GMT
• Title: A Spectral Method for Assessing and Combining Multiple Data Visualizations
• Authors: Rong Ma, Eric D. Sun and James Zou
• Abstract summary: We propose an efficient spectral method for assessing and combining multiple visualizations of a given dataset. The proposed method provides a quantitative measure -- the visualization eigenscore -- of the relative performance of the visualizations for preserving the structure around each data point. We analyze multiple simulated and real-world datasets to demonstrate the effectiveness of the eigenscores for evaluating visualizations and the superiority of the proposed consensus visualization.
• Score: 13.193958370464683
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Dimension reduction and data visualization aim to project a high-dimensional dataset to a low-dimensional space while capturing the intrinsic structures in the data. It is an indispensable part of modern data science, and many dimensional reduction and visualization algorithms have been developed. However, different algorithms have their own strengths and weaknesses, making it critically important to evaluate their relative performance for a given dataset, and to leverage and combine their individual strengths. In this paper, we propose an efficient spectral method for assessing and combining multiple visualizations of a given dataset produced by diverse algorithms. The proposed method provides a quantitative measure -- the visualization eigenscore -- of the relative performance of the visualizations for preserving the structure around each data point. Then it leverages the eigenscores to obtain a consensus visualization, which has much improved { quality over the individual visualizations in capturing the underlying true data structure.} Our approach is flexible and works as a wrapper around any visualizations. We analyze multiple simulated and real-world datasets from diverse applications to demonstrate the effectiveness of the eigenscores for evaluating visualizations and the superiority of the proposed consensus visualization. Furthermore, we establish rigorous theoretical justification of our method based on a general statistical framework, yielding fundamental principles behind the empirical success of consensus visualization along with practical guidance.

Related papers

• Discriminative Anchor Learning for Efficient Multi-view Clustering [59.11406089896875]
  We propose discriminative anchor learning for multi-view clustering (DALMC) We learn discriminative view-specific feature representations according to the original dataset. We build anchors from different views based on these representations, which increase the quality of the shared anchor graph.
  arXiv  Detail & Related papers  (2024-09-25T13:11:17Z)
• Zero-Shot Object-Centric Representation Learning [72.43369950684057]
  We study current object-centric methods through the lens of zero-shot generalization. We introduce a benchmark comprising eight different synthetic and real-world datasets. We find that training on diverse real-world images improves transferability to unseen scenarios.
  arXiv  Detail & Related papers  (2024-08-17T10:37:07Z)
• Discovering Common Information in Multi-view Data [35.37807004353416]
  We introduce an innovative and mathematically rigorous definition for computing common information from multi-view data. We develop a novel supervised multi-view learning framework to capture both common and unique information.
  arXiv  Detail & Related papers  (2024-06-21T10:47:06Z)
• One for all: A novel Dual-space Co-training baseline for Large-scale Multi-View Clustering [42.92751228313385]
  We propose a novel multi-view clustering model, named Dual-space Co-training Large-scale Multi-view Clustering (DSCMC) The main objective of our approach is to enhance the clustering performance by leveraging co-training in two distinct spaces. Our algorithm has an approximate linear computational complexity, which guarantees its successful application on large-scale datasets.
  arXiv  Detail & Related papers  (2024-01-28T16:30:13Z)
• Information-Theoretic Odometry Learning [83.36195426897768]
  We propose a unified information theoretic framework for learning-motivated methods aimed at odometry estimation. The proposed framework provides an elegant tool for performance evaluation and understanding in information-theoretic language.
  arXiv  Detail & Related papers  (2022-03-11T02:37:35Z)
• Delaunay Component Analysis for Evaluation of Data Representations [20.31649764319578]
  We introduce Delaunay Component Analysis (DCA) - an evaluation algorithm which approximates the data manifold using a more suitable neighbourhood graph called Delaunay graph. We experimentally validate the proposed DCA method on representations obtained from neural networks trained with contrastive objective, supervised and generative models.
  arXiv  Detail & Related papers  (2022-02-14T16:48:23Z)
• 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)
• Effective and Efficient Graph Learning for Multi-view Clustering [173.8313827799077]
  We propose an effective and efficient graph learning model for multi-view clustering. Our method exploits the view-similar between graphs of different views by the minimization of tensor Schatten p-norm. Our proposed algorithm is time-economical and obtains the stable results and scales well with the data size.
  arXiv  Detail & Related papers  (2021-08-15T13:14:28Z)
• Auto-weighted Multi-view Feature Selection with Graph Optimization [90.26124046530319]
  We propose a novel unsupervised multi-view feature selection model based on graph learning. The contributions are threefold: (1) during the feature selection procedure, the consensus similarity graph shared by different views is learned. Experiments on various datasets demonstrate the superiority of the proposed method compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-04-11T03:25:25Z)
• A Variational Information Bottleneck Approach to Multi-Omics Data Integration [98.6475134630792]
  We propose a deep variational information bottleneck (IB) approach for incomplete multi-view observations. Our method applies the IB framework on marginal and joint representations of the observed views to focus on intra-view and inter-view interactions that are relevant for the target. Experiments on real-world datasets show that our method consistently achieves gain from data integration and outperforms state-of-the-art benchmarks.
  arXiv  Detail & Related papers  (2021-02-05T06:05:39Z)
• Genetic Programming for Evolving a Front of Interpretable Models for Data Visualisation [4.4181317696554325]
  We propose a genetic programming approach named GPtSNE for evolving interpretable mappings from a dataset to high-quality visualisations. A multi-objective approach is designed that produces a variety of visualisations in a single run which give different trade-offs between visual quality and model complexity.
  arXiv  Detail & Related papers  (2020-01-27T04:03:19Z)

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.