IDEAS home Printed from https://ideas.repec.org/a/taf/tstfxx/v4y2020i1p66-77.html
   My bibliography  Save this article

Topic model for graph mining based on hierarchical Dirichlet process

Author

Listed:
  • Haibin Zhang
  • Shang Huating
  • Xianyi Wu

Abstract

In this paper, a nonparametric Bayesian graph topic model (GTM) based on hierarchical Dirichlet process (HDP) is proposed. The HDP makes the number of topics selected flexibly, which breaks the limitation that the number of topics need to be given in advance. Moreover, the GTM releases the assumption of ‘bag of words’ and considers the graph structure of the text. The combination of HDP and GTM takes advantage of both which is named as HDP–GTM. The variational inference algorithm is used for the posterior inference and the convergence of the algorithm is analysed. We apply the proposed model in text categorisation, comparing to three related topic models, latent Dirichlet allocation (LDA), GTM and HDP.

Suggested Citation

  • Haibin Zhang & Shang Huating & Xianyi Wu, 2020. "Topic model for graph mining based on hierarchical Dirichlet process," Statistical Theory and Related Fields, Taylor & Francis Journals, vol. 4(1), pages 66-77, July.
  • Handle: RePEc:taf:tstfxx:v:4:y:2020:i:1:p:66-77
    DOI: 10.1080/24754269.2019.1593098
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24754269.2019.1593098
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24754269.2019.1593098?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tstfxx:v:4:y:2020:i:1:p:66-77. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tstf .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.