Table 4.

Algorithm complexity of developed learning procedures.

	Proposal	Proposal*
Time [h]a	36	36Nλ
Complexity	$\mathcal{O}(n^2)$	$\mathcal{O}(N_{\lambda }{n}^2)$

N_τ, number of considered time windows τ; N_λ, amount of searching cycles in LASSO regularization terms.

^aIndicated time per subject.