✦ LIBER ✦

Studying possibility in a clustering algorithm for RBFNN design for function approximation

✍ Scribed by A. Guillén; H. Pomares; I. Rojas; J. González; L. J. Herrera; F. Rojas; O. Valenzuela

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear approximation in self-consisten

✍ J. Callaway; S. Ramasesha; D.G. Kanhere 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 271 KB

A design for studying the clustering of

✍ R.L. Prentice 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Approximately optimal algorithms for det

✍ A.G. Korotchenko 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 547 KB

Some algorithms for finding the approxim

✍ A.V. Goncharskii; L.G. Gushchina; A.S. Leonov; A.G. Yagola 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 877 KB

A Study for robustness of objective func

✍ Tae Won Lee 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 354 KB

A new semiempirical potential function f

✍ H.A. Grebneva 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 532 KB