Skip to main content
Journal of Big Data

Table 5 Running time comparison of Baum-Welch algorithm

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

Iterations number

Running time (s)

Original Baum-Welch

CSP-Optimized Baum-Welch

100000

2580

2520

10000

2054

1987

1000

1976

1933

600

1820

1768

Back to article page