Weining Qian

Weining Qian

Auto-generated profile, based on publicly available information

Weining Qian

East China Normal University, Shanghai, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2023
Verified
Conference Paper
Open access
PDF file
YLYuanyuan Liang
Yuanyuan Liang
JWJianing Wang
Jianing Wang
HZHanlun Zhu
Hanlun Zhu
LWLei Wang
Lei Wang
WQWeining Qian
Weining Qian
YLYunshi Lan
Yunshi Lan
Yuanyuan Liang, Jianing Wang, Hanlun Zhu, Lei Wang, Weining Qian, Yunshi Lan. Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing. 2023.

25 May 2018
Verified
Conference Paper
Open access
PDF file
YPYanqing Peng
Yanqing Peng
JGJinwei Guo
Jinwei Guo
FLFeifei Li
Feifei Li
WQWeining Qian
Weining Qian
AZAoying Zhou
Aoying Zhou
Membership testing is the problem of testing whether an element is in a set of elements. Performing the test exactly is expensive space-wise, requiring the storage of all elements in a set. In many applications, an approximate testing that can be done quickly using small space is often desired. Bloom filter (BF) was designed and has witnessed great success across numerous application domains. But there is no compact structure that supports set membership testing for temporal queries, e.g., has person A visited a web server between 9:30am and 9:40am? And has the same person visited the web server again between 9:45am and 9:50am? It is possible to support such "temporal membership testing" using a BF, but we will show that this is fairly expensive. To that end, this paper designs persistent bloom filter (PBF), a novel data structure for temporal membership testing with compact space.

26 October 2023
Verified
Conference Paper
Open access
YLYunshi Lan
Yunshi Lan
XLXiang Li
Xiang Li
XLXin Liu
Xin Liu
YLYang Li
Yang Li
WQWei Qin
Wei Qin
WQWeining Qian
Weining Qian
Zero-shot Visual Question Answering (VQA) is a prominent vision-language task that examines both the visual and textual understanding capability of systems in the absence of training data. Recently, by converting the images into captions, information across multi-modalities is bridged and Large Language Models (LLMs) can apply their strong zero-shot generalization capability to unseen questions. To design ideal prompts for solving VQA via LLMs, several studies have explored different strategies to select or generate question-answer pairs as the exemplar prompts, which guide LLMs to answer the current questions effectively. However, they totally ignore the role of question prompts. The original questions in VQA tasks usually encounter ellipses and ambiguity which require intermediate reasoning. To this end, we present Reasoning Question Prompts for VQA tasks, which can further activate the potential of LLMs in zero-shot scenarios. Specifically, for each question, we first generate self-contained questions as reasoning question prompts via an unsupervised question edition module considering sentence fluency, semantic integrity and syntactic invariance. Each reasoning question prompt clearly indicates the intent of the original question. This results in a set of candidate answers. Then, the candidate answers associated with their confidence scores acting as answer heuristics are fed into LLMs and produce the final answer. We evaluate reasoning question prompts on three VQA challenges, experimental results demonstrate that they can significantly improve the results of LLMs on zero-shot setting and outperform existing state-of-the-art zero-shot methods on three out of four data sets. Our source code is publicly released at https://github.com/ECNU-DASE-NLP/RQP.

14 October 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YLYunshi Lan
Yunshi Lan
XLXinyuan Li
Xinyuan Li
HDHanyue Du
Hanyue Du
XLXuesong Lu
Xuesong Lu
MGMing Gao
Ming Gao
AZAoying Zhou
Aoying Zhou
Natural Language Processing (NLP) aims to analyze text or speech via techniques in the computer science field. It serves applications in the domains of healthcare, commerce, education, and so on. Particularly, NLP has been widely applied to the education domain and its applications have enormous potential to help teaching and learning. In this survey, we review recent advances in NLP with a focus on solving problems relevant to the education domain. In detail, we begin with introducing the related background and the real-world scenarios in education to which NLP techniques could contribute. Then, we present a taxonomy of NLP in the education domain and highlight typical NLP applications including question answering, question construction, automated assessment, and error correction. Next, we illustrate the task definition, challenges, and corresponding cutting-edge techniques based on the above taxonomy. In particular, LLM-involved methods are included for discussion due to the wide usage of LLMs in diverse NLP applications. After that, we showcase some off-the-shelf demonstrations in this domain, which are designed for educators or researchers. At last, we conclude with five promising directions for future research, including generalization over subjects and languages, deployed LLM-based systems for education, adaptive learning for teaching and learning, interpretability for education, and ethical consideration of NLP techniques.

21 October 2024
Verified
Conference Paper
Open access
YLYuanyuan Liang
Yuanyuan Liang
KTKeren Tan
Keren Tan
TXTingyu Xie
Tingyu Xie
WTWenbiao Tao
Wenbiao Tao
SWSiyuan Wang
Siyuan Wang
WQWeining Qian
Weining Qian
Graph Databases (Graph DB) find extensive application across diverse domains such as finance, social networks, and medicine. Yet, the translation of Natural Language (NL) into the Graph Query Language (GQL), referred to as NL2GQL, poses significant challenges owing to its intricate and specialized nature. Some approaches have sought to utilize Large Language Models (LLMs) to address analogous tasks like text2SQL. Nonetheless, in the realm of NL2GQL tasks tailored to a particular domain, the absence of domain-specific NL-GQL data pairs adds complexity to aligning LLMs with the graph DB. To tackle this challenge, we present a well-defined pipeline. Initially, we use ChatGPT to generate NL-GQL data pairs, leveraging the provided graph DB and two mutual verification self-instruct methods which ensure consistency between NL and GQL. Subsequently, we employ the generated data to fine-tune LLMs, ensuring alignment between LLMs and the graph DB. Moreover, we find the importance of relevant schema in efficiently generating accurate GQLs. Thus, we introduce a method to extract relevant schema as the input context. We evaluate our method using two carefully constructed datasets derived from graph DBs in the finance and medicine domains, named FinGQL and MediGQL. Experimental results reveal that our approach significantly outperforms a set of baseline methods, with improvements of 5.90 and 6.36 absolute points on EM, and 6.00 and 7.09 absolute points on EX for FinGQL and MediGQL, respectively

22 August 2024
Verified
Book Chapter
Closed access
PDF file
ZDZhongjie Duan
Zhongjie Duan
LYLizhou You
Lizhou You
CWChengyu Wang
Chengyu Wang
CCCen Chen
Cen Chen
ZWZiheng Wu
Ziheng Wu
JHJun Huang
Jun Huang