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

Letian Cheng

dblp:338/0608 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 33% Question answering and dialogue systems · 33% Graph learning · 33%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph reasoning
0.712023
CogKR: Cognitive Graph for Multi-Hop Knowledge Reasoning · IEEE Trans. Knowl. Data Eng. 2023
Natural language and speech › Question answering and dialogue systems
multi-hop reasoning
0.712023
CogKR: Cognitive Graph for Multi-Hop Knowledge Reasoning · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Graph learning › graph reasoning
subgraph reasoning
0.712023
CogKR: Cognitive Graph for Multi-Hop Knowledge Reasoning · IEEE Trans. Knowl. Data Eng. 2023
Knowledge graphs
link prediction
0.212023
CogKR: Cognitive Graph for Multi-Hop Knowledge Reasoning · IEEE Trans. Knowl. Data Eng. 2023

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

dual process theory · 1.3cognitive graph · 1.3
YearPublicationVenuePosition
2025 MVGText: Momentum and Variance Guided Hard-Label Text Test Case Generation
abstract
Deep neural network (DNN) based text intelligence softwares have proliferated and have been widely used. However, they face challenges such as robustness. Testing is essential to DNNs in real-world applications. Researchers have proposed various testing techniques for generating test cases. With the black-box hard-label setup where only the output label of the DNN is accessible, related studies mainly concentrated on generating the new text test case by iteratively perturbing single initial test case, which limits the effectiveness. To address this issue, this paper proposes a new text test case generation method MVGText (Momentum and Variance Guided hard-label Text test case generation) for text-oriented DNN, which generates high-quality text test cases by searching based on multiple initial test cases. Firstly, multiple initial text test cases are generated randomly, in which global fixed word replacement is employed to enhance the success rate. Then, momentum and variance are applied to guide the search for the more imperceptible test case. Finally, greedy optimization is used to obtain a higher quality test case. Experimental evaluation shows that MVGText achieves an average post-test success rate of 1.4%. Furthermore, the test cases generated by MVGText exhibit the highest similarity to the original text compared to other comparative methods.
Shunhui Ji, Changrong Huang, Letian Cheng, Pengcheng Zhang 0001
COMPSAC4
2025 Clean-label backdoor attack based on robust feature attenuation for speech recognition
Hanbo Cai, Pengcheng Zhang 0001, Yan Xiao 0002, Shunhui Ji, Mingxuan Xiao, Letian Cheng
Expert Syst. Appl.6
2023 CogKR: Cognitive Graph for Multi-Hop Knowledge Reasoning
abstract
Inferring new facts from an existing knowledge graph with explainable reasoning processes is an important problem, known as knowledge graph (KG) reasoning. The problem is often formulated as finding the specific path that represents the query relation and connects the query entity and the correct answer. However, due to the limited expressiveness of individual paths, the majority of previous works failed to capture the complex subgraph structure in the graph. We propose CogKR that traverses the knowledge graph to conduct multi-hop reasoning. More specifically, motivated by the dual process theory from cognitive science, our framework is composed of an extension module and a reasoning module. By setting up a cognitive graph through iteratively coordinating the two modules, CogKR can cope with more complex reasoning scenarios in the form of subgraphs instead of individual paths. Experiments on three knowledge graph reasoning benchmarks demonstrate that CogKR achieves significant improvements in accuracy compared with previous methods while providing the explainable capacity. Moreover, we evaluate CogKR on the challenging one-shot link prediction task, exhibiting the superiority of the framework on accuracy and scalability compared to the state-of-the-art approaches.
Zhengxiao Du, Chang Zhou 0005, Jiangchao Yao, Teng Tu 0002, Letian Cheng, Hongxia Yang, Jingren Zhou 0001, Jie Tang 0001
IEEE Trans. Knowl. Data Eng.5