𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On-line learning for very large data sets

✍ Scribed by Léon Bottou; Yann Le Cun

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
153 KB
Volume
21
Category
Article
ISSN
1524-1904

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Density-functional method for very large
Density-functional method for very large systems with LCAO basis sets
✍ Daniel Sánchez-Portal; Pablo Ordejón; Emilio Artacho; José M. Soler 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB 👁 1 views

We have implemented a linear scaling, fully self-consistent densityfunctional method for performing first-principles calculations on systems with a large number of atoms, using standard norm-conserving pseudopotentials and flexible linear Ž . combinations of atomic orbitals LCAO basis sets. Exchange

Fast principal component analysis of lar
Fast principal component analysis of large data sets based on information extraction
✍ F. Vogt; M. Tacke 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB 👁 2 views

## Abstract Principal component analysis (PCA) and principal component regression (PCR) are routinely used for calibration of measurement devices and for data evaluation. However, their use is hindered in some applications, e.g. hyperspectral imaging, by excessive data sets that imply unacceptable

Greedy Algorithms for On-Line Data Compr
Greedy Algorithms for On-Line Data Compression
✍ József Békési; Gábor Galambos; Ulrich Pferschy; Gerhard J Woeginger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 191 KB

We consider on-line text-compression problems where compression is done by Ž . substituting substrings according to some fixed static dictionary code book . Due to the long running time of optimal algorithms, several heuristics have been introduced in the literature. In this paper, we continue the i