An LDA-based community structure discovery approach for large-scale social networks

ISI 2007: 2007 IEEE Intelligence and Security Informatics

Volumn , Issue , 2007, Pages 200-207

  Haizheng, Zhang ^a   Baojun, Qiu ^b   Giles, C Lee ^a   Henry C, Foley ^a   John, Yen ^a,b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b The Pennsylvania State University

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; COMPUTER SUPPORTED COOPERATIVE WORK; HIERARCHICAL SYSTEMS; INFORMATION ANALYSIS; LARGE SCALE SYSTEMS; STATE SPACE METHODS;

GRAPHICAL MODELS; HIERARCHICAL BAYESIAN ALGORITHMS; LATENT DIRICHLET ALLOCATION (LDA); TOPOLOGICAL INFORMATION;

DATA STRUCTURES;

EID: 34748842057     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. D. M. Wilkinson and B. A. Huberman, "A method for finding communities of related genes." Proc Natl Acad Sci U S A, vol. 101 Suppl 1, pp. 5241-5248, April 2004.
2. G. W. Flake, S. Lawrence, and C. L. Giles, "Efficient identification of web communities," in KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM Press, 2000, pp. 150-160.
3. G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis, "Graph clustering and minimum cut trees," Internet Mathematics, vol. 1, no. 4, pp. 385-408, 2004.
4. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks," Physical Review E, vol. 70, p. 066111, 2004. [Online]. Available: http://www.citebase.org/abstract?id=oai: arXiv.org:cond-mat/0408187
5. M. Girvan and M. E. Newman, "Community structure in social and biological networks." Proc Natl Acad Sci U S A, vol. 99, no. 12, pp. 7821-7826, June 2002.
6. J. Hopcroft, O. Khan, B. Kulis, and B. Selman, "Tracking evolving communities in large linked networks." Proc Natl Acad Sci U S A, vol. 101 Suppl 1, pp. 5249-5253, April 2004.
7. M. E. J. Newman, "Fast algorithm for detecting community structure in networks," Physical Review E, vol. 69, p. 066133, 2004. [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:condmat/0309508
8. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol. 435, p. 814, 2005. [Online]. Available: doi:10.1038/nature03607
9. J. P. Scott, Social Network Analysis: A Handbook. SAGE Publications, January 2000. ' [Online]. Available: http://www.amazon.co.uk/exec/ obidos/ASIN/0761963391/citeulike-21
10. D. Zhou, E. Manavoglu, J. Li, C. L. Giles, and H. Zha, "Probabilistic models for discovering e-communities." in WWW, 2006, pp. 173-182.
11. K. Börner, J. T. Maru, and R. L. Goldstone, "The simultaneous evolution of author and paper networks," pp. 5266-5273, Apr 2004.
12. M. E. Newman, "Coauthorship networks and patterns of scientific collaboration." Proc Natl Acad Sci U S A, vol. 101 Suppl 1, pp. 5200-5205, April 2004.
13. T. Krichel and N. Bakkalbasi, "A social network analysis of research collaboration in the economics community," Journal of Information Management and Scientometrics, To Appear.
14. L. Freeman, "A set of measures of centrality based upon betweeness," in Sociometry, 1977, pp. 35-41.
15. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co., 1979.
16. X. Wei and W. B. Croft, "Lda-based document models for ad-hoc retrieval." in SIGIR, 2006, pp. 178-185.
17. D. M. Blei, A. Y. Ng, and M. I. Jordan, "Latent dirichlet allocation," Journal of Machine Learning Research, vol. 3, pp. 993-1022, 2003.
18. E. B. Sudderth, A. Torralba, W. T. Freeman, and A. S. Willsky, "Learning hierarchical models of scenes, objects, and parts," in ICCV '05: Proceedings of the Tenth IEEE International Conference on Computer Vision. Washington, DC, USA: IEEE Computer Society, 2005, pp. 1331-1338.
19. X. Wang and A. McCallum, "Topics over time: a non-markov continuous-time model of topical trends." in KDD, 2006, pp. 424-433.
20. M. Rosen-Zvi, T. Griffiths, M. Steyvers, and P. Smyth, "The author-topic model for authors and documents," in AUAI '04: Proceedings of the 20th conference on Uncertainty in artificial intelligence. Arlington, Virginia, United States: AUAI Press, 2004, pp. 487-494.
21. W. Li and A. McCallum, "Pachinko allocation: Dag-structured mixture models of topic correlations." in ICML, 2006, pp. 577-584.
22. G. Heinrich, "Parameter estimation for text analysis," Technical Report, 2004.
23. D. Zhou, X. Ji, H. Zha, and C. L. Giles, "Topic evolution and social interactions: how authors effect research." in CIKM, 2006, pp. 248-257.
24. T. Minka and J. Lafferty, "Expectation-propagation for the generative aspect model," 2002.
25. C. Andrieu, N. de Freitas, A. Doucet, and M. I. Jordan, "An introduction to mcmc for machine learning." Machine Learning, vol. 50, no. 1-2, pp. 5-43, 2003.
26. T. Griffiths and M. Steyvers, "Finding scientific topics," in Proceedings of the National Academy of Sciences, 2004.
27. D. J. C. MacKay, Information Theory, Inference & Learning Algorithms. New York, NY, USA: Cambridge University Press, 2002.
28. R. N. Kostoff, J. A. Stump1, D. Johnson1, J. S. Murday, C. G. Lau, and W. M. Tolles, "The structure and infrastructure of the global nanotechnology literature," pp. 301-321, 2006.
29. L. Si and R. Jin, "Adjusting mixture weights of gaussian mixture model via regularized probabilistic latent semantic analysis." in PAKDD, 2005, pp. 622-631.
30. L. C. Freeman, T. J. Fararo, and W. B. J. M. H. Sunshine, "Locating leaders in local communities," in American Sociological Review, 1963, pp. 791-798.