ASIND algorithm alternately identifies self-dynamics, interactive functions, and networks sparsely without prior knowledge, claiming state-of-the-art identification and 100-step prediction on network dynamics.
Nature , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
ASIND: Alternating Sparse Identification for Predicting Network Dynamics Without Knowledge
ASIND algorithm alternately identifies self-dynamics, interactive functions, and networks sparsely without prior knowledge, claiming state-of-the-art identification and 100-step prediction on network dynamics.