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 Feng

dblp:242/4247 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2025
0009-0003-8436-5321ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 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.

Databases, data mining, and information retrieval
1 paper
Data models and query languages · 67% Knowledge graphs · 33%
Artificial intelligence
2 papers
Language models and text generation · 61% Question answering and dialogue systems · 30% Knowledge representation and reasoning · 9%

Topics — the 6 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
0.912025
CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era · ACL (1) 2025
Data models and query languages › graph query language › property graph query language
cypher
0.912025
CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era · ACL (1) 2025
Knowledge graphs › knowledge graph querying
knowledge graph question answering
0.912025
CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era · ACL (1) 2025
Data models and query languages
query language
0.912025
CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era · ACL (1) 2025
Natural language and speech › Question answering and dialogue systems
knowledge-intensive question answering
0.412020
Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering · EMNLP (1) 2020
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph reasoning
0.112020
Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering · EMNLP (1) 2020

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

text-to-cypher generation · 1.7RDF-to-property graph conversion · 1.7path-based reasoning · 0.4graph neural network · 0.4
YearPublicationVenuePosition
2025 CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era
abstract
Retrieval from graph data is crucial for augmenting large language models (LLM) with both open-domain knowledge and private enterprise data, and it is also a key component in the recent GraphRAG system (Edge et al., 2024).Despite decades of research on knowledge graphs and knowledge base question answering, leading LLM frameworks (e.g., Langchain and LlamaIndex) have only minimal support for retrieval from modern encyclopedic knowledge graphs like Wikidata.In this paper, we analyze the root cause and suggest that modern RDF knowledge graphs (e.g., Wikidata, Freebase) are less efficient for LLMs due to overly large schemas that far exceed the typical LLM context window, use of resource identifiers, overlapping relation types and lack of normalization.As a solution, we propose property graph views on top of the underlying RDF graph that can be efficiently queried by LLMs using Cypher.We instantiated this idea on Wikidata and introduced CypherBench, the first benchmark with 11 large-scale, multi-domain property graphs with 7.8 million entities and over 10,000 questions.To achieve this, we tackled several key challenges, including developing an RDF-to-property graph conversion engine, creating a systematic pipeline for textto-Cypher task generation, and designing new evaluation metrics.
Yanlin Feng, Simone Papicchio, Sajjadur Rahman
ACL (1)1
2020 Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering
abstract
Existing work that augment question answering (QA) models with external knowledge (e.g., knowledge graphs) either struggle to model multi-hop relations efficiently, or lack transparency into the model's prediction rationale.In this paper, we propose a novel knowledge-aware approach that equips pretrained language models (PTLMs) with a multi-hop relational reasoning module, named multi-hop graph relation network (MHGRN).It performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs.The proposed reasoning module unifies path-based reasoning methods and graph neural networks and results in better interpretability and scalability.We also empirically show its effectiveness and scalability on CommonsenseQA and OpenbookQA datasets, and interpret its behaviors with case studies, with the code for experiments released 1 .
Yanlin Feng, Bill Y. Lin, Peifeng Wang, Jun Yan 0012, Xiang Ren 0001
EMNLP (1)1
2019 Towards a Unified End-to-End Approach for Fully Unsupervised Cross-Lingual Sentiment Analysis
abstract
Sentiment analysis in low-resource languages suffers from the lack of training data.Crosslingual sentiment analysis (CLSA) aims to improve the performance on these languages by leveraging annotated data from other languages.Recent studies have shown that CLSA can be performed in a fully unsupervised manner, without exploiting either target language supervision or cross-lingual supervision.However, these methods rely heavily on unsupervised cross-lingual word embeddings (CLWE), which has been shown to have serious drawbacks on distant language pairs (e.g.English -Japanese).In this paper, we propose an end-to-end CLSA model by leveraging unlabeled data in multiple languages and multiple domains and eliminate the need for unsupervised CLWE.Our model applies to two CLSA settings: the traditional cross-lingual in-domain setting and the more challenging cross-lingual cross-domain setting.We empirically evaluate our approach on the multilingual multi-domain Amazon review dataset.Experimental results show that our model outperforms the baselines by a large margin despite its minimal resource requirement. 1
Yanlin Feng, Xiaojun Wan 0001
CoNLL1