The number of times φ k was assigned is denoted j k , so that j = K k=1 j k .
since the number of classes is very large, selecting examples at random would result in a relatively low proportion of moves getting accepted, and, consequently, in a slow-mixing Markov chain.