VLDB 2026 Research / reviewers in the wild / expert
Huilong Jin
dblp:16/8386
· DBLP profile ↗
9ranked-venue papers
1as first author
9since 2021 · last 2026
0009-0008-5380-3719ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 4 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Adaptive Graph Attention Based Discrete Hashing for Incomplete Cross-modal RetrievalabstractCross-modal hashing has emerged as a pivotal solution for efficient retrieval across diverse modalities, such as images and texts, by mapping them into compact binary hash spaces. However, in real-world scenarios, the modalities data is often missing or misaligned. Existing methods are most rely on fully paired training data and ignore missing or misaligned modalities data, resulting in the semantic inconsistencies. To address these challenges, we propose an Adaptive Graph Attention-Based Discrete Hashing (AGADH) method, which consists of three parts. First, to solve the problem of missing modalities, AGADH employs a masked completion strategy to reconstruct missing modalities. Second, to mitigate semantic misalignment, AGADH leverages a Graph Attention Network (GAT) encoder-decoder architecture with alignment module to construct features from different modalities. Additionally, to enhance the fusion performance, an adaptive fusion module dynamically adjusting the contributions of image and text modalities with learnable weighting coefficients is proposed. Extensive experiments on three benchmark datasets, MS-COCO, NUS-WIDE, and MIRFlickr-25K, demonstrating that AGADH outperforms state-of-the-art methods in both fully paired and incompletely paired scenarios, showing its robustness and effectiveness in cross-modal retrieval tasks. Shuang Zhang 0009, Lei Shi 0030, Huilong Jin, Feifei Kou, Pengfei Zhang 0010, Mingying Xu, Pengtao Lv |
AAAI | 4 |
| 2026 | Dual Graph Network Hashing for Cross-Modal Retrieval
Shuang Zhang 0009, Lei Shi 0030, Feifei Kou, Huilong Jin, Pengfei Zhang 0010, Weiping Ding 0001, Mingying Xu, Muhammet Deveci |
IEEE Trans. Knowl. Data Eng. | 5 |
| 2025 | Dynamic Masking and Auxiliary Hash Learning for Enhanced Cross-Modal RetrievalabstractThe demand for multimodal data processing drives the development of information technology. Cross-modal hash retrieval has attracted much attention because it can overcome modal differences and achieve efficient retrieval, and has shown great application potential in many practical scenarios. Existing cross-modal hashing methods have difficulties in fully capturing the semantic information of different modal data, which leads to a significant semantic gap between modalities. Moreover, these methods often ignore the importance differences of channels, and due to the limitation of a single goal, the matching effect between hash codes is also affected to a certain extent, thus facing many challenges. To address these issues, we propose a Dynamic Masking and Auxiliary Hash Learning (AHLR) method for enhanced cross-modal retrieval. By jointly leveraging the dynamic masking and auxiliary hash learning mechanisms, our approach effectively resolves the problems of channel information imbalance and insufficient key information capture, thereby significantly improving the retrieval accuracy. Specifically, we introduce a dynamic masking mechanism that automatically screens and weights the key information in images and texts during the training process, enhancing the accuracy of feature matching. We further construct an auxiliary hash layer to adaptively balance the weights of features across each channel, compensating for the deficiencies of traditional methods in key information capture and channel processing. In addition, we design a contrastive loss function to optimize the generation of hash codes and enhance their discriminative power, further improving the performance of cross-modal retrieval. Comprehensive experimental results on NUS-WIDE, MIRFlickr-25K and MS-COCO benchmark datasets show that the proposed AHLR algorithm outperforms several existing algorithms. Shuang Zhang 0009, Lei Shi 0030, Feifei Kou, Huilong Jin, Pengfei Zhang 0010, Meiyu Liang, Mingying Xu |
NeurIPS | 6 |
| 2025 | Heterogeneous Vehicular Selection for Adaptive Federated Learning: A Cost-Optimized ApproachabstractThe rapid expansion of vehicular networks has intensified congestion and privacy risks. Although Federated Learning (FL) addresses both challenges through decentralized model training while preserving data locality, existing FL-based client selection strategies often fall short in highly heterogeneous vehicular environments. Specifically, the inherent heterogeneity in vehicular networks—characterized by diverse data distributions and system resources—complicates current methods. The imbalanced nature of local data further exacerbates model divergence, resulting in degraded overall system performance. To solve the above problems, in the process of vehicle selection, this paper comprehensively considers three kinds of heterogeneity and proposes an FL model with adaptive proximal term. The weight coefficient of this model is dynamically adjusted based on the difference between the local and global model parameters. Based on this, a contribution score-based vehicle selection strategy (CSVS), considering the dynamics of vehicles, is proposed to alleviate the problem of traditional model weight divergence and minimize system cost. Experimental results on two classic datasets demonstrate that the proposed strategy significantly outperforms baseline methods in reducing system cost and improving model training performance, particularly in highly heterogeneous vehicular environments. Shuang Zhang 0009, Songwen Gu, Huilong Jin, Maher Guizani |
IEEE Internet Things J. | 5 |
| 2024 | An End-To-End Graph Attention Network Hashing for Cross-Modal RetrievalabstractDue to its low storage cost and fast search speed, cross-modal retrieval based on hashing has attracted widespread attention and is widely used in real-world applications of social media search. However, most existing hashing methods are often limited by uncomprehensive feature representations and semantic associations, which greatly restricts their performance and applicability in practical applications. To deal with this challenge, in this paper, we propose an end-to-end graph attention network hashing (EGATH) for cross-modal retrieval, which can not only capture direct semantic associations between images and texts but also match semantic content between different modalities. We adopt the contrastive language image pretraining (CLIP) combined with the Transformer to improve understanding and generalization ability in semantic consistency across different data modalities. The classifier based on graph attention network is applied to obtain predicted labels to enhance cross-modal feature representation. We construct hash codes using an optimization strategy and loss function to preserve the semantic information and compactness of the hash code. Comprehensive experiments on the NUS-WIDE, MIRFlickr25K, and MS-COCO benchmark datasets show that our EGATH significantly outperforms against several state-of-the-art methods. Huilong Jin, Lei Shi 0030, Shuang Zhang 0009, Feifei Kou, Chuangying Zhu, Jia Luo 0001 |
NeurIPS | 1 |
| 2024 | Reducing Latency in NOMA-aided MEC Networks: A Deep Reinforcement Learning Approach
Shuang Zhang 0009, Pingkang Guo, Huilong Jin |
WiOpt | 3 |
| 2024 | IRS-assisted energy efficient communication for UAV mobile edge computing
Shuang Zhang 0009, Huilong Jin, Pingkang Guo |
Comput. Networks | 2 |
| 2024 | Workpiece classification based on transfer component analysis
Liyong Qiao, Shuang Zhang 0009, Chungang Liu, Huilong Jin, Jian Yao 0002, Lingru Cao, Yujia Ji |
Wirel. Networks | 4 |
| 2024 | User association for EE maximization in uplink HetNets with NOMA
Shuang Zhang 0009, Huilong Jin, Liyong Qiao, Xiaozi Jin, Yucong Zhou |
Wirel. Networks | 2 |