Close category search window
 

Topic Discovery Based on LDA Model with Fast Gibbs Sampling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shi Jing ; Coll. of Comput. Sci. & Eng., Changchun Univ. of Technol., Changchun, China ; Li Wanlong

Topic discovery described here is used to determine the topic that a document or a segment discusses. It is very important for some applications of natural language processing (NLP), such as information retrieval/extraction, summarization and topic analysis etc. The paper extracts topic words based on Shannon information, in which latent Dirichlet allocation (LDA) is employed to represent word distribution. The estimation of the parameters is speeded up by fast Gibbs sampling. Words which do not appear in the analyzed document can be inferred as topic with the help of word clustering of background. Topics are represented by means of word groups. The experiment results show that our approach performs far better than other methods.

Published in:
Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on  (Volume:3 )

Date of Conference: 7-8 Nov. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.