Skip to main content

Incorporating Hierarchical Dirichlet Process into Tag Topic Model

  • Conference paper
  • 2407 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8229))

Abstract

The Latent Dirichlet Allocation (LDA) is a parametric approach and the number of topics must be predefined. So it is natural to try to capture uncertainty regarding the number of topics. This paper proposes a Tag Hierarchical Dirichlet Process (THDP) that automatically infers the number of topics while also leveraging the tag information associated with each document. In this model, we assume that an author is clear in his mind that the content will contains which aspects and for each aspect he will choose a tag to describe it, and then we consider problems involving groups of tag, where each tag within a group is a draw from a mixture model and it is desirable to share topic between groups. In this setting it is natural to consider Hierarchical Dirichlet Process, Where the well-known clustering property of the Dirichlet process provides a nonparametric prior for the number of topic within each tag. Experimental results on corpora demonstrate superior performance over the THDP model.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. About Tumblr.com (accessed October 13, 2012)

    Google Scholar 

  2. WordPress.com Stats (accessed October 13, 2012)

    Google Scholar 

  3. Tingting, H., Fang, L.: Semantic KnowledgeAcquisition from Blogs with Tag-Topic Model. China Communications 9(3), 38–48 (2012)

    Google Scholar 

  4. The, Y.W., Jordan, M., Beal, M., Blei, D.M.: Hierarchical Dirichlet processes. Journal of the American Statistical Association 101(476), 1566–1581 (2006)

    Article  MathSciNet  Google Scholar 

  5. Wang, X., Tieu, K., Gee-Wah, N., Grimson, W.E.L.: Trajectoryanalysis and semantic region modeling using a nonparametric Bayesian model. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8. IEEE, Anchorage (2008)

    Google Scholar 

  6. Sudderth, E.B., Torralba, A., Freeman, W.T., Willsky, A.S.: Describing visual scenes using transformed objects and parts. International Journal of Computer Vision 77(1-3), 291–330 (2008)

    Article  Google Scholar 

  7. Sudderth, E.B.: Graphical Models for Visual Object Recognition and Tracking [Ph. D. dissertation]. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, USA (2006)

    Google Scholar 

  8. Yakhnenko, O., Honavar, V.: Multimodal hierarchical Dirichlet process model for predicting image annotation andimageobject label correspondence. In: Proceedings of the SIAM International Conference on Data Mining, pp. 281–294. SIAM, Sparks (2009)

    Google Scholar 

  9. Cowans, P.J.: Information retrieval using hierarchical Dirichlet processes. In: Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 564–565. ACM, New York (2004)

    Google Scholar 

  10. Xu, T.B., Zhang, Z.F., Yu, P.S., Long, B.: Evolutionary clusteringby hierarchical Dirichlet process with hidden Markov state. In: Proceedings of the 8th IEEE International Conferenceon Data Mining, pp. 658–667. IEEE, Pisa (2008)

    Google Scholar 

  11. Williamson, S., Wang, C., Heller, K.A., Blei, D.M.: The IBP compound Dirichlet process and itsapplication to focused topic modeling. In: ICML (2010)

    Google Scholar 

  12. Chan, X., Zhou., M., Carin, L.: The contextual Focused Topic Model. In: KDD, pp. 96–104 (2012)

    Google Scholar 

  13. Issei, S., Kenichi, K., Hiroshi, N.: Practical Collapsed Variational Bayes Inference for Hierarchical Dirichlet Process. In: KDD, pp. 105–113 (2012)

    Google Scholar 

  14. Turney, P.D.: Mining the Web for Synonyms: PMI- IR versus LSA on TOEFL. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol. 2167, pp. 491–502. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Heinrich, G.: “Infinite LDA”– Implementing the HDP with minimum code complexity (2011)

    Google Scholar 

  16. Deng, H., Han, J., Zhao, B., Yu, Y., Lin, C.: Probabilistic topic models with biased propagation onheterogeneous information networks. In: KDD (2011)

    Google Scholar 

  17. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet Allocation. Journal of Machine Learning Research 3(4-5), 993–1022 (2003)

    MATH  Google Scholar 

  18. Heinrich, G.: Parameter estimation for text analysis (2005)

    Google Scholar 

  19. Steyvers, M., Griffiths, T.: Probabilistic topic models. Handbook of latent semantic analysis 427(7), 424–440 (2007)

    Google Scholar 

  20. Ranganathan, A.: The Dirichlet Process Mixture (DPM) Model (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, M., He, T., Li, F., Peng, L. (2013). Incorporating Hierarchical Dirichlet Process into Tag Topic Model. In: Liu, P., Su, Q. (eds) Chinese Lexical Semantics. CLSW 2013. Lecture Notes in Computer Science(), vol 8229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45185-0_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45185-0_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45184-3

  • Online ISBN: 978-3-642-45185-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics