{"title":"Chain graphs structure learning given local background knowledge","authors":"Shujing Yang , Fuyuan Cao , Kui Yu , Jiye Liang","doi":"10.1016/j.ijar.2025.109524","DOIUrl":null,"url":null,"abstract":"<div><div>Chain graphs structure learning aims to identify and infer causal relations and symmetric association relations between variables in data. However, existing chain graphs structure learning algorithms cannot uniquely determine the causal relations from data among some variables due to the independence of these variables corresponding to multiple structures, making them only learn Markov equivalence classes of chain graphs. To alleviate this issue, we propose a <strong>C</strong>hain <strong>G</strong>raphs structure <strong>L</strong>earning algorithm <strong>G</strong>iven local background <strong>K</strong>nowledge (CGLGK). CGLGK initially learns the adjacencies and spouses of variables, constructs the skeleton of chain graphs using the adjacencies, corrects the connections between variables in the skeleton guided by local background knowledge, and orients the edges using the adjacencies and spouses to obtain the Markov equivalence classes of chain graphs. Next, CGLGK fuses local background knowledge with the learned Markov equivalence classes to obtain new knowledge. Finally, it utilizes the local valid orientation rule to orient edges within the Markov equivalence classes based on the updated knowledge, resulting in the final chain graphs structure. Meanwhile, we conducted the theoretical analysis to prove the correctness of CGLGK, and its effectiveness is verified by comparison with the classical and state-of-the-art algorithms on synthetic and real data.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"186 ","pages":"Article 109524"},"PeriodicalIF":3.0000,"publicationDate":"2025-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X25001653","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Chain graphs structure learning aims to identify and infer causal relations and symmetric association relations between variables in data. However, existing chain graphs structure learning algorithms cannot uniquely determine the causal relations from data among some variables due to the independence of these variables corresponding to multiple structures, making them only learn Markov equivalence classes of chain graphs. To alleviate this issue, we propose a Chain Graphs structure Learning algorithm Given local background Knowledge (CGLGK). CGLGK initially learns the adjacencies and spouses of variables, constructs the skeleton of chain graphs using the adjacencies, corrects the connections between variables in the skeleton guided by local background knowledge, and orients the edges using the adjacencies and spouses to obtain the Markov equivalence classes of chain graphs. Next, CGLGK fuses local background knowledge with the learned Markov equivalence classes to obtain new knowledge. Finally, it utilizes the local valid orientation rule to orient edges within the Markov equivalence classes based on the updated knowledge, resulting in the final chain graphs structure. Meanwhile, we conducted the theoretical analysis to prove the correctness of CGLGK, and its effectiveness is verified by comparison with the classical and state-of-the-art algorithms on synthetic and real data.
期刊介绍:
The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest.
Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning.
Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.