DOCSLIB.ORG

Nonparametric Bayes Pachinko Allocation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Nonparametric Bayes Pachinko Allocation LI ET AL. 243 Nonparametric Bayes Pachinko Allocation Wei Li David Blei Andrew McCallum Department of Computer Science Computer Science Department Department of Computer Science University of Massachusetts Princeton University University of Massachusetts Amherst, MA 01003 Princeton, NJ 08540 Amherst, MA 01003 Abstract One example is the correlated topic model (CTM) (Blei & Lafferty, 2006). CTM represents each docu- Recent advances in topic models have ex- ment as a mixture of topics, where the mixture pro- plored complicated structured distributions portion is sampled from a logistic normal distribution. to represent topic correlation. For example, The parameters of this prior include a covariance ma- the pachinko allocation model (PAM) cap- trix in which each entry specifies the covariance be- tures arbitrary, nested, and possibly sparse tween a pair of topics. Therefore, topic occurrences correlations between topics using a directed are no longer independent from each other. However, acyclic graph (DAG). While PAM provides CTM is limited to pairwise correlations only, and the more flexibility and greater expressive power number of parameters in the covariance matrix grows than previous models like latent Dirichlet al- as the square of the number of topics. location (LDA), it is also more difficult to de- An alternative model that provides more flexibility to termine the appropriate topic structure for a describe correlations among topics is the pachinko al- specific dataset. In this paper, we propose a location model (PAM) (Li & McCallum, 2006), which nonparametric Bayesian prior for PAM based uses a directed acyclic graph (DAG) structure to rep- on a variant of the hierarchical Dirichlet pro- resent and learn arbitrary-arity, nested, and possibly cess (HDP). Although the HDP can cap- sparse topic correlations. Each leaf node in the DAG ture topic correlations defined by nested data represents a word in the vocabulary, and each interior structure, it does not automatically discover node corresponds to a topic. A topic in PAM can be such correlations from unstructured data. By not only a distribution over words, but also a distribu- assuming an HDP-based prior for PAM, we tion over other topics. Therefore it captures inter-topic are able to learn both the number of topics correlations as well as word correlations. The distribu- and how the topics are correlated. We eval- tion of a topic over its children could be parameterized uate our model on synthetic and real-world arbitrarily. One example is to use a Dirichlet distri- text datasets, and show that nonparamet- bution, from which a multinomial distribution over its ric PAM achieves performance matching the children is sampled on a per-document-basis. To gen- best of PAM without manually tuning the erate a word in a document in PAM, we start from the number of topics. root, samples a topic path based on these multinomials and finally samples the word. 1 Introduction The DAG structure in PAM is extremely flexible. It could be a simple tree (hierarchy), or an arbitrary DAG, with cross-connected edges, and edges skipping Statistical topic models such as latent Dirichlet alloca- levels. Some other models can be viewed as special tion (LDA) (Blei et al., 2003) have been shown to be cases of PAM. For example, LDA corresponds to a effective tools in topic extraction and analysis. These three-level hierarchy consisting of one root at the top, models can capture word correlations in a collection of a set of topics in the middle and a word vocabulary at textual documents with a low-dimensional set of multi- the bottom. The root is fully connected to all the top- nomial distributions. Recent work in this area has in- ics, and each topic is fully connected to all the words. vestigated richer structures to also describe inter-topic The structure of CTM can be described with a four- correlations, and led to discovery of large numbers of level DAG in PAM, in which there are two levels of more accurate, fine-grained topics. 244 LI ET AL. topic nodes between the root and words. The lower- 2 The Model level consists of traditional LDA-style topics. In the upper level there is one node for every topic pair, cap- 2.1 Four-Level PAM turing pairwise correlations. Pachinko allocation captures topic correlations with a While PAM provides a powerful means to describe directed acyclic graph (DAG), where each leaf node is inter-topic correlations and extract large numbers of associated with a word and each interior node corre- fine-grained topics, it has the same practical difficulty sponds to a topic, having a distribution over its chil- as many other topic models, i.e. how to determine dren. An interior node whose children are all leaves the number of topics. It can be estimated using cross- would correspond to a traditional LDA topic. But validation, but this method is not efficient even for some interior nodes may also have children that are simple topic models like LDA. Since PAM has a more other topics, thus representing a mixture over topics. complex topic structure, it is more difficult to evaluate all possibilities and select the best one. While PAM allows arbitrary DAGs to model topic cor- relations, in this paper we focus on one special class Another approach to this problem is to automatically of structures. Consider a four-level hierarchy consist- learn the number of topics with a nonparametric prior ing of one root topic, s2 topics at the second level, such as the hierarchical Dirichlet process (HDP) (Teh s3 topics at the third level, and words at the bot- et al., 2005). HDPs are intended to model groups tom. We call the topics at the second level super-topics of data that have a pre-defined hierarchical structure. and the ones at the third level sub-topics. The root Each pre-defined group is associated with a Dirichlet is connected to all super-topics, super-topics are fully process whose base measure is sampled from a higher- connected to sub-topics and sub-topics are fully con- level Dirichlet process. Note that HDP cannot au- nected to words. For the root and each super-topic, tomatically discover topic correlations from unstruc- we assume a Dirichlet distribution parameterized by tured data. However, it has been applied to LDA a vector with the same dimension as the number of where it integrates over (or alternatively selects) the children. Each sub-topic is associated with a multi- appropriate number of topics. nomial distribution over words, sampled once for the In this paper, we propose a nonparametric Bayesian whole corpus from a single Dirichlet distribution. To prior for pachinko allocation based on a variant of generate a document, we first draw a set of multino- the hierarchical Dirichlet process. We assume that mials from the Dirichlet distributions at the root and the topics in PAM are organized into multiple levels super-topics. Then for each word in the document, we and each level is modeled with an HDP to capture un- sample a topic path consisting of the root, super-topic certainty in the number of topics. Unlike a standard and sub-topic based on these multinomials. Finally, HDP mixture model, where the data has a pre-defined we sample a word from the sub-topic. nested structure, we build HDPs based on dynamic As with many other topic models, we need to spec- groupings of data according to topic assignments. The ify the number of topics in advance for the four- nonparametric PAM can be viewed as an extension to level PAM. It is inefficient to manually examine every fixed-structure PAM where the number of topics at (s2, s3) pair in order to find the appropriate structure. each level is taken to infinity. To generate a docu- Therefore, we develop a nonparametric Bayesian prior ment, we first sample multinomial distributions over based on the Dirichlet process to automatically deter- topics from corresponding HDPs. Then we repeatedly mine the numbers of topics. As a side effect, this also sample a topic path according to the multinomials for discovers a sparse connectivity between super-topics each word in the document. and sub-topics. We present our model in terms of Chi- The rest of the paper is organized as follows. We de- nese restaurant process. tail the nonparametric pachinko allocation model in Section 2, describing its generative process and infer- 2.2 Chinese Restaurant Process ence algorithm. Section 3 presents experimental re- sults on synthetic data and real-world text data. We The Chinese restaurant process (CRP) is a distribu- compare discovered topic structures with true struc- tion on partitions of integers. It assumes a Chinese tures for various synthetic settings, and likelihood on restaurant with an infinite number of tables. When a held-out test data with PAM, HDP and hierarchical customer comes, he sits at a table with the following LDA (Blei et al., 2004) on two datasets. Section 4 re- probabilities: views related work, followed by conclusions and future C(t) work in Section 5. • P (an occupied table t) = P 0 , t0 C(t )+α α • P (an unoccupied table) = P 0 , t0 C(t )+α LI ET AL. 245 Name Description 1. He chooses the kth entryway ejk in the restau- rj the jth restaurant. rant from CRP({C(j, k)}k, α0), where C(j, k) is ejk the kth entryway in the jth restaurant. the number of customers that entered the kth en- cl the lth category. Each entryway ejk is associated tryway before in this restaurant. with a category. 2. If e is a new entryway, a category c is assigned t the nth table in the jth restaurant that has jk l jln to it from CRP({P C(l, j0)} , γ ), where C(l, j0) category c .
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]
  • WELDA: Enhancing Topic Models by Incorporating Local Word Context
    WELDA: Enhancing Topic Models by Incorporating Local Word Context Stefan Bunk Ralf Krestel Hasso Plattner Institute Hasso Plattner Institute Potsdam, Germany Potsdam, Germany [email protected] [email protected] ABSTRACT The distributional hypothesis states that similar words tend to have similar contexts in which they occur. Word embedding models exploit this hypothesis by learning word vectors based on the local context of words. Probabilistic topic models on the other hand utilize word co-occurrences across documents to identify topically related words. Due to their complementary nature, these models define different notions of word similarity, which, when combined, can produce better topical representations. In this paper we propose WELDA, a new type of topic model, which combines word embeddings (WE) with latent Dirichlet allo- cation (LDA) to improve topic quality. We achieve this by estimating topic distributions in the word embedding space and exchanging selected topic words via Gibbs sampling from this space. We present an extensive evaluation showing that WELDA cuts runtime by at least 30% while outperforming other combined approaches with Figure 1: Illustration of an LDA topic in the word embed- respect to topic coherence and for solving word intrusion tasks. ding space. The gray isolines show the learned probability distribution for the topic. Exchanging topic words having CCS CONCEPTS low probability in the embedding space (red minuses) with • Information systems → Document topic models; Document high probability words (green pluses), leads to a superior collection models; • Applied computing → Document analysis; LDA topic. KEYWORDS word by the company it keeps” [11]. In other words, if two words topic models, word embeddings, document representations occur in similar contexts, they are similar.
    [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]
  • Generative Topic Embedding: a Continuous Representation of Documents
    Generative Topic Embedding: a Continuous Representation of Documents Shaohua Li1,2 Tat-Seng Chua1 Jun Zhu3 Chunyan Miao2 [email protected] [email protected] [email protected] [email protected] 1. School of Computing, National University of Singapore 2. Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly (LILY) 3. Department of Computer Science and Technology, Tsinghua University Abstract as continuous vectors in a low-dimensional em- bedding space (Bengio et al., 2003; Mikolov et al., Word embedding maps words into a low- 2013; Pennington et al., 2014; Levy et al., 2015). dimensional continuous embedding space The learned embedding for a word encodes its by exploiting the local word collocation semantic/syntactic relatedness with other words, patterns in a small context window. On by utilizing local word collocation patterns. In the other hand, topic modeling maps docu- each method, one core component is the embed- ments onto a low-dimensional topic space, ding link function, which predicts a word’s distri- by utilizing the global word collocation bution given its context words, parameterized by patterns in the same document. These their embeddings. two types of patterns are complementary. When it comes to documents, we wish to find a In this paper, we propose a generative method to encode their overall semantics. Given topic embedding model to combine the the embeddings of each word in a document, we two types of patterns. In our model, topics can imagine the document as a “bag-of-vectors”. are represented by embedding vectors, and Related words in the document point in similar di- are shared across documents.
    [Show full text]
  • Linked Data Triples Enhance Document Relevance Classification
    applied sciences Article Linked Data Triples Enhance Document Relevance Classification Dinesh Nagumothu * , Peter W. Eklund , Bahadorreza Ofoghi and Mohamed Reda Bouadjenek School of Information Technology, Deakin University, Geelong, VIC 3220, Australia; [email protected] (P.W.E.); [email protected] (B.O.); [email protected] (M.R.B.) * Correspondence: [email protected] Abstract: Standardized approaches to relevance classification in information retrieval use generative statistical models to identify the presence or absence of certain topics that might make a document relevant to the searcher. These approaches have been used to better predict relevance on the basis of what the document is “about”, rather than a simple-minded analysis of the bag of words contained within the document. In more recent times, this idea has been extended by using pre-trained deep learning models and text representations, such as GloVe or BERT. These use an external corpus as a knowledge-base that conditions the model to help predict what a document is about. This paper adopts a hybrid approach that leverages the structure of knowledge embedded in a corpus. In particular, the paper reports on experiments where linked data triples (subject-predicate-object), constructed from natural language elements are derived from deep learning. These are evaluated as additional latent semantic features for a relevant document classifier in a customized news- feed website. The research is a synthesis of current thinking in deep learning models in NLP and information retrieval and the predicate structure used in semantic web research. Our experiments Citation: Nagumothu, D.; Eklund, indicate that linked data triples increased the F-score of the baseline GloVe representations by 6% P.W.; Ofoghi, B.; Bouadjenek, M.R.
    [Show full text]
  • Document and Topic Models: Plsa
    10/4/2018 Document and Topic Models: pLSA and LDA Andrew Levandoski and Jonathan Lobo CS 3750 Advanced Topics in Machine Learning 2 October 2018 Outline • Topic Models • pLSA • LSA • Model • Fitting via EM • pHITS: link analysis • LDA • Dirichlet distribution • Generative process • Model • Geometric Interpretation • Inference 2 1 10/4/2018 Topic Models: Visual Representation Topic proportions and Topics Documents assignments 3 Topic Models: Importance • For a given corpus, we learn two things: 1. Topic: from full vocabulary set, we learn important subsets 2. Topic proportion: we learn what each document is about • This can be viewed as a form of dimensionality reduction • From large vocabulary set, extract basis vectors (topics) • Represent document in topic space (topic proportions) 푁 퐾 • Dimensionality is reduced from 푤푖 ∈ ℤ푉 to 휃 ∈ ℝ • Topic proportion is useful for several applications including document classification, discovery of semantic structures, sentiment analysis, object localization in images, etc. 4 2 10/4/2018 Topic Models: Terminology • Document Model • Word: element in a vocabulary set • Document: collection of words • Corpus: collection of documents • Topic Model • Topic: collection of words (subset of vocabulary) • Document is represented by (latent) mixture of topics • 푝 푤 푑 = 푝 푤 푧 푝(푧|푑) (푧 : topic) • Note: document is a collection of words (not a sequence) • ‘Bag of words’ assumption • In probability, we call this the exchangeability assumption • 푝 푤1, … , 푤푁 = 푝(푤휎 1 , … , 푤휎 푁 ) (휎: permutation) 5 Topic Models: Terminology (cont’d) • Represent each document as a vector space • A word is an item from a vocabulary indexed by {1, … , 푉}. We represent words using unit‐basis vectors.
    [Show full text]