A Polynomial Function Discovery System — FFS

Spyros G. Tzafestaş, Zhifang Ma · International Journal of Artificial Intelligence Tools · 1997

This paper presents a function discovery system FFS that has two core parts: FFS-0-CORE and FFS-1-CORE. Both cores are with polynomial time complexity in discovering functions of either a•f(x)+b form or a1f1(x)+…+anfn(x)+b form. FFS-0-CORE allows users to define their own models. FFS-1-CORE uses novel principles to increase information which helps the function discovery procedures. Three computational examples are included.

Read the paper · More papers on PaperTik