| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| AlSumait, L., Barbará, D., Gentle, J. & Domeniconi, C. | Topic Significance Ranking of LDA Generative Models | 2009 | Machine Learning and Knowledge Discovery in Databases, pp. 67-82 | article | URL |
| Abstract: 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. |
|||||
BibTeX:
@article{loulwah2009topic,
author = {AlSumait, Loulwah and Barbará, Daniel and Gentle, James and Domeniconi, Carlotta},
title = {Topic Significance Ranking of LDA Generative Models},
journal = {Machine Learning and Knowledge Discovery in Databases},
year = {2009},
pages = {67--82},
url = {http://dx.doi.org/10.1007/978-3-642-04180-8_22}
}
|
|||||
| Chebolu, P. & Melsted, P. | PageRank and the random surfer model [BibTeX] |
2008 | Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1010-1018 | article | URL |
BibTeX:
@article{chebolu2008pagerank,
author = {Chebolu, P. and Melsted, P.},
title = {PageRank and the random surfer model},
booktitle = {Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms},
year = {2008},
pages = {1010--1018},
url = {http://scholar.google.de/scholar.bib?q=info:f7YaFVQIaeIJ:scholar.google.com/&output=citation&hl=de&ct=citation&cd=2}
}
|
|||||
| Pennock, D., Flake, G., Lawrence, S., Glover, E. & Giles, C.L. | Winners don't take all: Characterizing the
competition for links on the web [BibTeX] |
2002 | Proc.National Academy of Sciences Vol. 99(8), pp. 5207-5211 |
article | |
BibTeX:
@article{pennock2002winners,
author = {Pennock, David and Flake, Gary and Lawrence, Steve and Glover, Eric and Giles, C. Lee},
title = {Winners don't take all: Characterizing the
|
|||||
| Snijders, T. | Markov chain Monte Carlo estimation of exponential random graph models [BibTeX] |
2002 | Journal of Social Structure Vol. 3(2), pp. 1-40 |
article | |
BibTeX:
@article{snijders2002mcm,
author = {Snijders, T.A.B.},
title = {Markov chain Monte Carlo estimation of exponential random graph models},
journal = {Journal of Social Structure},
year = {2002},
volume = {3},
number = {2},
pages = {1--40}
}
|
|||||
| Newman, M., Strogatz, S. & Watts, D. | Random graphs with arbitrary degree distributions and their applications [BibTeX] |
2001 | Arxiv preprint cond-mat/0007235 | article | |
BibTeX:
@article{newman2001rga,
author = {Newman, MEJ and Strogatz, SH and Watts, DJ},
title = {Random graphs with arbitrary degree distributions and their applications},
journal = {Arxiv preprint cond-mat/0007235},
year = {2001}
}
|
|||||
| Anderson, C., Wasserman, S. & Crouch, B. | A p* primer: Logit models for social networks [BibTeX] |
1999 | Social Networks Vol. 21(1), pp. 37-66 |
article | |
BibTeX:
@article{anderson1999ppl,
author = {Anderson, C.J. and Wasserman, S. and Crouch, B.},
title = {A p* primer: Logit models for social networks},
journal = {Social Networks},
publisher = {Elsevier},
year = {1999},
volume = {21},
number = {1},
pages = {37--66}
}
|
|||||
| Learning in Graphical Models [BibTeX] |
1998 | book | |||
BibTeX:
@book{jordan-learning-98,,
title = {Learning in Graphical Models},
publisher = {MIT Press},
year = {1998}
}
|
|||||
| Molloy, M. & Reed, B. | A critical point for random graphs with a given degree sequence [BibTeX] |
1995 | Random Structures & Algorithms Vol. 6, pp. 161-179 |
misc | URL |
BibTeX:
@misc{molloy_reed95,
author = {Molloy, M. and Reed, B.},
title = {A critical point for random graphs with a given degree sequence},
journal = {Random Structures & Algorithms},
year = {1995},
volume = {6},
pages = {161-179},
url = {/brokenurl#citeseer.ist.psu.edu/molloy95critical.html}
}
|
|||||
Created by JabRef on 19/04/2024.