Heterogeneous co-occurrence embedding for visual information exploration

• URL: http://arxiv.org/abs/2508.17663v1
• Date: Mon, 25 Aug 2025 04:51:50 GMT
• Title: Heterogeneous co-occurrence embedding for visual information exploration
• Authors: Takuro Ishida, Tetsuo Furukawa,
• Abstract summary: We consider cases where co-occurrence probabilities are measured between pairs of elements from heterogeneous domains.<n>The proposed method maps these heterogeneous elements into corresponding two-dimensional latent spaces, enabling visualization of asymmetric relationships between the domains.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper proposes an embedding method for co-occurrence data aimed at visual information exploration. We consider cases where co-occurrence probabilities are measured between pairs of elements from heterogeneous domains. The proposed method maps these heterogeneous elements into corresponding two-dimensional latent spaces, enabling visualization of asymmetric relationships between the domains. The key idea is to embed the elements in a way that maximizes their mutual information, thereby preserving the original dependency structure as much as possible. This approach can be naturally extended to cases involving three or more domains, using a generalization of mutual information known as total correlation. For inter-domain analysis, we also propose a visualization method that assigns colors to the latent spaces based on conditional probabilities, allowing users to explore asymmetric relationships interactively. We demonstrate the utility of the method through applications to an adjective-noun dataset, the NeurIPS dataset, and a subject-verb-object dataset, showcasing both intra- and inter-domain analysis.

Related papers

• Structure-Aware Correspondence Learning for Relative Pose Estimation [65.44234975976451]
  Relative pose estimation provides a promising way for achieving object-agnostic pose estimation.<n>Existing 3D correspondence-based methods suffer from small overlaps in visible regions and unreliable feature estimation for invisible regions.<n>We propose a novel Structure-Aware Correspondence Learning method for Relative Pose Estimation, which consists of two key modules.
  arXiv  Detail & Related papers  (2025-03-24T13:43:44Z)
• Graph Integration for Diffusion-Based Manifold Alignment [0.0]
  Multimodal data integration can enrich information content compared to single-source data. Manifold alignment is a form of data integration that seeks a shared, underlying low-dimensional representation of multiple data sources. In this paper, we introduce two semi-supervised manifold alignment methods.
  arXiv  Detail & Related papers  (2024-10-30T12:43:44Z)
• A Plug-and-Play Method for Rare Human-Object Interactions Detection by Bridging Domain Gap [50.079224604394]
  We present a novel model-agnostic framework called textbfContext-textbfEnhanced textbfFeature textbfAment (CEFA) CEFA consists of a feature alignment module and a context enhancement module. Our method can serve as a plug-and-play module to improve the detection performance of HOI models on rare categories.
  arXiv  Detail & Related papers  (2024-07-31T08:42:48Z)
• Comparing the information content of probabilistic representation spaces [3.7277730514654555]
  Probabilistic representation spaces convey information about a dataset and are shaped by factors such as the training data, network architecture, and loss function.<n>We propose two information-theoretic measures to compare general probabilistic representation spaces.<n>We demonstrate the utility of these measures in three case studies.
  arXiv  Detail & Related papers  (2024-05-31T17:33:07Z)
• Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein [56.62376364594194]
  Unsupervised learning aims to capture the underlying structure of potentially large and high-dimensional datasets.<n>In this work, we revisit these approaches under the lens of optimal transport and exhibit relationships with the Gromov-Wasserstein problem.<n>This unveils a new general framework, called distributional reduction, that recovers DR and clustering as special cases and allows addressing them jointly within a single optimization problem.
  arXiv  Detail & Related papers  (2024-02-03T19:00:19Z)
• Pairwise-Constrained Implicit Functions for 3D Human Heart Modelling [60.56741715207466]
  We introduce a pairwise-constrained SDF approach that models the heart as a set of interdependent SDFs.<n>Our method significantly improves inner structure accuracy over single-SDF, UDF-based, voxel-based, and segmentation-based reconstructions.
  arXiv  Detail & Related papers  (2023-07-16T10:07:15Z)
• Opening the black-box of Neighbor Embedding with Hotelling's T2 statistic and Q-residuals [1.6058099298620425]
  Neighbor embedding (NE) techniques tend to better preserve the local structure/topology of high-dimensional data. However, the ability to preserve local structure comes at the expense of interpretability. We show how our approach is capable of identifying discriminatory features between groups of data points.
  arXiv  Detail & Related papers  (2022-09-05T14:33:42Z)
• Unsupervised Manifold Alignment with Joint Multidimensional Scaling [4.683612295430957]
  We introduce Joint Multidimensional Scaling, which maps datasets from two different domains to a common low-dimensional Euclidean space. Our approach integrates Multidimensional Scaling (MDS) and Wasserstein Procrustes analysis into a joint optimization problem. We demonstrate the effectiveness of our approach in several applications, including joint visualization of two datasets, unsupervised heterogeneous domain adaptation, graph matching, and protein structure alignment.
  arXiv  Detail & Related papers  (2022-07-06T21:02:42Z)
• A cross-domain recommender system using deep coupled autoencoders [77.86290991564829]
  Two novel coupled autoencoder-based deep learning methods are proposed for cross-domain recommendation. The first method aims to simultaneously learn a pair of autoencoders in order to reveal the intrinsic representations of the items in the source and target domains. The second method is derived based on a new joint regularized optimization problem, which employs two autoencoders to generate in a deep and non-linear manner the user and item-latent factors.
  arXiv  Detail & Related papers  (2021-12-08T15:14:26Z)
• Modelling Neighbor Relation in Joint Space-Time Graph for Video Correspondence Learning [53.74240452117145]
  This paper presents a self-supervised method for learning reliable visual correspondence from unlabeled videos. We formulate the correspondence as finding paths in a joint space-time graph, where nodes are grid patches sampled from frames, and are linked by two types of edges. Our learned representation outperforms the state-of-the-art self-supervised methods on a variety of visual tasks.
  arXiv  Detail & Related papers  (2021-09-28T05:40:01Z)
• Data-Driven Learning of 3-Point Correlation Functions as Microstructure Representations [8.978973486638253]
  We show that a variety of microstructures can be characterized by a concise subset of three-point correlations. The proposed representation can directly be used to compute material properties based on the effective medium theory.
  arXiv  Detail & Related papers  (2021-09-06T06:15:57Z)
• A Universal Model for Cross Modality Mapping by Relational Reasoning [29.081989993636338]
  Cross modality mapping has attracted growing attention in the computer vision community. We propose a GCN-based Reasoning Network (RR-Net) in which inter and intra relations are efficiently computed. Experiments on three example tasks, i.e., image classification, social recommendation and sound recognition, clearly demonstrate the superiority and universality of our proposed model.
  arXiv  Detail & Related papers  (2021-02-26T08:56:24Z)
• Bayesian Sparse Factor Analysis with Kernelized Observations [67.60224656603823]
  Multi-view problems can be faced with latent variable models. High-dimensionality and non-linear issues are traditionally handled by kernel methods. We propose merging both approaches into single model.
  arXiv  Detail & Related papers  (2020-06-01T14:25:38Z)

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.