Cross-modal retrieval has become an active study field with the expanding scale of multimodal data. To date, most existing methods transform data into a common representation space where semantic similarities between items can be directly measured across different modalities. However, these typically suffer from following limitations: 1) They usually attempt to bridge modality gap by designing ...

Graph Neural Networks (GNNs) are known to address such tasks over graph-structured data, which is widely used represent many real-world systems. The collection and analysis of graph data using GNNs raise significant privacy concerns regarding disclosing sensitive information. Existing works in privacy-preserving ensure the nodes’ features labels. However, its structure also needs be privatized....

A set of (labeled) graphs can be de ned by a regular tree language and one regular string language for each possible edge label, as follows. For each tree t from the regular tree language the graph gr(t) has the same nodes as t (with the same labels), and there is an edge with label from node x to node y if the string of labels of the nodes on the shortest path from x to y in t belongs to the r...

This paper studies the problem of inferring a partition (or a graph cut) of an undirected deterministic graph where the labels of some nodes are observed thereby bridging a gap between graph theory and probabilistic inference techniques. Given a weighted graph, we focus on the rules of weighted neighbors to predict the label of a particular node. A maximum margin and maximal average margin base...

Recently graph based dimensionality reduction has received a lot of interests in many fields of information processing. Central to it is a graph structure which models the geometrical and discriminant structure of the data manifold. When label information is available, it is usually incorporated into the graph structure by modifying the weights between data points. In this paper, we propose a n...

The rotator graph has vertices labeled by the permutations of n in one line notation, and there is an arc from u to v if a prefix of u’s label can be rotated to obtain v’s label. In other words, it is the directed Cayley graph whose generators are σk := (1 2 · · · k) for 2 ≤ k ≤ n and these rotations are applied to the indices of a permutation. In a restricted rotator graph the allowable rotati...