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
Posted Content
Deep Learning in Mobile and Wireless Networking: A Survey
TL;DR: In this article, the authors provide an encyclopedic review of mobile and wireless networking research based on deep learning, which they categorize by different domains and discuss how to tailor deep learning to mobile environments.
Journal ArticleDOI
Bug localization using latent Dirichlet allocation
TL;DR: An effective static technique for automatic bug localization can be built around Latent Dirichlet allocation (LDA), and there is no significant relationship between the accuracy of the LDA-based technique and the size of the subject software system or the stability of its source code base.
Proceedings Article
Learning Discriminative Projections for Text Similarity Measures
TL;DR: A novel discriminative training method that projects the raw term vectors into a common, low-dimensional vector space, which not only outperforms existing state-of-the-art approaches, but also achieves high accuracy at low dimensions and is thus more efficient.
Proceedings ArticleDOI
Deep feature synthesis: Towards automating data science endeavors
TL;DR: This paper proposes and develops the Deep Feature Synthesis algorithm for automatically generating features for relational datasets, and implements a generalizable machine learning pipeline and tune it using a novel Gaussian Copula process based approach.
Journal ArticleDOI
Sequence-Aware Recommender Systems
TL;DR: In this article, the authors present a review of existing works that consider information from such sequentially ordered user-item interaction logs in the recommendation process and propose a categorization of the corresponding recommendation tasks and goals, summarize existing algorithmic solutions, discuss methodological approaches when benchmarking what they call sequence-aware recommender systems, and outline open challenges in the area.
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.