build_graph

Object of class <code>"CTM"</code>.

Numeric in \([0,1]\) indicating the relative bound on
 the L1-norm of the parameters.

lambda

Logical; if <code>TRUE</code> the graph is computed by taking the
 intersection of the neighbors, otherwise the union is determined.

The lasso is used to determine which edges are present in a topic
 graph. The original R code was written by David M. Blei and co-authors
 and is available together with the C code for fitting the CTM.

dplot

Provides an interface to the C code for Latent Dirichlet
Allocation (LDA) models and Correlated Topics Models
(CTM) by David M. Blei and co-authors and the C++ code
for fitting LDA models using Gibbs sampling by Xuan-Hieu
Phan and co-authors.

Bettina Gruen

topicmodels

Topic Models

Bettina Grün

Kurt Hornik

David M Blei

John D Lafferty

Xuan-Hieu Phan

Makoto Matsumoto

Takuji Nishimura

Shawn Cokus

build_graph function

<dl> <dt>x</dt>
<dd>Object of class <code>"CTM"</code>.</dd> <dt>lambda</dt>
<dd>Numeric in \([0,1]\) indicating the relative bound on
 the L1-norm of the parameters.</dd> <dt>and</dt>
<dd>Logical; if <code>TRUE</code> the graph is computed by taking the
 intersection of the neighbors, otherwise the union is determined.</dd></dl>

Arguments

David M. Blei, modified by Bettina Gruen.

Author

Construct the adjacency matrix for a topic graph — build_graph

<dl>

 <dt>x</dt>
<dd>Object of class <code>"CTM"</code>.</dd>

 <dt>lambda</dt>
<dd>Numeric in \([0,1]\) indicating the relative bound on
 the L1-norm of the parameters.</dd>

 <dt>and</dt>
<dd>Logical; if <code>TRUE</code> the graph is computed by taking the
 intersection of the neighbors, otherwise the union is determined.</dd>

</dl>

build_graph: Construct the adjacency matrix for a topic graph

Description

Usage

Value

Arguments

Author

References