Code of word network topic model

<pre>1. Introduction --------------- <br></pre><pre><br></pre><pre>Class PrepareInput can convert the original documents into word co-occurrence network and re-weight it, then save it as pseudo documents. The output of PrepareInput can be used directly as the input of jGibbsLDA. Class InferenceTopicsForOrgDocs is used to inference topics of original documents, after the execution of jGibbsLDA. * Note that jGibbsLDA is a free software written by Xuan-Hieu Phan. More details can be found in http://jgibblda.sourceforge.net. <br></pre><pre><br></pre><pre>2. Installation --------------- Straightforward Java compilation can be done with the following commands: &gt; tar -xzcf wntm.tar.gz &gt; cd wntm &gt; javac *.java <br></pre><pre><br></pre><pre>3. Usage -------- &gt; java PrepareInput Example usage: &gt; java PrepareInput sample.txt ./ sample 10 * Note that constructing word network might require lots of memory, especially when the original input file is large. For example, original file size of 250MB needs 7GB memory in our experiment. In this case, one might use following command to configure the maximum memory can be used by Java. &gt; java -Xmx10g PrepareInput sample.txt ./ sample 10 <br></pre><pre><br></pre><pre>4. Output --------- When PrepareInput completes, it will output two files. The file named with suffix ".word" stores all the nodes in the word network. The file named with suffix ".adjacent" stores pseudo documents ready to be used in jGibbsLDA. <br></pre><pre><br></pre><pre>5. Inference ------------ Since WNTM models topics for a word's adjacent node list. Therefore, we need to inference the topic distribution of original documents, when jGibbsLDA finished training pseudo documents. One can use following command to do inference: &gt; java InferenceTopicsForOrgDocs to get topics of original documents, aka the .theta file for original corpus. <br></pre><pre><br></pre><pre>6. Contact ---------- If you have any problem, please feel free to contact Jichang Zhao([e-mail]) </pre>