Open AccessProceedings Article
Probabilistic latent semantic analysis
Thomas Hofmann
- Vol. 15, pp 289-296
Reads0
Chats0
TLDR
This work proposes a widely applicable generalization of maximum likelihood model fitting by tempered EM, based on a mixture decomposition derived from a latent class model which results in a more principled approach which has a solid foundation in statistics.Abstract:
Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two-mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Semantic Analysis which stems from linear algebra and performs a Singular Value Decomposition of co-occurrence tables, the proposed method is based on a mixture decomposition derived from a latent class model. This results in a more principled approach which has a solid foundation in statistics. In order to avoid overfitting, we propose a widely applicable generalization of maximum likelihood model fitting by tempered EM. Our approach yields substantial and consistent improvements over Latent Semantic Analysis in a number of experiments.read more
Citations
More filters
Journal ArticleDOI
Building A Highly Accurate Mandarin Speech Recognizer With Language-Independent Technologies and Language-Dependent Modules
TL;DR: A system for highly accurate large-vocabulary Mandarin speech recognition that comprises two sets of acoustic models designed to be complementary in terms of errors but with similar overall accuracy by using different phone sets and different combinations of discriminative learning.
Proceedings Article
Mining user interests from personal photos
TL;DR: A User Image Latent Space Model is proposed to jointly model user interests and image contents and uses variational inference to approximate the posteriors of latent variables and learn model parameters.
Proceedings Article
Generalized Regularized Least-Squares Learning with Predefined Features in a Hilbert Space
TL;DR: A generalized form of representer theorem is investigated for kernel-based regularized learning by utilizing a generalized regularizer which leaves part of the space unregularized.
Book ChapterDOI
A Semantic Web Pragmatic Approach to Develop Clinical Ontologies, and Thus Semantic Interoperability, Based in HL7 v2.XML Messaging
TL;DR: The coverage of HL7 RIM inadequacy for ontology mapping and how to circumvent it, NLP techniques for semi automated ontology population and the current trends about knowledge representation and reasoning are presented and their applicability discussed.
Proceedings ArticleDOI
Protein Sequence Classification Using Feature Hashing
TL;DR: In this article, the authors compared feature hashing with the bag of k-grams and feature selection approaches and showed that feature hashing is an effective approach to reducing dimensionality on protein sequence classification tasks.
References
More filters
Journal ArticleDOI
Maximum likelihood from incomplete data via the EM algorithm
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.
Journal ArticleDOI
A Solution to Plato's Problem: The Latent Semantic Analysis Theory of Acquisition, Induction, and Representation of Knowledge.
TL;DR: A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LSA), is presented and used to successfully simulate such learning and several other psycholinguistic phenomena.
Journal ArticleDOI
Probabilistic latent semantic indexing
TL;DR: Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data.