Javascript must be enabled to continue!
HGACH: Hypergraph Attention Convolutional Hashing for Semi-supervised Cross-modal Retrieval
View through CrossRef
Abstract
Currently, the semi-supervised paradigm that integrates a few labeled and large numbers of unlabeled instances has garnered significant attention in cross-modal retrieval. This approach is particularly advantageous as it not only harnesses the supervisory signals from labeled data but also capitalizes on the latent information embedded in unlabeled samples. Nevertheless, previous works predominantly focus on pairwise relationships between instances, overlooking the higher-order relationships among samples, and consequently failing to fully exploit the underlying structure of the data. To bridge this gap, we propose a novel hypergraph attention convolutional hashing (HGACH) method for semi-supervised cross-modal retrieval. Distinguished from prior works, HGACH incorporates a dedicated mechanism to prioritize unlabeled samples, enabling the model to precisely capture complex higher-order dependencies via hypergraph attention convolutional networks. This approach ensures that the interdependencies between different modalities are better understood, thus significantly boosting retrieval accuracy. In addition, a robust similarity matrix is carefully designed, explicitly modeling both inter-modality and intra-modality distances, which is essential for correctly identifying similarities between different types of data. Furthermore, for labeled instances, we propose a supervised loss to preserve the similarity according to the given labels, ensuring that the model's predictions are consistent with the labeled data. Experimental results demonstrate that the proposed HGACH method outperforms existing state-of-the-art (SOTA) methods in terms of retrieval performance, showcasing its effectiveness in handling complex cross-modal retrieval tasks. The codes are available at https://anonymous.4open.science/r/HGACH-1D7F/.
Springer Science and Business Media LLC
Title: HGACH: Hypergraph Attention Convolutional Hashing for Semi-supervised Cross-modal Retrieval
Description:
Abstract
Currently, the semi-supervised paradigm that integrates a few labeled and large numbers of unlabeled instances has garnered significant attention in cross-modal retrieval.
This approach is particularly advantageous as it not only harnesses the supervisory signals from labeled data but also capitalizes on the latent information embedded in unlabeled samples.
Nevertheless, previous works predominantly focus on pairwise relationships between instances, overlooking the higher-order relationships among samples, and consequently failing to fully exploit the underlying structure of the data.
To bridge this gap, we propose a novel hypergraph attention convolutional hashing (HGACH) method for semi-supervised cross-modal retrieval.
Distinguished from prior works, HGACH incorporates a dedicated mechanism to prioritize unlabeled samples, enabling the model to precisely capture complex higher-order dependencies via hypergraph attention convolutional networks.
This approach ensures that the interdependencies between different modalities are better understood, thus significantly boosting retrieval accuracy.
In addition, a robust similarity matrix is carefully designed, explicitly modeling both inter-modality and intra-modality distances, which is essential for correctly identifying similarities between different types of data.
Furthermore, for labeled instances, we propose a supervised loss to preserve the similarity according to the given labels, ensuring that the model's predictions are consistent with the labeled data.
Experimental results demonstrate that the proposed HGACH method outperforms existing state-of-the-art (SOTA) methods in terms of retrieval performance, showcasing its effectiveness in handling complex cross-modal retrieval tasks.
The codes are available at https://anonymous.
4open.
science/r/HGACH-1D7F/.
Related Results
Completion and decomposition of hypergraphs by domination hypergraphs
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every ve...
Unsupervised Deep Cross-Modal Hashing Retrieval with Multiple Dense Networks
Unsupervised Deep Cross-Modal Hashing Retrieval with Multiple Dense Networks
Abstract
Cross-modal retrieval is a hot research direction at present, and unsupervised cross-modal hashing has better practical value for its storage, training cost, and q...
Noise-robust classification with hypergraph neural network
Noise-robust classification with hypergraph neural network
<p>This paper presents a novel version of hypergraph neural network method. This method is utilized to solve the noisy label learning problem. First, we apply the PCA dimensi...
Proxy-Guided Semi-supervised Hashing for Cross-modal Retrieval
Proxy-Guided Semi-supervised Hashing for Cross-modal Retrieval
Abstract
With the exponential growth of multimodal data, cross-modal retrieval has become increasingly important. While supervised deep hashing methods have achieve...
Graph-based entity-oriented search
Graph-based entity-oriented search
Entity-oriented search has revolutionized search engines. In the era of Google Knowledge Graph and Microsoft Satori, users demand an effortless process of search. Whether they expr...
Characterizing the hypergraph-of-entity and the structural impact of its extensions
Characterizing the hypergraph-of-entity and the structural impact of its extensions
AbstractThe hypergraph-of-entity is a joint representation model for terms, entities and their relations, used as an indexing approach in entity-oriented search. In this work, we c...
ANALISIS MODAL KERJA PADA KOPERASI SERBA USAHA DI KOTA METRO
ANALISIS MODAL KERJA PADA KOPERASI SERBA USAHA DI KOTA METRO
Modal kerja merupakan suatu kekayaan yang digunakan untuk membelanjai perusahaan sehari-hari. Modal kerja biasanya berbentuk uang kas, piutang, persediaan barang yang kesemuanya it...
On Graph Representation for Attributed Hypergraph Clustering
On Graph Representation for Attributed Hypergraph Clustering
Attributed Hypergraph Clustering (AHC) aims at partitioning a hypergraph into clusters such that nodes in the same cluster are close to each other with both high connectedness and ...

