A comparative analysis of the successive lumping and the lattice path counting algorithms.
Michael N. KatehakisLaurens C. SmitFloske SpieksmaPublished in: J. Appl. Probab. (2016)
Keyphrases
- optimization problems
- times faster
- computationally expensive
- learning algorithm
- graph theory
- computational efficiency
- orders of magnitude
- significant improvement
- theoretical analysis
- machine learning algorithms
- computational complexity
- multiscale
- efficient implementation
- data sets
- upper bound
- multi class
- worst case
- data mining techniques
- benchmark datasets
- data mining algorithms
- video sequences
- decision trees