Ridong Han

dblp:293/6830 · DBLP profile ↗
← Back
15ranked-venue papers
4as first author
15since 2021 · last 2026
0000-0001-6842-7084ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 10 · 4 first-author · 10 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2026 CJ-Attacks: Controllable Jailbreaking Attacks in Diffusion-Based Image Editing via Transferable Prompt Suffixes
Ridong Han, Zhongnian Li, Xinzheng Xu
ICIC (17)2
2026 Learning from Multi-Concealed Labels
Zhongnian Li, Ridong Han, Xinzheng Xu
ICIC (26)3
2026 Improving few-shot relation classification with multi-scale hierarchical prototype learning
Haijia Bi, Lu Liu 0013, Hai Cui, Shengyue Liu, Ridong Han, Tao Peng 0003
Neural Networks5
2026 Document-level relation extraction with entity type constraints
Ridong Han, Tao Peng 0003, Haijia Bi, Xinzheng Xu, Lu Liu 0013
Neural Networks1
2025 Determined Multi-Label Learning via Similarity-Based Prompt
abstract
Recent advances in weakly multi-label learning (MLL) have demonstrated impressive potential in multi-label classification tasks. Unfortunately, collecting multi-labels for each instance proves to be time-consuming and labor-intensive, since these MLL methods requires the assessment of all the candidate labels. To alleviate this challenge, a novel labeling setting termed Determined Multi-Label Learning is proposed, aiming to effectively reduce the cost for browsing labels in multi-label tasks. In this setting, each training instance is associated with a determined multi-label, which indicates whether the instance contains the provided class label. Besides, each instance only need to be determined once, which significantly reduce the annotation cost of the labeling task for multi-label datasets. In this paper, we theoretically derive an risk-consistent estimator to learn from these determined-labeled training data. Additionally, we introduce a similarity-based prompt learning method, which minimizes the risk-consistent loss of large-scale pre-trained models to learn a supplemental prompt with richer semantic information. Extensive experimental validation underscores the efficacy of our approach. Our code is available at the link: https://github.com/WilsonMqz/DMLL
Meng Wei 0006, Zhongnian Li, Peng Ying, Ridong Han, Tongfeng Sun, Xinzheng Xu
ICME4
2025 SCR: A completion-then-reasoning framework for multi-hop question answering over incomplete knowledge graph
Ridong Han, Haijia Bi, Tao Peng 0003, Lu Liu 0013
Neurocomputing1
2024 Document-level Relation Extraction with Relation Correlations
Ridong Han, Tao Peng 0003, Benyou Wang, Lu Liu 0013, Prayag Tiwari
Neural Networks1
2023 Stepwise relation prediction with dynamic reasoning network for multi-hop knowledge graph question answering
Hai Cui, Tao Peng 0003, Tie Bao, Ridong Han, Lu Liu 0013
Appl. Intell.4
2023 Reinforcement learning with dynamic completion for answering multi-hop questions over incomplete knowledge graph
Hai Cui, Tao Peng 0003, Ridong Han, Haijia Bi, Lu Liu 0013
Inf. Process. Manag.3
2023 Incorporating anticipation embedding into reinforcement learning framework for multi-hop knowledge graph question answering
Hai Cui, Tao Peng 0003, Ridong Han, Lu Liu 0013
Inf. Sci.5
2023 Path-based multi-hop reasoning over knowledge graph for answering questions via adversarial reinforcement learning
Hai Cui, Tao Peng 0003, Ridong Han, Lu Liu 0013
Knowl. Based Syst.3
2023 An effective knowledge graph entity alignment model based on multiple information
Tie Bao, Ridong Han, Hai Cui, Lu Liu 0013, Tao Peng 0003
Neural Networks3
2022 Synchronously tracking entities and relations in a syntax-aware parallel architecture for aspect-opinion pair extraction
Tao Peng 0003, Ridong Han, Lin Yue, Lu Liu 0013
Appl. Intell.3
2022 Distantly Supervised Relation Extraction using Global Hierarchy Embeddings and Local Probability Constraints
Tao Peng 0003, Ridong Han, Hai Cui, Lin Yue, Lu Liu 0013
Knowl. Based Syst.2
2022 Distantly Supervised Relation Extraction via Recursive Hierarchy-Interactive Attention and Entity-Order Perception
Ridong Han, Tao Peng 0003, Hai Cui, Lu Liu 0013
Neural Networks1