Hierarchical relational models for document networks

First Page		Document Content
Date: 2015-03-12 00:16:21 Latent Dirichlet allocation Mixture model Expectation–maximization algorithm Topic model Markov chain Probit model Statistics Machine learning Statistical natural language processing		Hierarchical relational models for document networks Add to Reading List Source URL: www.cs.columbia.edu Download Document from Source Website File Size: 685,09 KB Share Document on Facebook

	Understanding Text Pre-Processing for Latent Dirichlet Allocation Alexandra Schofield1 M˚ans Magnusson2 Laure Thompson1 David Mimno3 1 Department of Computer Science, Cornell University, Ithaca, NY {xanda, laurejt}@cs.c DocID: 1xUNS - View Document
	HarpLDA+: Optimizing Latent Dirichlet Allocation for Parallel Efficiency Bo Peng1 Shaojuan Zhu3 Bingjing Zhang1 Langshi Chen1 Mihai Avram1 Robert Henschel2 Craig Stewart2 Emily Mccallum3 DocID: 1uZcF - View Document
	WarpLDA: a Cache Efficient O(1) Algorithm for Latent Dirichlet Allocation Jianfei Chen†‡ , Kaiwei Li†§ , Jun Zhu†‡ , Wenguang Chen†§ † Dept. of Comp. Sci. & Tech.; TNList Lab; CBICR Center; Tsinghua Univ DocID: 1uZ6x - View Document
	Journal of Machine Learning Research1022 Submitted 2/02; Published 1/03 Latent Dirichlet Allocation David M. Blei DocID: 1thkm - View Document
	When One Textbook is not Enough: Linking Multiple Textbooks Using Probabilistic Topic Models Julio Guerra12 , Sergey Sosnovsky3 , and Peter Brusilovsky1 1 DocID: 1r8Au - View Document