Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuanxing Xu

dblp:359/3116 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
7since 2021 · last 2025
0009-0003-5039-9937ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Databases, data management, data science and information retrieval · 1 · 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
2 papers
Language models and text generation · 32% Video understanding and tracking · 24% Vision and language · 24%

Topics — the 2 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking
deep video understanding
0.712023
Query-aware Long Video Localization and Relation Discrimination for Deep Video Understanding · ACM Multimedia 2023
Natural language and speech › Information extraction and text analysis
word sense disambiguation
0.312025
TEACH: A Contrastive Knowledge Adaptive Distillation Framework for Classical Chinese Understanding · ACL (1) 2025

Methods — techniques the papers use, named apart from their topics

knowledge distillation · 0.9iterative word alignment · 0.9contrastive distillation · 0.9chain-of-thought prompting · 0.9relation discrimination · 0.7query-aware frame selection · 0.7
YearPublicationVenuePosition
2025 TEACH: A Contrastive Knowledge Adaptive Distillation Framework for Classical Chinese Understanding
abstract
Traditional methods for processing classical Chinese typically segment language understanding into discrete tasks, which overlook crucial background information and reduce user engagement.Large language models (LLMs) provide integrated solutions, yet they entail high computational costs and risks of generating inaccurate historical information.To tackle these challenges, we propose a novel framework, TEACH (conTrastive knowlEdge Adaptive distillation with enhanCed Historical interpretability), which focuses on classical Chinese understanding by integrating word sense disambiguation with sentence translation.This integration leverages a confidenceannotated knowledge base and a step-by-step Chain-of-Thought prompting mechanism to minimize hallucinations and improve semantic analysis.Moreover, TEACH employs contrastive distillation learning to efficiently transfer capabilities from larger models to smaller ones (e.g., Qwen2-1.5B),addressing overly liberal translations.Additionally, we introduce an innovative generation evaluation metric using iterative word alignment, enhancing LLM performance assessments by distinguishing additional information and addressing excessive translation issues.Experiments conducted on real-world datasets validate TEACH's efficacy in classical Chinese educational scenarios.
Yuanxing Xu
ACL (1)3
2025 Improving Graph Contrastive Learning with LLMs: A New Hardness-Aware Negative Sampling Strategy
abstract
Graph contrastive learning plays a crucial role in many fields, such as social network analysis and recommendation, and has become a hot research area in recent years. The key to improving the quality of contrastive learning is to obtain high-quality sample pairs that reflect the structural features of the data more effectively. Existing methods typically sample based on node similarity and can only select negative samples of a fixed difficulty level, leading to issues like false positives and false negatives. This study proposes a novel paradigm called Hardness-aware Negative Sampling Graph Contrastive Learning with LLMs. We outline the criteria that the adaptive hardness sampling method should follow and provide concrete instances. By adaptively selecting negative samples of appropriate hardness during the training process, this method effectively mitigates false negative and false positive problems. Additionally, we leverage large language models to integrate data with supplementary textual attributes. Extensive experiments and analyses demonstrate the superiority and effectiveness of our proposed method.
Shuai Zhong, Haorui Wang, Xinming Chen, Yuanxing Xu, Bin Wu 0001
IJCNN5
2025 Hybrid Gaussian quantum particle swarm optimization and adaptive genetic algorithm for flexible job-shop scheduling problem
Yuanxing Xu, Mengjian Zhang, Ming Yang 0030, Chengbin Liang
Eng. Appl. Artif. Intell.1
2025 A diachronic language model for long-time span classical Chinese
Yangfu Zhu, Yuanxing Xu, Bin Wu 0001
Inf. Process. Manag.4
2024 Knowledge-enhanced Multi-Granularity Interaction Network for Political Perspective Detection
abstract
Nowadays, with political ideologies becoming increasingly polarized, detecting political perspectives has become more and more crucial. Previous studies mainly focused on reasoning with real-world entities as background knowledge, while they fail to effectively model hierarchical relationships in the text structure and leave out the document-level knowledge such as topics in a news article. To overcome these limitations, we propose KMGN, a novel Knowledge-enhanced Multi-Granularity Interaction Network for political perspective prediction which consists of two key components: (1) a knowledge infusion method for learning both the topic representations and political entities of a news article (2) a multi-granularity interaction network to learn semantic representations for words, sentences, and document and integrate the infused knowledge across different granularities. Extensive experiments shows that our proposed approach is effective in predicting the political stance in a news article. An ablation study demonstrates the contribution of each component in our model.
Xinming Chen, Yuanxing Xu, Bin Wu 0001, Yangfu Zhu
IJCNN3
2024 Bottom-Up Hierarchical Propagation Networks with Heterogeneous Graph Modeling for Video Question Answering
abstract
Video Question Answering (VideoQA), as a challenging multimodal reasoning task, aims to answer the given question based on multimodal modeling, reasoning and interacting. Most existing studies usually extract visual and linguistic embeddings separately, then perform graph-based reasoning in a single modality at a specific level (e.g., object-level, frame-level). However, an overlooked observation is that, while video is presented in frame sequence, the visual elements are not sequential but rather hierarchical. In terms of cross-modal interaction, most of the methods also hardly perform the inter- and intra-modality reasoning simultaneously. To tackle the challenges above, we propose a Bottom-Up Hierarchical Propagation Networks with Heterogeneous Graph Modeling framework named HPN, to hierarchically learn the semantic correlations among different modalities. We first regard these multilevel features as nodes, constructing a uniform heterogeneous graph at each level to perform cross-modal interaction, these updated visual and linguistic features are then bottom-up propagated to the upper level to adjust the hierarchical nature of the video element. The experiments conducted on two VideoQA datasets show that HPN outperforms the state-of-the-art methods, achieving a significant improvement.
Jinsheng Qi, Yuanxing Xu, Bin Wu 0001
IJCNN2
2023 Query-aware Long Video Localization and Relation Discrimination for Deep Video Understanding
abstract
The surge in video and social media content underscores the need for a deeper understanding of multimedia data. Most of the existing mature video understanding techniques perform well with short formats and content that requires only shallow understanding, but do not perform well with long format videos that require deep understanding and reasoning. Deep Video Understanding (DVU) Challenge aims to push the boundaries of multimodal extraction, fusion, and analytics to address the problem of holistically analyzing long videos and extract useful knowledge to solve different types of queries. This paper introduces a query-aware method for long video localization and relation discrimination, leveraging an image-language pretrained model. This model adeptly selects frames pertinent to queries, obviating the need for a complete movie-level knowledge graph. Our approach achieved first and fourth positions for two groups of movie-level queries. Sufficient experiments and final rankings demonstrate its effectiveness and robustness.
Yuanxing Xu, Bin Wu 0001
ACM Multimedia1