✦ LIBER ✦

Using the doubling dimension to analyze the generalization of learning algorithms

✍ Scribed by Nader H. Bshouty; Yi Li; Philip M. Long

Book ID: 108166569
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 219 KB
Volume: 75
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2009.01.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using three-dimensional fractal dimensio

Using three-dimensional fractal dimension to analyze the

✍ Yu-Te Wu; Kuo-Kai Shyu; Tzong-Rong Chen; Wan-Yuo Guo 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 463 KB

The learning dimension of evaluation use

✍ Hallie Preskill; Rosalie T. Torres 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 755 KB

Comparison of learning and generalizatio

Comparison of learning and generalization capabilities of the Kak and the Backpropagation algorithms

✍ Praveen Raina 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 749 KB

Using 3D FFT fractal dimension estimator

Using 3D FFT fractal dimension estimator to analyze the complexity of fetal cortical surface from MR images

✍ Yu-Te Wu; Kuo-Kai Shyu; Tzong-Rong Chen; Hui-Yun Chen; Hui-Hsin Hu; Wan-Yuo Guo 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Using modal series to analyze the transi

Using modal series to analyze the transient response of oscillators

✍ Mahmood Khatibi; Hasan Modir Shanechi 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

In this paper, a new form of Modal series is used to obtain the transient time-domain response of oscillators. It is applicable to n-dimensional systems and is not dependent on the existence of a small parameter in circuit's model. In addition, it provides an approximate analytical expression for th

Using the Discrete Fourier Transform to

Using the Discrete Fourier Transform to Analyze the Convergence of Subdivision Schemes

✍ Leif Kobbelt 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 344 KB

While the continuous Fourier transform is a well-established standard tool for the analysis of subdivision schemes, we present a new technique based on the discrete Fourier transform instead. We first prove a very general convergence criterion for arbitrary interpolatory schemes, i.e., for nonstatio