You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: Presentation/Sections/PLS algorithm.tex
+1-1Lines changed: 1 addition & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -4,7 +4,7 @@ \section{Description of the PLS algorithm}
4
4
\frametitle{NIPALS algorithm}
5
5
The most popular algorithm used in PLS to compute the model parameters is known as \textbf{non-iterative partial least squares} (\textbf{NIPALS}). There are two versions of this technique:
6
6
\begin{itemize}
7
-
\item\textbf{PLS1}: each of the \textit{p} predicted variables in modeled separately, resulting in one model for each class;
7
+
\item\textbf{PLS1}: each of the \textit{p} predicted variables is modeled separately, resulting in one model for each class;
8
8
\item\textbf{PLS2}: all predicted variables are modeled simultaneously.
9
9
\end{itemize}
10
10
The first algorithm is more accurate than the other, however it requires more computational time than PLS2 to find the $\alpha$ eigenvectors into which project the \textit{m} covariates.
0 commit comments