Not to be confused with Curve fitting.
Several approximations of a step function
Several progressively more accurate approximations of the step function
An asymmetrical Gaussian function fit to a noisy curve using regression.
An asymmetrical Gaussian function fit to a noisy curve using regression

In general, a function approximation problem asks us to select a function that closely matches ("approximates") a function in a task-specific way.[1][better source needed] The need for function approximations arises, for example, predicting the growth of microbes in microbiology.[2] Function approximations are used where theoretical models are unavailable or hard to compute.[2]

First, for known target functions approximation theory is the branch of numerical analysis that investigates how certain known functions (for example, special functions) can be approximated by a specific class of functions (for example, polynomials or rational functions) that often have desirable properties (inexpensive computation, continuity, integral and limit values, etc.).[3]

Secondly, for example, if g is an operation on the real numbers, techniques of interpolation, extrapolation, regression analysis, and curve fitting can be used. If the codomain (range or target set) of g is a finite set, one is dealing with a classification problem instead.[4]

See also

edit

References

edit
  1. ^ Lakemeyer, Gerhard; Sklar, Elizabeth; Sorrenti, Domenico G.; Takahashi, Tomoichi (2007-09-04). RoboCup 2006: Robot Soccer World Cup X. Springer. ISBN 978-3-540-74024-7.
  2. ^ a b Basheer, I.A.; Hajmeer, M. (2000). "Artificial neural networks: fundamentals, computing, design, and application" (PDF). Journal of Microbiological Methods. 43 (1): 3–31. doi:10.1016/S0167-7012(00)00201-3. PMID 11084225. S2CID 18267806.
  3. ^ Mhaskar, Hrushikesh Narhar; Pai, Devidas V. (2000). Fundamentals of Approximation Theory. CRC Press. ISBN 978-0-8493-0939-7.
  4. ^ Charte, David; Charte, Francisco; García, Salvador; Herrera, Francisco (2019-04-01). "A snapshot on nonstandard supervised learning problems: taxonomy, relationships, problem transformations and algorithm adaptations". Progress in Artificial Intelligence. 8 (1): 1–14. arXiv:1811.12044. doi:10.1007/s13748-018-00167-7. ISSN 2192-6360. S2CID 53715158.


Stub icon

This mathematical analysis–related article is a stub. You can help Wikipedia by adding missing information.

Stub icon

This statistics-related article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Universal approximation theorem

universal approximation theorems (UATs) state that neural networks with a certain structure can, in principle, approximate any continuous function to any

Least-squares function approximation

squares function approximation applies the principle of least squares to function approximation, by means of a weighted sum of other functions. The best

Taylor's theorem

In calculus, Taylor's theorem gives an approximation of a k {\textstyle k} -times differentiable function around a given point by a polynomial of degree

Physics-informed neural networks

of admissible solutions, increasing the generalizability of the function approximation. This way, embedding this prior information into a neural network

Stirling's approximation

mathematics, Stirling's approximation (or Stirling's formula) is an asymptotic approximation for factorials. It is a good approximation, leading to accurate

Padé approximant

mathematics, a Padé approximant is the "best" approximation of a function near a specific point by a rational function of given order. Under this technique, the

Exponential integral

have been a number of approximations for the exponential integral function. These include: The Swamee and Ohija approximation E 1 ( x ) = ( A − 7.7 +

Approximation

o'clock). Although approximation is most often applied to numbers, it is also frequently applied to such things as mathematical functions, shapes, and physical