A nonlinear discrete transform for pattern recognition of discrete chaotic systems. (Q1419315)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A nonlinear discrete transform for pattern recognition of discrete chaotic systems. |
scientific article; zbMATH DE number 2027143
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A nonlinear discrete transform for pattern recognition of discrete chaotic systems. |
scientific article; zbMATH DE number 2027143 |
Statements
A nonlinear discrete transform for pattern recognition of discrete chaotic systems. (English)
0 references
14 January 2004
0 references
The authors propose a mathematical framework for coding the information of a self set on a \(p\)-adic tree, in order to define immune type detectors, negative selections algorithms, divergence measures using informational Fermi entropy, and the chaotic dimension method. The key is to use a nonlinear transformation which shows that any finite sequence of strings can be represented as a random walk on trees. Several examples and problems for immune computing illustrate the results.
0 references
diversity of chaotic strings
0 references
nonlinear denoising filter
0 references
pattern recognition of immune type
0 references
Fermi entropy
0 references
0 references
0 references
