Demo Data from EDBT 2026 / reviewers in the wild / expert
Yun Hong
dblp:98/3167
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
drug discovery |
0.9 | 1 | 2025 | DrugHash: Hashing Based Contrastive Learning for Virtual Screening · AAAI 2025 |
Bioinformatics and computational biology › drug discovery
virtual screening |
0.9 | 1 | 2025 | DrugHash: Hashing Based Contrastive Learning for Virtual Screening · AAAI 2025 |
Information retrieval › document retrieval › domain-specific retrieval › code search
binary code retrieval |
0.9 | 1 | 2025 | DrugHash: Hashing Based Contrastive Learning for Virtual Screening · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
hashing · 1.7contrastive learning · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Graph-aware multi-agent learning for cross-domain deterministic routing and scheduling
Jiming Yao, Yun Hong, Taojie Zhu, Bin Kang |
Comput. Networks | 2 |
| 2025 | DrugHash: Hashing Based Contrastive Learning for Virtual ScreeningabstractVirtual screening (VS) is a critical step in computer-aided drug discovery, aiming to identify molecules that bind to a specific target protein. Traditional VS methods, such as docking, are often too time-consuming to efficiently screen large-scale molecular databases. Recent advances in deep learning have demonstrated that learning vector representations for both proteins and molecules using contrastive learning can outperform traditional docking methods. However, considering that the target databases often contain billions of molecules, real-valued vector representations adopted by existing methods can still incur large memory and time cost in VS. To address this problem, we propose DrugHash, a hashing-based contrastive learning method for VS. DrugHash formulates VS as a retrieval task that leverages binary hash codes for efficient retrieval. In particular, DrugHash designs a simple yet effective hashing strategy to enable end-to-end learning of binary hash codes for both proteins and molecules, which can dramatically reduce the memory and time cost with higher accuracy compared with existing methods. Experimental results show that DrugHash can outperform existing methods to achieve state-of-the-art accuracy, with at least a 32 times reduction in memory cost and a 4.6 times improvement in speed. Jin Han 0003, Yun Hong, Wu-Jun Li |
AAAI | 2 |