The receptor density algorithm
From MaRDI portal
Publication:385060
DOI10.1016/j.tcs.2012.10.057zbMath1291.92014OpenAlexW2014749486WikidataQ60473646 ScholiaQ60473646MaRDI QIDQ385060
Nick D. L. Owens, Andrew Greensted, Jon Timmis, A. M. Tyrrell
Publication date: 29 November 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.057
exponential smoothingkernel density estimationanomaly detectionartificial immune systemsbio-inspired algorithmsrecurrent equationsT cell signallingweighted moving average
Related Items (1)
Cites Work
- The receptor density algorithm
- Elucidation of T cell signalling models
- Theoretical advances in artificial immune systems
- The Efficiency of Some Nonparametric Competitors of the $t$-Test
- On the efficiency of on-line density estimators
- Asymptotically optimal discriminant functions for pattern classification
- On Estimation of a Probability Density Function and Mode
- On Information and Sufficiency
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The receptor density algorithm