Skip to main content
. 2018 Aug 6;20(6):2028–2043. doi: 10.1093/bib/bby066

Figure 15.

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 Inline graphic, Inline graphic, Inline graphic, Inline graphic, Inline graphic and four edges (Inline graphic, Inline graphic), (Inline graphic, Inline graphic), (Inline graphic, Inline graphic) and (Inline graphic, Inline graphic).