Quasi Lumpability, Lower-Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains.
Tugrul DayarWilliam J. StewartPublished in: SIAM J. Matrix Anal. Appl. (1997)
Keyphrases
- markov chain
- lower bounding
- lower bound
- branch and bound algorithm
- multi step
- dynamic time warping
- lower and upper bounds
- mathematical programming
- similarity search
- state space
- transition probabilities
- random walk
- stationary distribution
- euclidean distance
- markov processes
- edit distance
- upper bound
- distance computation
- np hard
- optimal solution
- transition matrix
- similarity measure
- markov networks
- branch and bound
- triangle inequality
- pairwise
- k nearest neighbor
- high dimensional
- machine learning