Publications
Topic Significance Ranking of LDA Generative Models
AlSumait, L.; Barbará, D.; Gentle, J. & Domeniconi, C.
Machine Learning and Knowledge Discovery in Databases 67-82 (2009) [pdf]
Topic models, like Latent Dirichlet Allocation (LDA), have been recently used to automatically generate text corpora topics,
d 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.
PageRank and the random surfer model
Chebolu, P. & Melsted, P.
1010-1018 (2008) [pdf]
Winners don't take all: Characterizing the
competition for links on the web
Pennock, D.; Flake, G.; Lawrence, S.; Glover, E. & Giles, C. L.
Proc.National Academy of Sciences, 99(8) 5207-5211 (2002)
Markov chain Monte Carlo estimation of exponential random graph models
Snijders, T.
Journal of Social Structure, 3(2) 1-40 (2002)
Random graphs with arbitrary degree distributions and their applications
Newman, M.; Strogatz, S. & Watts, D.
Arxiv preprint cond-mat/0007235 (2001)
A p* primer: Logit models for social networks
Anderson, C.; Wasserman, S. & Crouch, B.
Social Networks, 21(1) 37-66 (1999)
Learning in Graphical Models
1998, Jordan, M., ed., MIT Press
A critical point for random graphs with a given degree sequence
Molloy, M. & Reed, B.
Random Structures & Algorithms, 6(), 161-179(1995) [pdf]