<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0642813</ARLID> <utime>20260213094651.3</utime><mtime>20251209235959.9</mtime>   <SCOPUS>105018304037</SCOPUS>  <DOI>10.1007/978-3-032-05134-9_8</DOI>           <title language="eng" primary="1">From RBMs to BN2A Models: Parameter Transformation for Interpretable Educational Diagnostics</title>  <specification> <page_count>14 s.</page_count> <media_type>P</media_type> </specification>    <serial><ARLID>cav_un_epca*0639225</ARLID><ISBN>978-3-032-05133-2</ISBN><ISSN>0302-9743</ISSN><title>Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2025 Proceedings</title><part_num/><part_title/><page_num>104-117</page_num><publisher><place>Cham</place><name>Springer</name><year>2026</year></publisher><editor><name1>Sauerwald </name1><name2>K.</name2></editor><editor><name1>Thimm</name1><name2>M.</name2></editor></serial>    <keyword>Restricted Boltzmann Machines</keyword>   <keyword>BN2A models</keyword>   <keyword>Educational Assessment</keyword>   <keyword>Interpretable machine learning</keyword>    <author primary="1"> <ARLID>cav_un_auth*0458433</ARLID> <name1>Pérez Cabrera</name1> <name2>Iván</name2> <institution>UTIA-B</institution> <full_dept language="cz">Zpracování signálů</full_dept> <full_dept language="eng">Department of Signal Processing</full_dept> <department language="cz">ZS</department> <department language="eng">ZS</department> <country>MX</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101228</ARLID> <name1>Vomlel</name1> <name2>Jiří</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <full_dept>Department of Decision Making Theory</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0226898</ARLID> <name1>Martinková</name1> <name2>P.</name2> <country>CZ</country> </author>   <source> <url>https://library.utia.cas.cz/separaty/2025/ZS/perez-0642813.pdf</url> </source>        <cas_special> <project> <project_id>GA25-18070S</project_id> <agency>GA ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0484465</ARLID> </project>  <abstract language="eng" primary="1">Restricted Boltzmann Machines (RBMs) are bipartite graphical models with binary latent and observed variables that have shown promise for representation learning. However, their lack of interpretable parameters limits their utility in domains requiring explainability, like educational assessment. Despite extensive RBM research, non-negativity constraints on weights—essential for monotonicity in educational contexts—remain largely unexplored. To address this, we propose a method to translate RBMs into a specialized class of bipartite Bayesian networks, which we term BN2A networks, characterized by strict 2-layer separation (hidden and observed variables), Noisy-AND conditional probability tables, and directly interpretable parameters for educational models. Our work establishes a mathematical transformation from RBM weights to BN2A’s interpretable parameters (leak and penalty probabilities), theoretical analysis showing BN2A’s constrained connectivity is a subset of RBM architectures, and empirical evidence that the transformation preserves model fidelity under realistic conditions. By bridging these paradigms, our method leverages RBM’s representational power while achieving BN2A’s interpretability, opening new possibilities for adaptive learning systems and diagnostic tools.</abstract>    <action target="WRD"> <ARLID>cav_un_auth*0498692</ARLID> <name>European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2025 /19./</name> <dates>20250923</dates> <unknown tag="mrcbC20-s">20250926</unknown> <place>Hagen</place> <country>DE</country>  </action>    <reportyear>2027</reportyear>  <RIV>IN</RIV>    <FORD0>10000</FORD0> <FORD1>10200</FORD1> <FORD2>10201</FORD2>  <presentation_type> PR </presentation_type> <inst_support> RVO:67985556 </inst_support>  <permalink>https://hdl.handle.net/11104/0372668</permalink>   <confidential>S</confidential>         <arlyear>2026</arlyear>       <unknown tag="mrcbU14"> 105018304037 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0639225 Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2025 Proceedings Springer 2026 Cham 104 117 978-3-032-05133-2 Lecture Notes in Artificial Intelligence 16099 0302-9743 </unknown> <unknown tag="mrcbU67"> Sauerwald K. 340 </unknown> <unknown tag="mrcbU67"> Thimm M. 340 </unknown> </cas_special> </bibitem>