Jiaxu Qian

dblp:350/0407 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2025
0009-0002-9514-528XORCID · corroborated

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

Databases, data management, data science and information retrieval · 3 · 3 since 2021Artificial intelligence and machine learning · 2 · 2 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.

Databases, data mining, and information retrieval
3 papers
Data mining · 46% Knowledge graphs · 33% Data integration and cleaning · 21%
Artificial intelligence
2 papers
Vision and language · 74% Language models and text generation · 26%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
anomaly detection
0.912025
Large Language Models can Deliver Accurate and Interpretable Time Series Anomaly Detection · KDD (2) 2025
Data integration and cleaning
entity matching
0.912025
CrossETR: A Semantic-Driven Framework for Entity Matching Across Images and Graph · ICDE 2025
Knowledge graphs › knowledge graph alignment › entity alignment
multi-modal entity alignment
0.912025
CrossETR: A Semantic-Driven Framework for Entity Matching Across Images and Graph · ICDE 2025
Data mining › anomaly detection
outlier explanation
0.912025
Large Language Models can Deliver Accurate and Interpretable Time Series Anomaly Detection · KDD (2) 2025
Data mining
time series analysis
0.912025
Large Language Models can Deliver Accurate and Interpretable Time Series Anomaly Detection · KDD (2) 2025
Data mining › anomaly detection
time series anomaly detection
0.912025
Large Language Models can Deliver Accurate and Interpretable Time Series Anomaly Detection · KDD (2) 2025
Computer vision › Vision and language
visual question answering
0.812024
Across Images and Graphs for Question Answering · ICDE 2024
Natural language and speech › Language models and text generation
in-context learning
0.312025
Large Language Models can Deliver Accurate and Interpretable Time Series Anomaly Detection · KDD (2) 2025

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

retrieval of similar segments · 1.7in-context learning · 1.7chain-of-thought · 1.7query graph parsing · 1.5graph query engine · 1.5exploration-then-refinement · 0.9cross-modal representation learning · 0.9adaptive neighborhood sampling · 0.9
YearPublicationVenuePosition
2025 CrossETR: A Semantic-Driven Framework for Entity Matching Across Images and Graph
abstract
Entity matching (EM) aims to identify whether two entities from different data sources refer to the same real-world entity. Most existing cross-modal EM assume that images have simple scenes containing few objects, or do not fully consider the cross-modal knowledge associated with entities. To support more practical application scenarios such as multi-modal knowledge graph integration and visual question answering in data lakes, we introduce our problem of semantic-driven EM across graph and images in this paper. Current semantically matching solutions over cross-modal data face the obstacle of low training efficiency, since their time complexity quadratically grows with the number of entities. To alleviate this issue, we present a novel framework (namely CrossETR) that follows an exploration-then-refinement paradigm. Firstly, a candidate exploration policy is proposed to boost the training efficiency. It explores candidate pairs according to entity correlations and captures structural semantics by adaptive sampling the most informative neighborhood subgraphs. Secondly, the cross-modal entity representations are refined to break modality heterogeneity to support unsupervised matching prediction. Extensive experimental evaluations on three publicly available benchmarks demonstrate the superiority of CrossETR over state-of-the-art approaches in terms of effectiveness and efficiency. Furthermore, a case study highlights that our proposed semantic-driven EM is promising to improve the performance of downstream tasks such as multi-modal knowledge graph integration.
Qin Yuan 0001, Zhenyu Wen, Jiaxu Qian, Ye Yuan 0001, Guoren Wang
ICDE3
2025 Large Language Models can Deliver Accurate and Interpretable Time Series Anomaly Detection
abstract
Time series anomaly detection (TSAD) plays a crucial role in various industrial applications. Traditional deep learning TSAD models require extensive training data and operate as black boxes, lacking interpretability for detected anomalies. To address these challenges, we propose LLMAD, a novel TSAD method that employs Large Language Models (LLMs) to deliver accurate and interpretable TSAD results. LLMAD applies in-context anomaly detection by retrieving both positive and negative similar time series segments, significantly enhancing LLMs' effectiveness. Furthermore, LLMAD employs the Anomaly Detection Chain-of-Thought approach to mimic expert logic for its decision-making process. This further enhances its performance and enables LLMAD to provide explanations for their detections through versatile perspectives.
Chaoyun Zhang, Jiaxu Qian, Minghua Ma, Si Qin, Chetan Bansal, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang 0001
KDD (2)3
2024 Across Images and Graphs for Question Answering
abstract
Cross-source query serves as a proxy for scene understanding to support many web applications such as rec-ommendation systems, e-commerce, and e-learning applications. In this paper, we propose SVQA that semantically combines the knowledge from available images and graphs to answer the complex question. To this end, we design a graph-based method to unify various data sources into one representation. We then develop a complex question parse method that utilizes the structure of languages to transform the query into a query graph. A graph query engine that performs the query graph over the unified data source while optimizing the query process. To evaluate the proposed system, we build a vanilla dataset called MVQA and show that the state-of-the-art (SOTA) VQA models fail to perform our task. The comprehensive evaluations show that the proposed SVQA is able to reason implicit relationships over multiple images and external knowledge to correctly answer a complex query. We hope that our first attempt provides researchers with a fresh taste of multimodal data analysis.
Zhenyu Wen, Jiaxu Qian, Bin Qian 0002, Qin Yuan 0001, Jianbin Qin, Ye Yuan 0001
ICDE2
2024 PathMLP: Smooth path towards high-order homophily
Jiajun Zhou 0003, Chenxuan Xie, Shengbo Gong, Jiaxu Qian, Shanqing Yu, Qi Xuan 0001, Xiaoniu Yang
Neural Networks4