DOCSLIB.ORG

Efficient Methods for Inferring Large Sparse Topic Hierarchies

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Efficient Methods for Inferring Large Sparse Topic Hierarchies Efficient Methods for Inferring Large Sparse Topic Hierarchies Doug Downey, Chandra Sekhar Bhagavatula, Yi Yang Electrical Engineering and Computer Science Northwestern University [email protected], csb,yiyang @u.northwestern.edu { } Abstract have focused on “flat” topic models such as LDA. Flat topic models over large topic spaces are prone Latent variable topic models such as La- to overfitting: even in a Web-scale corpus, some tent Dirichlet Allocation (LDA) can dis- words are expressed rarely, and many documents cover topics from text in an unsupervised are brief. Inferring a large topic distribution for fashion. However, scaling the models up each word and document given such sparse data to the many distinct topics exhibited in is challenging. As a result, LDA models in prac- modern corpora is challenging. “Flat” tice tend to consider a few thousand topics at most, topic models like LDA have difficulty even when training on billions of words (Mimno et modeling sparsely expressed topics, and al., 2012). richer hierarchical models become compu- A promising alternative to flat topic models is tationally intractable as the number of top- found in recent hierarchical topic models (Paisley ics increases. et al., 2015; Blei et al., 2010; Li and McCallum, In this paper, we introduce efficient meth- 2006; Wang et al., 2013; Kim et al., 2013; Ahmed ods for inferring large topic hierarchies. et al., 2013). Topics of words and documents can Our approach is built upon the Sparse be naturally arranged into hierarchies. For exam- Backoff Tree (SBT), a new prior for la- ple, an article on the topic of the Chicago Bulls is tent topic distributions that organizes the also relevant to the more general topics of NBA, latent topics as leaves in a tree. We show Basketball, and Sports. Hierarchies can combat how a document model based on SBTs data sparsity: if data is too sparse to place the can effectively infer accurate topic spaces term “Pau Gasol” within the Chicago Bulls topic, of over a million topics. We introduce a perhaps it can be appropriately modeled at some- collapsed sampler for the model that ex- what less precision within the Basketball topic. A ploits sparsity and the tree structure in or- hierarchical model can make fine-grained distinc- der to make inference efficient. In exper- tions where data is plentiful, and back-off to more iments with multiple data sets, we show coarse-grained distinctions where data is sparse. that scaling to large topic spaces results in However, current hierarchical models are hindered much more accurate models, and that SBT by computational complexity. The existing infer- document models make use of large topic ence methods for the models have runtimes that spaces more effectively than flat LDA. increase at least linearly with the number of top- ics, making them intractable on large corpora with 1 Introduction large numbers of topics. Latent variable topic models, such as Latent In this paper, we present a hierarchical topic Dirichlet Allocation (Blei et al., 2003), are popu- model that can scale to large numbers of dis- lar approaches for automatically discovering top- tinct topics. Our approach is built upon a new ics in document collections. However, learning prior for latent topic distributions called a Sparse models that capture the large numbers of distinct Backoff Tree (SBT). SBTs organize the latent top- topics expressed in today’s corpora is challenging. ics as leaves in a tree, and smooth the distribu- While efficient methods for learning large topic tions for each topic with those of similar top- models have been developed (Li et al., 2014; Yao ics nearby in the tree. SBT priors use absolute et al., 2009; Porteous et al., 2008), these methods discounting and learned backoff distributions for 774 Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing, pages 774–784, Beijing, China, July 26-31, 2015. c 2015 Association for Computational Linguistics smoothing sparse observation counts, rather than The Pachinko Allocation Model (PAM) intro- the fixed additive discounting utilized in Dirichlet duced by Li & McCallum (Li and McCallum, and Chinese Restaurant Process models. We show 2006) is a general approach for modeling corre- how the SBT’s characteristics enable a novel col- lations among topic variables in latent variable lapsed sampler that exploits the tree structure for models. Hierarchical organizations of topics, as efficiency, allowing SBT-based document models in SBT, can be considered as a special case of a (SBTDMs) that scale to hierarchies of over a mil- PAM, in which inference is particularly efficient. lion topics. We show that our model is much more efficient We perform experiments in text modeling and than an existing PAM topic modeling implemen- hyperlink prediction, and find that SBTDM is tation in Section 5. more accurate compared to LDA and the re- Hu and Boyd-Graber (2012) present a method cent nested Hierarchical Dirichlet Process (nHDP) for augmenting a topic model with known hier- (Paisley et al., 2015). For example, SBTDMs archical correlations between words (taken from with a hundred thousand topics achieve perplex- e.g. WordNet synsets). By contrast, our focus ities 28-52% lower when compared with a stan- is on automatically learning a hierarchical orga- dard LDA configuration using 1,000 topics. We nization of topics from data, and we demonstrate verify that the empirical time complexity of in- that this technique improves accuracy over LDA. ference in SBTDM increases sub-linearly in the Lastly, SparseLDA (Yao et al., 2009) is a method number of topics, and show that for large topic that improves the efficiency of inference in LDA spaces SBTDM is more than an order of magni- by only generating portions of the sampling distri- tude more efficient than the hierarchical Pachinko bution when necessary. Our collapsed sampler for Allocation Model (Mimno et al., 2007) and nHDP. SBTDM utilizes a related intuition at each level of Lastly, we release an implementation of SBTDM the tree in order to enable fast inference. as open-source software.1 3 Sparse Backoff Trees 2 Previous Work In this section, we introduce the Sparse Backoff The intuition in SBTDM that topics are naturally Tree, which is a prior for a multinomial distribu- arranged in hierarchies also underlies several other tion over a latent variable. We begin with an ex- models from previous work. Paisley et al. (2015) ample showing how an SBT transforms a set of introduce the nested Hierarchical Dirichlet Pro- observation counts into a probability distribution. cess (nHDP), which is a tree-structured generative Consider a latent variable topic model of text doc- model of text that generalizes the nested Chinese uments, similar to LDA (Blei et al., 2003) or pLSI Restaurant Process (nCRP) (Blei et al., 2010). (Hofmann, 1999). In the model, each token in a Both the nCRP and nHDP model the tree struc- document is generated by first sampling a discrete ture as a random variable, defined over a flexi- latent topic variable Z from a document-specific ble (potentially infinite in number) topic space. topic distribution, and then sampling the token’s However, in practice the infinite models are trun- word type from a multinomial conditioned on Z. cated to a maximal size. We show in our experi- We will focus on the document’s distribution ments that SBTDM can scale to larger topic spaces over topics, ignoring the details of the word types and achieve greater accuracy than nHDP. To our for illustration. We consider a model with 12 knowledge, our work is the first to demonstrate a latent topics, denoted as integers from the set hierarchical topic model that scales to more than 1,..., 12 . Assume we have assigned latent { } one million topics, and to show that the larger topic values to five tokens in the document, specif- models are often much more accurate than smaller ically the topics 1, 4, 4, 5, 12 . We indicate the { } models. Similarly, compared to other recent hi- number of times topic value z has been selected as erarchical models of text and other data (Petinot nz (Figure 1). et al., 2011; Wang et al., 2013; Kim et al., 2013; Given the five observations, the key question Ahmed et al., 2013; Ho et al., 2010), our focus is faced by the model is: what is the topic distribu- on scaling to larger data sets and topic spaces. tion over a sixth topic variable from the same doc- 1http://websail.cs.northwestern.edu/ ument? In the case of the Dirichlet prior utilized projects/sbts/ for the topic distribution in LDA, the probability 775 = 0.24 = 0.36 = 0.36 = 0.30 = 0.30 = 0.30 = 0.30 9 10 11 12 z 1 2 3 4 5 6 7 8 nz = 1 0 0 2 1 0 0 0 0 0 0 1 P(Z|S, n) 0.46 0.36 0.36 1.56 0.56 0.46 0.14 0.14 0.14 0.24 0.24 0.34 Figure 1: An example Sparse Backoff Tree over 12 latent variable values. that the sixth topic variable has value z is propor- tion counts are zero in each case. In LDA, top- tional to nz + α, where α is a hyperparameter of ics six and eight would have equal pseudo-counts the model. (proportional to α). SBT differs from LDA in that it organizes the 3.1 Definitions topics into a tree structure in which the topics are Z leaves (see Figure 1). In this paper, we assume Let be a discrete random variable that takes inte- ger values in the set 1,...,L .
Load more

