Loading...
Please wait, while we are loading the content...
Similar Documents
On the convergence of the partial least squares path modeling algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Henseler, Jörg |
| Copyright Year | 2010 |
| Abstract | This paper adds to an important aspect of Partial Least Squares (PLS) path modeling, namely the convergence of the iterative PLS path modeling algorithm. Whilst conventional wisdom says that PLS always converges in practice, there is no formal proof for path models with more than two blocks of manifest variables. This paper presents six cases of non-convergence of the PLS path modeling algorithm. These cases were estimated using Mode A combined with the factorial scheme or the path weighting scheme, which are two popular options of the algorithm. As a conclusion, efforts to come to a proof of convergence under these schemes can be abandoned, and users of PLS should triangulate their estimation results. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://doc.utwente.nl/91121/1/2010_CoSt_Henseler.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Algorithm Convergence (action) Epilepsies, Partial Formal proof Iterative method Papillon-Lefevre Disease Partial least squares path modeling Partial least squares regression While |
| Content Type | Text |
| Resource Type | Article |
