Figure 15.
Graphical representation of Markov random field regularized LDA; if two words are correlated according to the external knowledge, an undirected edge between their topic labels is created. Finally, a graph in which nodes are latent topic labels and edges connect topic labels of semantically related words. In this example, the graph contains five nodes ,
,
,
,
and four edges (
,
), (
,
), (
,
) and (
,
).