𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A least squares algorithm for fitting an ultrametric tree to a dissimilarity matrix

✍ Scribed by Geert De Soete

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
311 KB
Volume
2
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dykstra's Algorithm for a Constrained Le
Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
✍ RenΓ© Escalante; Marcos Raydan πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 577 KB

We apply Dykstra's alternating projection algorithm to the constrained least-squares matrix problem that arises naturally in statistics and mathematical economics. In particular, we are concerned with the problem of finding the closest symmetric positive definite bounded and patterned matrix, in the

An algorithm for least-squares fitting o
An algorithm for least-squares fitting of cubic spline surfaces to functions on a rectilinear mesh over a rectangle
✍ P. Dierckx πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 865 KB

In this paper a method is presented for fitting, in the least-squares sense, a bivariate cubic spline function to values of a dependent variable, specified at points on a rectangular grid in the plane of the independent variables. Products of B-splines are used to represent the bicubic splines. The

Cross fitted partial least squares (CF-P
Cross fitted partial least squares (CF-PLS): an alternative algorithm for a more reliable PLS
✍ Olivier Cloarec πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 559 KB

## Abstract This paper presents a modified version of the NIPALS algorithm for PLS regression with one single response variable. This version, denoted a CF‐PLS, provides significant advantages over the standard PLS. First of all, it strongly reduces the over‐fit of the regression. Secondly, __R__^2