A note on greedy algorithm (Q2732154)
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 note on greedy algorithm |
scientific article; zbMATH DE number 1623268
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on greedy algorithm |
scientific article; zbMATH DE number 1623268 |
Statements
26 February 2002
0 references
greedy algorithm
0 references
approximation with constraints
0 references
approximation order
0 references
neural network
0 references
neural network approximation
0 references
A note on greedy algorithm (English)
0 references
The greedy algorithm is one of the important tools in neural network approximation. The authors construct a greedy algorithm using the arithmetic average of elements of a given subset in a normed linear space. Further, they show that the degree of approximation order is \(O(n^{-1/2})\), which offers a good approximation method for neural networks.
0 references
