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

Can Yi

dblp:273/0700 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0009-0002-8886-7276ORCID · reported

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

Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 67% Knowledge graphs · 33%
Artificial intelligence
1 paper
Language models and text generation · 50% Reinforcement learning · 50%
Network and information security
1 paper
Web and mobile security · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
retrieval-augmented generation
1.012026
Careful Queries, Credible Results: Teaching RAG Models Advanced Web Search Tools with Reinforcement Learning · AAAI 2026
Machine learning › Reinforcement learning › reward design
reward shaping
1.012026
Careful Queries, Credible Results: Teaching RAG Models Advanced Web Search Tools with Reinforcement Learning · AAAI 2026
Data mining
anomaly detection
1.012026
Tabular Foundation Models are Strong Graph Anomaly Detectors · WWW 2026
Data mining › anomaly detection
graph anomaly detection
1.012026
Tabular Foundation Models are Strong Graph Anomaly Detectors · WWW 2026
Web and mobile security
misinformation
0.312026
Careful Queries, Credible Results: Teaching RAG Models Advanced Web Search Tools with Reinforcement Learning · AAAI 2026

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

source-restricted query generation · 2.0retrieval filtering · 2.0reinforcement learning · 2.0tabular foundation models · 1.0laplacian embedding · 1.0in-context learning · 1.0
YearPublicationVenuePosition
2026 Careful Queries, Credible Results: Teaching RAG Models Advanced Web Search Tools with Reinforcement Learning
abstract
Retrieval-Augmented Generation (RAG) enhances large language models (LLMs) by integrating up-to-date external knowledge, yet real-world web environments present unique challenges. These limitations manifest as two key challenges: pervasive misinformation in the web environment, which introduces unreliable or misleading content that can degrade retrieval accuracy, and the underutilization of web tools, which, if effectively employed, could enhance query precision and help mitigate this noise, ultimately improving retrieval results in RAG systems. To address these issues, we propose WebFilter, a novel RAG framework that generates source-restricted queries and filters out unreliable content. This approach combines a retrieval filtering mechanism with a behavior- and outcome-driven reward strategy, optimizing both query formulation and retrieval outcomes. Extensive experiments demonstrate that WebFilter improves answer quality and retrieval precision, outperforming existing RAG methods on both in-domain and out-of-domain benchmarks.
Yuqin Dai, Shuo Yang 0011, Zhanwei Zhang, Pengyu Zeng, Zhenzhe Ying, Changhua Meng, Can Yi, Weiqiang Wang 0002
AAAI10
2026 Tabular Foundation Models are Strong Graph Anomaly Detectors
abstract
Graph anomaly detection (GAD), which aims to identify abnormal nodes that deviate from the majority, has become increasingly important in high-stakes Web domains. However, existing GAD methods follow a ''one model per dataset'' paradigm, leading to high computational costs, substantial data demands, and poor generalization when transferred to new datasets. This calls for a foundation model that enables a ''one-for-all'' GAD solution capable of detecting anomalies across diverse graphs without retraining. Yet, achieving this is challenging due to the large structural and feature heterogeneity across domains. In this paper, we propose TFM4GAD, a simple yet effective framework that adapts tabular foundation models (TFMs) for graph anomaly detection. Our key insight is that the core challenges of foundation GAD, handling heterogeneous features, generalizing across domains, and operating with scarce labels, are the exact problems that modern TFMs are designed to solve via synthetic pre-training and powerful in-context learning. The primary challenge thus becomes structural: TFMs are agnostic to graph topology. TFM4GAD bridges this gap by ''flattening'' the graph, constructing an augmented feature table that enriches raw node features with Laplacian embeddings, local and global structural characteristics, and anomaly-sensitive neighborhood aggregations. This augmented table is processed by a TFM in a fully in-context regime. Extensive experiments on multiple datasets with various TFM backbones reveal that TFM4GAD surprisingly achieves significant performance gains over specialized GAD models trained from scratch. Our work offers a new perspective and a practical paradigm for leveraging TFMs as powerful, generalist graph anomaly detectors.
Yunhui Liu 0002, Tieke He, Yongchao Liu 0004, Can Yi, Chuntao Hong
WWW4
2026 Adaptive and scalable traffic accident detection in dynamic and resource-constrained surveillance environments
Zhongsheng Tang, Xianfeng Ye, Liangyi Yang, Can Yi
Pattern Recognit.5
2025 AIGT: AI Generative Table Based on Prompt
abstract
Tabular data, which accounts for over 80% of enterprise data assets, is vital in various fields. With growing concerns about privacy protection and data-sharing restrictions, generating high-quality synthetic tabular data has become essential. Recent advancements show that large language models (LLMs) can effectively generate realistic tabular data by leveraging semantic information and overcoming the challenges of high-dimensional data that arise from one-hot encoding. However, current methods do not fully utilize the rich information available in tables. To address this, we introduce AI Generative Table based on prompt enhancement, a novel approach that utilizes metadata information, such as table descriptions and schemas, as prompts to generate ultra-high-quality synthetic data. To overcome the token limit constraints of LLMs, we propose long-token partitioning algorithms that enable AIGT to model tables of any scale. AIGT achieves state-of-the-art performance on 14 out of 20 public datasets and two real industry datasets within the Alipay risk control system.
Zhiqing Xiao, Guoshan Lu, Sai Wu, Weiqiang Wang 0002, Can Yi, Junbo Zhao 0002
COLING7