原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
η1, η2, … , ηm. By choosing n = m, you can calculate each yi exactly in equation (28.19).
Such a high-degree polynomial F “fits the noise” as well as the data, however, and generally gives poor results when used to predict y for previously unseen values of x. It is usually better to choose n significantly smaller than m and hope
that by choosing the coefficients cj well, you can obtain a function F that finds the sig
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea