Event Causal Relation Extraction in Brain Connectomics: A Model Utilizing Weighted Joint Constrained Learning
Bibliographic record
Abstract
Brain science research has entered the era of connectomics, characterized by a significant increase in published articles investigating brain structure and functional connections. Automatically and accurately extracting scientific evidence from these articles has become an urgent concern. Unlike early brain mechanism studies at the functional area level, brain connectomics studies feature more intricate experimental designs and yield complex findings. Traditional neuroimaging text mining techniques, operating at the term level, are insufficient for effectively extracting scientific evidence from brain connectomics articles. This paper addresses a key challenge in event-level neuroimaging text mining, i.e., event causal relation extraction in brain connectomics. We introduce a novel model named Brain Connectomics Event Relation Miner (BCERM), leveraging weighted joint constrained learning. By integrating a bidirectional long short-term memory (BiLSTM) network with a multi-layer perceptron (MLP), we develop a lightweight model for jointly extracting multiple event causal relations from brain connectomics articles. Given the scarcity of annotated brain connectomics corpora, we propose a weighted joint constrained learning framework. This framework integrates double consistency constraints, encompassing common sense and domain constraints, and combines them with adaptive weight learning to enhance the model's few-shot learning capability. Experimental evaluations on a real brain connectomics article dataset demonstrate that our method achieves an F-score of 70%, outperforming state-of-the-art event relation extraction methods in the low-resource environment.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".