Clustering algorithms using stochastic analysis and ensemble techniques.
kl_div_cross(probs)
Given a Markov matrix, returns a matrix of cross-Kullback-Liebler divergences between the distributions.
The input probs has the form of a square column-stochastic matrix: that is,
that is, np.sum(probs,axis=1) == 1.
The output is a square matrix D with length and width
probs.shape[0].
Mathematically, if probs[i,j] is given by the matrix \(T_{i,j}\), then
D[i,j] is given by \(D_{i,j}\):