Latent dirichlet allocation
Reads0
Chats0
TLDR
This work proposes a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams, and Hofmann's aspect model.Abstract:
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian model, in which each item of a collection is modeled as a finite mixture over an underlying set of topics. Each topic is, in turn, modeled as an infinite mixture over an underlying set of topic probabilities. In the context of text modeling, the topic probabilities provide an explicit representation of a document. We present efficient approximate inference techniques based on variational methods and an EM algorithm for empirical Bayes parameter estimation. We report results in document modeling, text classification, and collaborative filtering, comparing to a mixture of unigrams model and the probabilistic LSI model.read more
Citations
More filters
Journal ArticleDOI
Supervised classification of human microbiota.
TL;DR: This review demonstrates that several existing supervised classifiers can be applied effectively to microbiota classification, both for selecting subsets of taxa that are highly discriminative of the type of community, and for building models that can accurately classify unlabeled data.
Proceedings ArticleDOI
Collaborative Variational Autoencoder for Recommender Systems
Xiaopeng Li,James She +1 more
TL;DR: A Bayesian generative model called collaborative variational autoencoder (CVAE) that considers both rating and content for recommendation in multimedia scenario that is able to significantly outperform the state-of-the-art recommendation methods with more robust performance is proposed.
Proceedings Article
Parametric Bandits: The Generalized Linear Case
TL;DR: The analysis highlights a key difficulty in generalizing linear bandit algorithms to the non-linear case, which is solved in GLM-UCB by focusing on the reward space rather than on the parameter space, and provides a tuning method based on asymptotic arguments, which leads to significantly better practical performance.
Proceedings ArticleDOI
Latent semantic sparse hashing for cross-modal similarity search
TL;DR: A novel Latent Semantic Sparse Hashing (LSSH) is proposed to perform cross-modal similarity search by employing Sparse Coding and Matrix Factorization to capture the salient structures of images and learn the latent concepts from text.
Journal ArticleDOI
Scene Classification via a Gradient Boosting Random Convolutional Network Framework
Fan Zhang,Bo Du,Liangpei Zhang +2 more
TL;DR: A gradient boosting random convolutional network (GBRCN) framework for scene classification, which can effectively combine many deep neural networks and can provide more accurate classification results than the state-of-the-art methods.
References
More filters
Book
Bayesian Data Analysis
TL;DR: Detailed notes on Bayesian Computation Basics of Markov Chain Simulation, Regression Models, and Asymptotic Theorems are provided.
Journal ArticleDOI
Indexing by Latent Semantic Analysis
TL;DR: A new method for automatic indexing and retrieval to take advantage of implicit higher-order structure in the association of terms with documents (“semantic structure”) in order to improve the detection of relevant documents on the basis of terms found in queries.
Book
Introduction to Modern Information Retrieval
Gerard Salton,Michael J. McGill +1 more
TL;DR: Reading is a need and a hobby at once and this condition is the on that will make you feel that you must read.
Book
Theory of probability
Harold Jeffreys,R. Bruce Lindsay +1 more
TL;DR: In this paper, the authors introduce the concept of direct probabilities, approximate methods and simplifications, and significant importance tests for various complications, including one new parameter, and various complications for frequency definitions and direct methods.