Lyuzhou Chen

Lyuzhou Chen

Auto-generated profile, based on publicly available information

Lyuzhou Chen

School of Computer Science and Technology, University of Science and Technology of China, Hefei, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
13 January 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
TBTaiyu Ban
Taiyu Ban
LCLyuzhou Chen
Lyuzhou Chen
DLDerui Lyu
Derui Lyu
XWXiangyu Wang
Xiangyu Wang
QZQinrui Zhu
Qinrui Zhu
HCHuanhuan Chen
Huanhuan Chen
Traditional domain-specific causal discovery relies on expert knowledge to guide the data-based structure learning process, thereby improving the reliability of recovered causality. Recent studies have shown promise in using the Large Language Model (LLM) as causal experts to construct autonomous expert-guided causal discovery systems through causal reasoning between pairwise variables. However, their performance is hampered by inaccuracies in aligning LLM-derived causal knowledge with the actual causal structure. To address this issue, this paper proposes a novel LLM-driven causal discovery framework that limits LLM’s prior within a reliable range. Instead of pairwise causal reasoning that requires both precise and comprehensive output results, the LLM is directed to focus on each single aspect separately. By combining these distinct causal insights, a unified set of structural constraints is created, termed a harmonized prior, which draws on their respective strengths to ensure prior accuracy. On this basis, we introduce plug-and-play integrations of the harmonized prior into mainstream categories of structure learning methods, thereby enhancing their applicability in practical scenarios. Evaluations on real-world data demonstrate the effectiveness of our approach.

4 February 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XWXiangyu Wang
Xiangyu Wang
TBTaiyu Ban
Taiyu Ban
LCLyuzhou Chen
Lyuzhou Chen
DLDerui Lyu
Derui Lyu
QZQinrui Zhu
Qinrui Zhu
HCHuanhuan Chen
Huanhuan Chen
Causal discovery faces significant challenges as the number of hypotheses grows exponentially with the number of variables. This complexity becomes particularly daunting when dealing with large sets of variables. We introduce a novel divide-and-conquer method that uniquely handles this challenge. The existing division strategies often rely on conditional independency (CI) tests or data-driven clustering to split variables, which can suffer from the typical data scarcity in large-scale settings, thus leading to inaccurate division results. The proposed method overcomes this by implementing a data-independent division strategy, which constructs a prior structure, informed by potential causal relationships identified using a Large Language Model (LLM), to guide recursively dividing variables into sub-sets. This approach avoids the impact of data insufficiency and is robust against potential incompleteness in the prior structure. In the merging phase, we adopt a score-based refinement strategy to address fake causal links caused by hidden variables in sub-sets, which eliminates edges in the intersected parts of sub-sets to optimize the score of local structures. While maintaining both correctness and completeness under the faithfulness assumption, this novel merging approach demonstrates enhanced performance than the conventional CI-test based merging strategy in practical scenarios. Empirical evaluations on various large-scale datasets demonstrate the proposed approach's superior accuracy and efficiency compared to existing causal discovery methods.

4 July 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
TBTaiyu Ban
Taiyu Ban
XWXiangyu Wang
Xiangyu Wang
LCLyuzhou Chen
Lyuzhou Chen
XWXingyu Wu
Xingyu Wu
QCQiuju Chen
Qiuju Chen
HCHuanhuan Chen
Huanhuan Chen
The evaluation of knowledge quality (KQ) in multisource knowledge graphs (KGs) is an essential step for many applications, such as fragmented knowledge fusion and knowledge base construction. Many existing quality evaluation methods for multisource knowledge are based on validation from high-quality knowledge bases or statistical analysis of knowledge related to a specific fact from multiple sources, named external consistency (EC)-based methods. However, high-quality KGs are difficult to obtain, and there might exist incorrect knowledge in multisource KGs interfering with KQ evaluation. To address the issue, this article refers to the internal structure of a KG to evaluate the degree to which the contained triples conform to the overall semantic pattern of the KG, such as KG embedding and logic inference-based approaches, defined as internal consistency (IC) evaluation. The IC is integrated with the EC to identify possible incorrect triples and reduce their influences on the KQ evaluation, thus alleviating the interference of incorrect knowledge. The proposed method is verified with multiple datasets, and the results demonstrate that the proposed method could significantly reduce wrong evaluations caused by incorrect knowledge and effectively improve the quality evaluation of triples.

