✦ LIBER ✦

A fast non-negativity-constrained least squares algorithm

✍ Scribed by Rasmus Bro; Sijmen De Jong

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 154 KB
Volume: 11
Category: Article
ISSN: 0886-9383
DOI: 10.1002/(sici)1099-128x(199709/10)11:5<393::aid-cem483>3.0.co;2-l

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper a modification of the standard algorithm for non-negativity-constrained linear least squares regression is proposed. The algorithm is specifically designed for use in multiway decomposition methods such as PARAFAC and N-mode principal component analysis. In those methods the typical situation is that there is a high ratio between the numbers of objects and variables in the regression problems solved. Furthermore, very similar regression problems are solved many times during the iterative procedures used. The algorithm proposed is based on the de facto standard algorithm NNLS by Lawson and Hanson, but modified to take advantage of the special characteristics of iterative algorithms involving repeated use of non-negativity constraints. The principle behind the NNLS algorithm is described in detail and a comparison is made between this standard algorithm and the new algorithm called FNNLS (fast NNLS).

📜 SIMILAR VOLUMES

Fast algorithm for the solution of large

Fast algorithm for the solution of large-scale non-negativity-constrained least squares problems

✍ Mark H. Van Benthem; Michael R. Keenan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

Least squares algorithms under unimodali

Least squares algorithms under unimodality and non-negativity constraints

✍ Rasmus Bro; Nicholaos D. Sidiropoulos 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

In this paper a least squares method is developed for minimizing jjY À XB T jj 2 F over the matrix B subject to the constraint that the columns of B are unimodal, i.e. each has only one peak, and jjMjj 2 F being the sum of squares of all elements of M. This method is directly applicable in many curv

Positron Lifetime Analysis from Generali

Positron Lifetime Analysis from Generalized Constrained Least-Squares Technique

✍ A. H. Deng; B. K. Panda; S. Fung; C. D. Beling 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

A fast method to compute orthogonal load

A fast method to compute orthogonal loadings partial least squares

✍ Constantinos Goutis 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

There are two commonly used partial least squares (PLS) regression algorithms. 1 -3 The first, the orthogonal scores algorithm, is the older one, 4 whereas the second, the orthogonal loadings algorithm, is more recent. 5 Their difference lies in the decomposition of the data matrix X = ∑ r i =1 t i

A nonlinear partial least squares algori

A nonlinear partial least squares algorithm using quadratic fuzzy inference system

✍ Araby I. Abdel-Rahman; Gino J. Lim 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

A Fast Non-Parametric Density Estimation

A Fast Non-Parametric Density Estimation Algorithm

✍ Eğecioğlu, Ömer ;Srinivasan, Ashok 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB 👁 1 views

Non-parametric density estimation is the problem of approximating the values of a probability density function, given samples from the associated distribution. Non-parametric estimation ®nds applications in discriminant analysis, cluster analysis, and ¯ow calculations based on Smoothed Particle Hydr