Demo Data from VLDB 2026 / reviewers in the wild / expert
Ruijiang Han
dblp:302/0838
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2022
0000-0003-2611-7365ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.
| Artificial intelligence
1 paper |
Representation and self-supervised learning · 67% Trustworthy machine learning · 33% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning › neural network representation learning
deep representation learning |
0.6 | 1 | 2022 | Deep Representation Debiasing via Mutual Information Minimization and Maximization (Student Abstract) · AAAI 2022 |
Machine learning › Trustworthy machine learning
fairness |
0.6 | 1 | 2022 | Deep Representation Debiasing via Mutual Information Minimization and Maximization (Student Abstract) · AAAI 2022 |
Machine learning › Representation and self-supervised learning › representation learning
representation debiasing |
0.6 | 1 | 2022 | Deep Representation Debiasing via Mutual Information Minimization and Maximization (Student Abstract) · AAAI 2022 |
Methods — techniques the papers use, named apart from their topics
mutual information minimization · 0.6mutual information maximization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Deep Representation Debiasing via Mutual Information Minimization and Maximization (Student Abstract)abstractDeep representation learning has succeeded in several fields. However, pre-trained deep representations are usually biased and make downstream models sensitive to different attributes. In this work, we propose a post-processing unsupervised deep representation debiasing algorithm, DeepMinMax, which can obtain unbiased representations directly from pre-trained representations without re-training or fine-tuning the entire model. The experimental results on synthetic and real-world datasets indicate that DeepMinMax outperforms the existing state-of-the-art algorithms on downstream tasks. Ruijiang Han, Yuxi Long, Jiajie Peng |
AAAI | 1 |
| 2022 | A network-based method for brain disease gene prediction by integrating brain connectome and molecular networkabstractBrain disease gene identification is critical for revealing the biological mechanism and developing drugs for brain diseases. To enhance the identification of brain disease genes, similarity-based computational methods, especially network-based methods, have been adopted for narrowing down the searching space. However, these network-based methods only use molecular networks, ignoring brain connectome data, which have been widely used in many brain-related studies. In our study, we propose a novel framework, named brainMI, for integrating brain connectome data and molecular-based gene association networks to predict brain disease genes. For the consistent representation of molecular-based network data and brain connectome data, brainMI first constructs a novel gene network, called brain functional connectivity (BFC)-based gene network, based on resting-state functional magnetic resonance imaging data and brain region-specific gene expression data. Then, a multiple network integration method is proposed to learn low-dimensional features of genes by integrating the BFC-based gene network and existing protein-protein interaction networks. Finally, these features are utilized to predict brain disease genes based on a support vector machine-based model. We evaluate brainMI on four brain diseases, including Alzheimer's disease, Parkinson's disease, major depressive disorder and autism. brainMI achieves of 0.761, 0.729, 0.728 and 0.744 using the BFC-based gene network alone and enhances the molecular network-based performance by 6.3% on average. In addition, the results show that brainMI achieves higher performance in predicting brain disease genes compared to the existing three state-of-the-art methods. Ruijiang Han, Menghan Zhang, Yuxian Wang, Tao Wang 0082, Yongtian Wang, Xuequn Shang 0001, Jiajie Peng |
Briefings Bioinform. | 2 |
| 2021 | An end-to-end heterogeneous graph representation learning-based framework for drug-target interaction predictionabstractAccurately identifying potential drug-target interactions (DTIs) is a key step in drug discovery. Although many related experimental studies have been carried out for identifying DTIs in the past few decades, the biological experiment-based DTI identification is still timeconsuming and expensive. Therefore, it is of great significance to develop effective computational methods for identifying DTIs. In this paper, we develop a novel 'end-to-end' learning-based framework based on heterogeneous 'graph' convolutional networks for 'DTI' prediction called end-to-end graph (EEG)-DTI. Given a heterogeneous network containing multiple types of biological entities (i.e. drug, protein, disease, side-effect), EEG-DTI learns the low-dimensional feature representation of drugs and targets using a graph convolutional networks-based model and predicts DTIs based on the learned features. During the training process, EEG-DTI learns the feature representation of nodes in an end-to-end mode. The evaluation test shows that EEG-DTI performs better than existing state-of-art methods. The data and source code are available at: https://github.com/MedicineBiology-AI/EEG-DTI. Jiajie Peng, Yuxian Wang, Jiaojiao Guan, Ruijiang Han, Jianye Hao, Zhongyu Wei, Xuequn Shang 0001 |
Briefings Bioinform. | 5 |