1 February 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
XWXiangyu Wang
Xiangyu Wang
LCLyuzhou Chen
Lyuzhou Chen
TBTaiyu Ban
Taiyu Ban
DLDerui Lyu
Derui Lyu
YGYifeng Guan
Yifeng Guan
HCHuanhuan Chen
Huanhuan Chen
The Remote Sensing (RS) field has an increasing research interest in using deep learning (DL) models to recognize kinds of RS data, leading to a great demand for training data annotation. Due to the high cost of expertise, employing non-experts to label data has become an important way to improve labeling efficiency. Commonly, a single data sample is labeled by multiple annotators and the most voted label is accepted to promise accuracy. But in the RS context, the widely admitted strategy could lose effect. Usually RS data involves considerable classes on account of the complexity of surface environments, which is prone to inter-class similarity difficult to distinguish. Annotators without expertise probably make mistakes on these indistinguishable classes, thus causing error voted labels. Although classification of different characteristics in RS data have been widely documented, the non-expert annotators are unfamiliar with these expertise, and it is difficult to force them to handle specialized labeling skills. To address the issues, this paper bases multi-annotator label selection on the investigation of annotators’ own ability in distinguishing similar classes of images. A quality evaluation process is designed which weights the labels from capable annotators higher than those from weak ones. By a multi-round quality evaluation algorithm, correct labels could out-compete the wrong ones even disadvantaged in numbers. Experimental results demonstrate the advance of the proposed method on RS datasets.

9 September 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XWXiangyu Wang
Xiangyu Wang
TBTaiyu Ban
Taiyu Ban
LCLyuzhou Chen
Lyuzhou Chen
XWXingyu Wu
Xingyu Wu
DLDerui Lyu
Derui Lyu
HCHuanhuan Chen
Huanhuan Chen
Knowledge verification is an important task in the quality management of knowledge graphs (KGs). Knowledge is a summary of facts and events based on human cognition and experience. Due to the nature of knowledge, most knowledge quality (KQ) management methods are designed by human experts or the characteristics of existing knowledge, which may be limited by human cognition and the quality of existing knowledge. Numerical data contain a wealth of potential information that may be helpful in verifying knowledge, which is rarely explored. However, due to the implicit representation of numerical data to facts as well as the noise in the data, it is challenging to use data to verify the knowledge. Therefore, this article proposes a knowledge verification method, which discovers the correlation and causality from numerical data to validate knowledge and then evaluate the quality of knowledge. Moreover, to address the impact of noise, the method integrates multisource knowledge to jointly evaluate the KQ. Specifically, an iterative update method is designed to update KQ by utilizing the consistency between multisource knowledge while designing knowledge verification factors based on data causality and correlation to manage update process. The method is validated with multiple datasets, and the results demonstrate that the proposed method could evaluate KQ more accurately and has strong robustness to noise in the data.

16 April 2025 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
TBTaiyu Ban
Taiyu Ban
LCLyuzhou Chen
Lyuzhou Chen
DLDerui Lyu
Derui Lyu
XWXiangyu Wang
Xiangyu Wang
QZQinrui Zhu
Qinrui Zhu
HCHuanhuan Chen
Huanhuan Chen
Recovering the structure of causal graphical models from observational data is an essential yet challenging task for causal discovery in scientific scenarios. Domain-specific causal discovery usually relies on expert validation or prior analysis to improve the reliability of recovered causality, which is yet limited by the scarcity of expert resources. Recently, Large Language Models (LLM) have been used for causal analysis across various domain-specific scenarios, suggesting its potential as autonomous expert roles in guiding data-based structure learning. However, integrating LLMs into causal discovery faces challenges due to inaccuracies in LLM-based reasoning on revealing the actual causal structure. To address this challenge, we propose an error-tolerant LLM-driven causal discovery framework. The error-tolerant mechanism is designed three-fold with sufficient consideration on potential inaccuracies. In the LLM-based reasoning process, an accuracy-oriented prompting strategy restricts causal analysis to a reliable range. Next, a knowledge-to-structure transition aligns LLM-derived causal statements with structural causal interactions. In the structure learning process, the goodness-of-fit to data and adherence to LLM-derived priors are balanced to further address prior inaccuracies. Evaluation of eight real-world causal structures demonstrates the efficacy of our LLM-driven approach in improving data-based causal discovery, along with its robustness to inaccurate LLM-derived priors. Codes are available at https://github.com/tyMadara/LLM-CD.