Improving Reliability of Latent Dirichlet Allocation by Assessing Its Stability Using Clustering Techniques on Replicated Runs
Table 1: Toy example: Assignment counts of two topics and calculation of modified Jaccard coefficient
['[EMPTY]', '[ITALIC] z1', '[ITALIC] z2', '∧', '∨']
We demonstrate how the measure is calculated with a small toy example. We use the relative lower bound with d=500. The last two columns indicate whether the corresponding word belongs to the modified intersection or union, respectively. For example, the word election does not belong to the intersection because its count is below the topic specific (relative) threshold of at least nine assignments to topic z1.