Recommended publications
  • Multi-View Learning for Hierarchical Topic Detection on Corpus of Documents
    Multi-view learning for hierarchical topic detection on corpus of documents Juan Camilo Calero Espinosa Universidad Nacional de Colombia Facultad de Ingenieria, Departamento de Ingenieria de Sistemas e Industrial. Bogot´a,Colombia 2021 Multi-view learning for hierarchical topic detection on corpus of documents Juan Camilo Calero Espinosa Tesis presentada como requisito parcial para optar al t´ıtulode: Magister en Ingenier´ıade Sistemas y Computaciøn´ Director: Ph.D. Luis Fernando Ni~noV. L´ıneade Investigaci´on: Procesamiento de lenguaje natural Grupo de Investigaci´on: Laboratorio de investigaci´onen sistemas inteligentes - LISI Universidad Nacional de Colombia Facultad de Ingenieria, Departamento de Ingenieria en Sistemas e Industrial. Bogot´a,Colombia 2021 To my parents Maria Helena and Jaime. To my aunts Patricia and Rosa. To my grandmothers Lilia and Santos. Acknowledgements To Camilo Alberto Pino, as the original thesis idea was his, and for his invaluable teaching of multi-view learning. To my thesis advisor, Luis Fernando Ni~no,and the Laboratorio de investigaci´onen sistemas inteligentes - LISI, for constantly allowing me to learn new knowl- edge, and for their valuable recommendations on the thesis. V Abstract Topic detection on a large corpus of documents requires a considerable amount of com- putational resources, and the number of topics increases the burden as well. However, even a large number of topics might not be as specific as desired, or simply the topic quality starts decreasing after a certain number. To overcome these obstacles, we propose a new method- ology for hierarchical topic detection, which uses multi-view clustering to link different topic models extracted from document named entities and part of speech tags.
    [Show full text]
  • Nonstationary Latent Dirichlet Allocation for Speech Recognition
    Nonstationary Latent Dirichlet Allocation for Speech Recognition Chuang-Hua Chueh and Jen-Tzung Chien Department of Computer Science and Information Engineering National Cheng Kung University, Tainan, Taiwan, ROC {chchueh,chien}@chien.csie.ncku.edu.tw model was presented for document representation with time Abstract evolution. Current parameters served as the prior information Latent Dirichlet allocation (LDA) has been successful for to estimate new parameters for next time period. Furthermore, document modeling. LDA extracts the latent topics across a continuous time dynamic topic model [12] was developed by documents. Words in a document are generated by the same incorporating a Brownian motion in the dynamic topic model, topic distribution. However, in real-world documents, the and so the continuous-time topic evolution was fulfilled. usage of words in different paragraphs is varied and Sparse variational inference was used to reduce the accompanied with different writing styles. This study extends computational complexity. In [6][7], LDA was merged with the LDA and copes with the variations of topic information the hidden Markov model (HMM) as the HMM-LDA model within a document. We build the nonstationary LDA (NLDA) where the Markov states were used to discover the syntactic by incorporating a Markov chain which is used to detect the structure of a document. Each word was generated either from stylistic segments in a document. Each segment corresponds to the topic or the syntactic state. The syntactic words and a particular style in composition of a document. This NLDA content words were modeled separately. can exploit the topic information between documents as well This study also considers the superiority of HMM in as the word variations within a document.
    [Show full text]
  • Large-Scale Hierarchical Topic Models
    Large-Scale Hierarchical Topic Models Jay Pujara Peter Skomoroch Department of Computer Science LinkedIn Corporation University of Maryland 2029 Stierlin Ct. College Park, MD 20742 Mountain View, CA 94043 [email protected] [email protected] Abstract In the past decade, a number of advances in topic modeling have produced sophis- ticated models that are capable of generating hierarchies of topics. One challenge for these models is scalability: they are incapable of working at the massive scale of millions of documents and hundreds of thousands of terms. We address this challenge with a technique that learns a hierarchy of topics by iteratively apply- ing topic models and processing subtrees of the hierarchy in parallel. This ap- proach has a number of scalability advantages compared to existing techniques, and shows promising results in experiments assessing runtime and human evalu- ations of quality. We detail extensions to this approach that may further improve hierarchical topic modeling for large-scale applications. 1 Motivation With massive datasets and corresponding computational resources readily available, the Big Data movement aims to provide deep insights into real-world data. Realizing this goal can require new approaches to well-studied problems. Complex models that, for example, incorporate many de- pendencies between parameters have alluring results for small datasets and single machines but are difficult to adapt to the Big Data paradigm. Topic models are an interesting example of this phenomenon. In the last decade, a number of sophis- ticated techniques have been developed to model collections of text, from Latent Dirichlet Allocation (LDA)[1] through extensions using statistical machinery such as the nested Chinese Restaurant Pro- cess [2][3] and Pachinko Allocation[4].
    [Show full text]
  • Journal of Applied Sciences Research
    Copyright © 2015, American-Eurasian Network for Scientific Information publisher JOURNAL OF APPLIED SCIENCES RESEARCH ISSN: 1819-544X EISSN: 1816-157X JOURNAL home page: http://www.aensiweb.com/JASR 2015 October; 11(19): pages 50-55. Published Online 10 November 2015. Research Article A Survey on Correlation between the Topic and Documents Based on the Pachinko Allocation Model 1Dr.C.Sundar and 2V.Sujitha 1Associate Professor, Department of Computer Science and Engineering, Christian College of Engineering and Technology, Dindigul, Tamilnadu-624619, India. 2PG Scholar, Department of Computer Science and Engineering, Christian College of Engineering and Technology, Dindigul, Tamilnadu-624619, India. Received: 23 September 2015; Accepted: 25 October 2015 © 2015 AENSI PUBLISHER All rights reserved ABSTRACT Latent Dirichlet allocation (LDA) and other related topic models are increasingly popular tools for summarization and manifold discovery in discrete data. In existing system, a novel information filtering model, Maximum matched Pattern-based Topic Model (MPBTM), is used.The patterns are generated from the words in the word-based topic representations of a traditional topic model such as the LDA model. This ensures that the patterns can well represent the topics because these patterns are comprised of the words which are extracted by LDA based on sample occurrence of the words in the documents. The Maximum matched pat-terns, which are the largest patterns in each equivalence class that exist in the received documents, are used to calculate the relevance words to represent topics. However, LDA does not capture correlations between topics and these not find the hidden topics in the document. To deal with the above problem the pachinko allocation model (PAM) is proposed.
    [Show full text]
  • Incorporating Domain Knowledge in Latent Topic Models
    INCORPORATING DOMAIN KNOWLEDGE IN LATENT TOPIC MODELS by David Michael Andrzejewski A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN–MADISON 2010 c Copyright by David Michael Andrzejewski 2010 All Rights Reserved i For my parents and my Cho. ii ACKNOWLEDGMENTS Obviously none of this would have been possible without the diligent advising of Mark Craven and Xiaojin (Jerry) Zhu. Taking a bioinformatics class from Mark as an undergraduate initially got me excited about the power of statistical machine learning to extract insights from seemingly impenetrable datasets. Jerry’s enthusiasm for research and relentless pursuit of excellence were a great inspiration for me. On countless occasions, Mark and Jerry have selflessly donated their time and effort to help me develop better research skills and to improve the quality of my work. I would have been lucky to have even a single advisor as excellent as either Mark or Jerry; I have been extremely fortunate to have them both as co-advisors. My committee members have also been indispensable. Jude Shavlik has always brought an emphasis on clear communication and solid experimental technique which will hopefully stay with me for the rest of my career. Michael Newton helped me understand the modeling issues in this research from a statistical perspective. Working with prelim committee member Ben Liblit gave me the exciting opportunity to apply machine learning to a very challenging problem in the debugging work presented in Chapter 4. I also learned a lot about how other computer scientists think from meetings with Ben.
    [Show full text]
  • Extração De Informação Semântica De Conteúdo Da Web 2.0
    Mestrado em Engenharia Informática Dissertação Relatório Final Extração de Informação Semântica de Conteúdo da Web 2.0 Ana Rita Bento Carvalheira [email protected] Orientador: Paulo Jorge de Sousa Gomes [email protected] Data: 1 de Julho de 2014 Agradecimentos Gostaria de começar por agradecer ao Professor Paulo Gomes pelo profissionalismo e apoio incondicional, pela sincera amizade e a total disponibilidade demonstrada ao longo do ano. O seu apoio, não só foi determinante para a elaboração desta tese, como me motivou sempre a querer saber mais e ter vontade de fazer melhor. À minha Avó Maria e Avô Francisco, por sempre estarem presentes quando eu precisei, pelo carinho e afeto, bem como todo o esforço que fizeram para que nunca me faltasse nada. Espero um dia poder retribuir de alguma forma tudo aquilo que fizeram por mim. Aos meus Pais, pelos ensinamentos e valores transmitidos, por tudo o que me proporcionaram e por toda a disponibilidade e dedicação que, constantemente, me oferecem. Tudo aquilo que sou, devo-o a vocês. Ao David agradeço toda a ajuda e compreensão ao longo do ano, todo o carinho e apoio demonstrado em todas as minhas decisões e por sempre me ter encorajado a seguir os meus sonhos. Admiro-te sobretudo pela tua competência e humildade, pela transmissão de força e confiança que me dás em todos os momentos. Resumo A massiva proliferação de blogues e redes sociais fez com que o conteúdo gerado pelos utilizadores, presente em plataformas como o Twitter ou Facebook, se tornasse bastante valioso pela quantidade de informação passível de ser extraída e explorada.
    [Show full text]
  • An Unsupervised Topic Segmentation Model Incorporating Word Order
    An Unsupervised Topic Segmentation Model Incorporating Word Order Shoaib Jameel and Wai Lam The Chinese University of Hong Kong One line summary of the work We will see how maintaining the document structure such as paragraphs, sentences, and the word order helps improve the performance of a topic model. Shoaib Jameel and Wai Lam SIGIR-2013, Dublin, Ireland 1 Outline Motivation Related Work I Probabilistic Unigram Topic Model (LDA) I Probabilistic N-gram Topic Models I Topic Segmentation Models Overview of our model I Our N-gram Topic Segmentation model (NTSeg) Text Mining Experiments of NTSeg I Word-Topic and Segment-Topic Correlation Graph I Topic Segmentation Experiment I Document Classification Experiment I Document Likelihood Experiment Conclusions and Future Directions Shoaib Jameel and Wai Lam SIGIR-2013, Dublin, Ireland 2 Motivation Many works in the topic modeling literature assume exchangeability among the words. As a result we see many ambiguous words in topics. For example, consider few topics obtained from the NIPS collection using the Latent Dirichlet Allocation (LDA) model: Example Topic 1 Topic 2 Topic 3 Topic 4 Topic 5 architecture order connectionist potential prior recurrent first role membrane bayesian network second binding current data module analysis structures synaptic evidence modules small distributed dendritic experts The problem with the LDA model Words in topics are not insightful. Shoaib Jameel and Wai Lam SIGIR-2013, Dublin, Ireland 3 Motivation Many works in the topic modeling literature assume exchangeability among the words. As a result we see many ambiguous words in topics. For example, consider few topics obtained from the NIPS collection using the Latent Dirichlet Allocation (LDA) model: Example Topic 1 Topic 2 Topic 3 Topic 4 Topic 5 architecture order connectionist potential prior recurrent first role membrane bayesian network second binding current data module analysis structures synaptic evidence modules small distributed dendritic experts The problem with the LDA model Words in topics are not insightful.
    [Show full text]
  • A New Method and Application for Studying Political Text in Multiple Languages
    The Pennsylvania State University The Graduate School THE RADICAL RIGHT IN PARLIAMENT: A NEW METHOD AND APPLICATION FOR STUDYING POLITICAL TEXT IN MULTIPLE LANGUAGES A Dissertation in Political Science by Mitchell Goist Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy May 2020 ii The dissertation of Mitchell Goist was reviewed and approved* by the following: Burt L. Monroe Liberal Arts Professor of Political Science Dissertation Advisor Chair of Committee Bruce Desmarais Associate Professor of Political Science Matt Golder Professor of Political Science Sarah Rajtmajer Assistant Professor of Information Science and Tecnology Glenn Palmer Professor of Political Science and Director of Graduate Studies iii ABSTRACT Since a new wave of radical right support in the early 1980s, scholars have sought to understand the motivations and programmatic appeals of far-right parties. However, due to their small size and dearth of data, existing methodological approaches were did not allow the direct study of these parties’ behavior in parliament. Using a collection of parliamentary speeches from the United Kingdom, Germany, Spain, Italy, the Netherlands, Finland, Sweden, and the Czech Re- public, Chapter 1 of this dissertation addresses this problem by developing a new model for the study of political text in multiple languages. Using this new method allows the construction of a shared issue space where each party is embedded regardless of the language spoken in the speech or the country of origin. Chapter 2 builds on this new method by explicating the ideolog- ical appeals of radical right parties. It finds that in some instances radical right parties behave similarly to mainstream, center-right parties, but distinguish themselves by a focus on individual crime and an emphasis on negative rhetorical frames.
    [Show full text]
  • Semi-Automatic Terminology Ontology Learning Based on Topic Modeling
    The paper has been accepted at Engineering Applications of Artificial Intelligence on 9 May 2017. This paper can cite as: Monika Rani, Amit Kumar Dhar, O.P. Vyas, Semi-automatic terminology ontology learning based on topic modeling, Engineering Applications of Artificial Intelligence, Volume 63, August 2017, Pages 108-125,ISSN 0952- 1976,https://doi.org/10.1016/j.engappai.2017.05.006. (http://www.sciencedirect.com/science/article/pii/S0952197617300891. Semi-Automatic Terminology Ontology Learning Based on Topic Modeling Monika Rani*, Amit Kumar Dhar and O. P. Vyas Department of Information Technology, Indian Institute of Information Technology, Allahabad, India [email protected] Abstract- Ontologies provide features like a common vocabulary, reusability, machine-readable content, and also allows for semantic search, facilitate agent interaction and ordering & structuring of knowledge for the Semantic Web (Web 3.0) application. However, the challenge in ontology engineering is automatic learning, i.e., the there is still a lack of fully automatic approach from a text corpus or dataset of various topics to form ontology using machine learning techniques. In this paper, two topic modeling algorithms are explored, namely LSI & SVD and Mr.LDA for learning topic ontology. The objective is to determine the statistical relationship between document and terms to build a topic ontology and ontology graph with minimum human intervention. Experimental analysis on building a topic ontology and semantic retrieving corresponding topic ontology for the user‟s query demonstrating the effectiveness of the proposed approach. Keywords: Ontology Learning (OL), Latent Semantic Indexing (LSI), Singular Value Decomposition (SVD), Probabilistic Latent Semantic Indexing (pLSI), MapReduce Latent Dirichlet Allocation (Mr.LDA), Correlation Topic Modeling (CTM).
    [Show full text]
  • Song Lyric Topic Modeling
    A Comparison of Topic Modeling Approaches for a Comprehensive Corpus of Song Lyrics Alen Lukic Language Technologies Institute School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Abstract In the interdisciplinary field of music information retrieval (MIR), applying topic modeling techniques to corpora of song lyrics remains an open area of research. In this paper, I discuss previous approaches to this problem and approaches which remain unexplored. I attempt to improve upon previous work by harvesting a larger, more comprehensive corpus of song lyrics. I will apply previously attempted topic modeling algorithms to this corpus, including latent Dirichlet allocation (LDA). In addition, I will also apply the Pachinko allocation (PAM) tech- nique to this corpus. PAM is a directed acylic graph-based topic modeling algorithm which models correlations between topics as well as words and therefore has more expressive power than LDA. Currently, there are no documented research results which utilize the PAM technique for topic modeling in song lyrics. Finally, I will obtain a collection of human-annotated songs in order to apply a supervised topic modeling approach and use the results in order to produce one of the topic quality metrics which will be investigated in this paper. 1 Introduction The field of music information retrieval encompasses the research efforts which address several prob- lems, including genre classification, mood categorization, and topic detection in lyrics. The focus of this paper is the latter of these problems. Within the study of topic modeling, topics are defined as a set of k item I = fi1; : : : ; iN g distri- butions P1(I);:::;Pk(I).
    [Show full text]
  • Topic Modeling Based on Keywords and Context
    Topic Modeling based on Keywords and Context Johannes Schneider, University of Liechtenstein Michail Vlachos, IBM Research, Zurich February 6, 2018 Abstract PLSA (and LDA) the frequency of a word within a topic heavily influences its probability (within the Current topic models often suffer from discovering top- topic) whereas the frequencies of the word in other ics not matching human intuition, unnatural switching topics have a lesser impact. Thus, a common word of topics within documents and high computational that occurs equally frequently across all topics might demands. We address these shortcomings by propos- have a large probability in each topic. This makes ing a topic model and an inference algorithm based on sense for models based on document “generation”, be- automatically identifying characteristic keywords for cause frequent words should be generated more often. topics. Keywords influence the topic assignments of But using our rationale that a likely word should also nearby words. Our algorithm learns (key)word-topic be typical for a topic, high scores (or probabilities) scores and self-regulates the number of topics. The should only be assigned to words that occur in a few inference is simple and easily parallelizable. A quali- topics. Although there are techniques that provide tative analysis yields comparable results to those of a weighing of words, they either do not fully cover state-of-the-art models, but with different strengths the above rationale and perform static weighing, e.g., and weaknesses. Quantitative analysis using eight TF-IDF, or they have high computational demands datasets shows gains regarding classification accuracy, but yield limited improvements [14].
    [Show full text]
  • A Latent Semantic Approach Yik-Cheung Tam CMU-LTI-09-016
    Rapid Unsupervised Topic Adaptation – a Latent Semantic Approach Yik-Cheung Tam CMU-LTI-09-016 Language Technologies Institute School of Computer Science Carnegie Mellon University 5000 Forbes Ave., Pittsburgh, PA 15213 www.lti.cs.cmu.edu Thesis Committee: Tanja Schultz (Chair) Alex Waibel Stephan Vogel Sanjeev P. Khudanpur, Johns Hopkins University Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy In Language and Information Technologies c 2009, Yik-Cheung Tam To Cindy, and my family, iv Abstract In open-domain language exploitation applications, a wide variety of topics with swift topic shifts has to be captured. Consequently, it is crucial to rapidly adapt all language components of a spoken language system. This thesis addresses unsupervised topic adap- tation in both monolingual and crosslingual settings. For automatic speech recognition we rapidly adapt a language model on a source language. For statistical machine translation, we adapt a language model of a target language, a translation lexicon and a phrase table using a source text. For monolingual adaptation, we propose latent Dirichlet-Tree allocation for Bayesian latent semantic analysis. Our model enables rapid incremental language model adaptation via caching the fractional topic counts of word hypotheses decoded from previous speech utterances. Latent Dirichlet-Tree allocation models topic correlation in a tree-based hi- erarchy and thus addresses the model initialization issue. To address the “bag-of-word” assumption in latent semantic analysis, we extend our approach to N-gram latent Dirichlet- Tree allocation. We investigate a fractional Kneser-Ney smoothing approach to handle fractional counts for topic models.
    [Show full text]