Name
Abstract | ||
|---|---|---|
Fitness functions of binary strings (pseudo-boolean functions) canbe represented as polynomials over a set of boolean variables. Weshow that any such function has a unique best approximation in thelinear span of any subset of polynomials. For example, there is aunique best linear approximation and a unique best quadraticapproximation. The error of an approximation here isroot-mean-squared error. If all the details of the function to beapproximated are known, then the approximation can be calculateddirectly. Of more practical importance, we give a method for usingsampling to estimate the coefficients of the approximation, anddescribe its limitations. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1023/B:NACO.0000023418.20610.4d | Natural Computing |
Keywords | DocType | Volume |
approximation,fitness function,pseudo-boolean function | Journal | 3 |
Issue | ISSN | Citations |
1 | 1572-9796 | 4 |
PageRank | References | Authors |
0.65 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hang Zhang | 1 | 4 | 0.65 |
| Jonathan E. Rowe | 2 | 458 | 56.35 |