Data-driven stochastic modelling of zebrafish locomotion
Bibliographic record
Abstract
In this work, we develop a data-driven modelling framework to reproduce the locomotion of fish in a confined environment. Specifically, we highlight the primary characteristics of the motion of individual zebrafish (Danio rerio), and study how these can be suitably encapsulated within a mathematical framework utilising a limited number of calibrated model parameters. Using data captured from individual zebrafish via automated visual tracking, we develop a model using stochastic differential equations and describe fish as a self propelled particle moving in a plane. Based on recent experimental evidence of the importance of speed regulation in social behaviour, we extend stochastic models of fish locomotion by introducing experimentally-derived processes describing dynamic speed regulation. Salient metrics are defined which are then used to calibrate key parameters of coupled stochastic differential equations, describing both speed and angular speed of swimming fish. The effects of external constraints are also included, based on experimentally observed responses. Understanding the spontaneous dynamics of zebrafish using a bottom-up, purely data-driven approach is expected to yield a modelling framework for quantitative investigation of individual behaviour in the presence of various external constraints or biological assays.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".