AlSumait, L.; Barbará, D.; Gentle, J. & Domeniconi, C. (2009), 'Topic Significance Ranking of LDA Generative Models', Machine Learning and Knowledge Discovery in Databases , 67--82 .
[BibTeX] [Endnote]

Topic models, like Latent Dirichlet Allocation (LDA), have been recently used to automatically generate text corpora topics, and to subdivide the corpus words among those topics. However, not all the estimated topics are of equal importance or correspondto genuine themes of the domain. Some of the topics can be a collection of irrelevant words, or represent insignificant themes.Current approaches to topic modeling perform manual examination to find meaningful topics. This paper presents the first automatedunsupervised analysis of LDA models to identify junk topics from legitimate ones, and to rank the topic significance. Basically,the distance between a topic distribution and three definitions of “junk distribution” is computed using a variety of measures,from which an expressive figure of the topic significance is implemented using 4-phase Weighted Combination approach. Ourexperiments on synthetic and benchmark datasets show the effectiveness of the proposed approach in ranking the topic significance.

Chebolu, P. & Melsted, P. (2008), 'PageRank and the random surfer model', , 1010--1018 .
[BibTeX] [Endnote]

2002

Pennock, D.; Flake, G.; Lawrence, S.; Glover, E. & Giles, C. L. (2002), 'Winners don't take all: Characterizing the
competition for links on the web', Proc.National Academy of Sciences 99 (8) , 5207--5211 .
[BibTeX] [Endnote]

Snijders, T. (2002), 'Markov chain Monte Carlo estimation of exponential random graph models', Journal of Social Structure 3 (2) , 1--40 .
[BibTeX] [Endnote]

2001

Newman, M.; Strogatz, S. & Watts, D. (2001), 'Random graphs with arbitrary degree distributions and their applications', Arxiv preprint cond-mat/0007235 .
[BibTeX] [Endnote]

1999

Anderson, C.; Wasserman, S. & Crouch, B. (1999), 'A p* primer: Logit models for social networks', Social Networks 21 (1) , 37--66 .
[BibTeX] [Endnote]

1998

Jordan, M., ed. (1998), Learning in Graphical Models , MIT Press .
[BibTeX] [Endnote]

1995

Molloy, M. & Reed, B. (1995), 'A critical point for random graphs with a given degree sequence' , Random Structures & Algorithms 6 , 161-179 .
[BibTeX] [Endnote]