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

Yanlin Song

dblp:307/1012 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
Question answering and dialogue systems · 50% Language models and text generation · 50%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Question answering and dialogue systems
knowledge base question answering
1.012026
Plan Then Retrieve: Reinforcement Learning-Guided Complex Reasoning over Knowledge Graphs · WWW 2026
Natural language and speech › Language models and text generation › large language model reasoning
multi-step reasoning
1.012026
Plan Then Retrieve: Reinforcement Learning-Guided Complex Reasoning over Knowledge Graphs · WWW 2026
Knowledge graphs
knowledge graph retrieval
0.312026
Plan Then Retrieve: Reinforcement Learning-Guided Complex Reasoning over Knowledge Graphs · WWW 2026

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

reinforcement fine-tuning · 2.0large language model · 2.0chain-of-thought · 2.0GRPO · 2.0
YearPublicationVenuePosition
2026 Plan Then Retrieve: Reinforcement Learning-Guided Complex Reasoning over Knowledge Graphs
abstract
Knowledge Graph Question Answering (KGQA) aims to answer natural language questions by reasoning over structured knowledge graphs (KGs). While large language models (LLMs) have advanced KGQA through their strong reasoning capabilities, existing methods continue to struggle to fully exploit both the rich knowledge encoded in KGs and the reasoning capabilities of LLMs, particularly in complex scenarios. They often assume complete KG coverage and lack mechanisms to judge when external information is needed, and their reasoning remains locally myopic, failing to maintain coherent multi-step planning, leading to reasoning failures even when relevant knowledge exists. We propose Graph-RFT, a novel two-stage reinforcement fine-tuning KGQA framework with a ''plan–KGsearch–and–Websearch–during–think'' paradigm, that enables LLMs to perform autonomous planning and adaptive retrieval scheduling across KG and web sources under incomplete knowledge conditions. Graph-RFT introduces a chain-of-thought (CoT) fine-tuning method with a customized plan–retrieval dataset activates structured reasoning and resolves the GRPO cold-start problem. It then introduces a novel plan–retrieval guided reinforcement learning process integrates explicit planning and retrieval actions with a multi-reward design, enabling coverage-aware retrieval scheduling. It employs a Cartesian-inspired planning module to decompose complex questions into ordered sub-questions, and logical expression to guide tool invocation for globally consistent multi-step reasoning. This reasoning–retrieval process is optimized with a multi-reward combining outcome and retrieval-specific signals, enabling the model to learn when and how to combine KG and web retrieval effectively. Experiments on multiple KGQA benchmarks demonstrate that Graph-RFT achieves superior performance over strong baselines, even with smaller LLM backbones, and substantially improves complex question decomposition, factual coverage, and tool coordination.
Yanlin Song, Ben Liu 0002, Víctor Gutiérrez-Basulto, Zhiwei Hu, Qianqian Xie, Min Peng 0002, Sophia Ananiadou, Jeff Z. Pan
WWW1
2026 MFC4POI: Multi-factor collaboration for next point-of-interest recommendation using large language models
Yanlin Song, Lei Liu 0072, Prayag Tiwari, Gang Tian, Qianqian Xie, Min Peng 0002
Inf. Process. Manag.1
2025 UniPoll: A Unified Social Media Poll Generation Framework via Multiobjective Optimization
abstract
Social media platforms are vital for expressing opinions and understanding public sentiment, yet many analytical tools overlook passive users who mainly consume content without engaging actively. To address this, we introduce UniPoll, an advanced framework designed to automatically generate polls from social media posts using sophisticated natural language generation (NLG) techniques. Unlike traditional methods that struggle with social media's informal and context-sensitive nature, UniPoll leverages enriched contexts from user comments and employs multiobjective optimization to enhance poll relevance and engagement. To tackle the inherently noisy nature of social media data, UniPoll incorporates retrieval-augmented generation (RAG) and synthetic data generation, ensuring robust performance across real-world scenarios. The framework surpasses existing models, including T5, ChatGLM3, and GPT-3.5, in generating coherent and contextually appropriate question-answer pairs. Evaluated on the Chinese WeiboPolls dataset and the newly introduced English RedditPolls dataset, UniPoll demonstrates superior cross-lingual and cross-platform capabilities, making it a potent tool to boost user engagement and create a more inclusive environment for interaction.
Yixia Li, Rong Xiang, Yanlin Song, Jing Li 0049
IEEE Trans. Neural Networks Learn. Syst.3