Skip to main content

Table 3 Computational complexity comparison

From: A graph-based big data optimization approach using hidden Markov model and constraint satisfaction problem

Algorithms

Computational Complexity

Original algorithm

CSP-Optimized algorithm

Baum-Welch

\(O (N^2(T-1))\)

\(O ({N^\prime }^2(T-1))\)

Viterbi

\(O (N^2(T-1))\)

\(O ({N^\prime }^2(T-1))\)