BIRDNet 解决了深度神经网络可解释性与稀疏性的矛盾，做生物信息学或知识图谱的团队可以直接用它的开源代码，在保持高精度的同时获得可读的规则。
BIRDNet 是一种新型神经网络架构，通过挖掘特征间的布尔蕴含关系（BIR）构建知识图，并将其编码为网络连接。该方法使用稀疏异常二项检验挖掘关系，形成有向图，等价于命题规则库。BIRDNet 的每层隐藏单元对应一条规则，仅连接两个特征，因此架构天然稀疏，最多只有 2/d 的权重活跃。模型保持可解释性，每个训练单元保留稳定的符号身份，规则可直接从网络读取。在六个转录组和蛋白质组基准测试中，BIRDNet 在 AUROC 上仅比最强基线低 0.02，但活跃参数减少高达 96 倍，且第一层规则能恢复已知生物标志物。
BIRDNet: Mining and Encoding Boolean Implication Knowledge Graphs as Interpretable Deep Neural Networks
Tabular data in knowledge-rich domains often carries a latent prior in the form of Boolean implication relationships (BIRs) between pairs of features. We mine such relationships with a sparse-exception binomial test. The mined implications form a typed directed graph, equivalent to a propositional rule base of 2-literal clauses. We encode this graph as the connectivity of a layered neural network, called BIRDNet, in which each hidden unit corresponds to one mined rule and binds only to its two features. We show two consequences of this design: First, the architecture is sparse by construction: at most $2/d$ of the weights in each BIR layer are active, where $d$ is the input dimension. Second, the model is interpretable: every trained unit keeps a stable symbolic identity, so rules can be read off the network without surrogate models. Unlike most neurosymbolic models, BIRDNet does not consume an external rule base; its structural prior is mined from the data. We evaluate BIRDNet on six transcriptomic and proteomic benchmarks. Our results show that BIRDNet stays within 0.02 AUROC of the strongest dense baseline, at a small accuracy cost, while using up to $96\times$ fewer active parameters than an architecture-matched dense MLP. First-layer rules recover known biological signatures across multiple cancer subtypes and tissue types, including canonical amplicons, lineage-defining co-expression modules, and immune-infiltration markers. Data and code are available at: https://github.com/MAHI-Group/BIRDNet.