Mixture Models for Document Clustering. Edward J. Wegman Yasmin H. Said George Mason University, College of Science October 30, 2008 University of Maryland, College Park. Outline. Overview of Text Mining Vector Space Text Models Latent Semantic Indexing Social Networks
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Edward J. Wegman
Yasmin H. Said
George Mason University, College of Science
October 30, 2008
University of Maryland, College Park
Consider a bipartite individual by institution social network. Let Am×nbe the individual by institution adjacency matrix withm = the number of individuals and n = the number of institutions. Then
Cm×m = Am×nATn×m=
Individual-Individual social network adjacency matrix with cii = ∑jaij =the strength of ties to all individuals in i’s social network and cij = the tie strength between individual i and individual j.
Pn×n = ATn×m Am×n=
Institution by Institution social network adjacency matrix with pjj=∑iaij= strength of ties to all institutions ini’s social network withpij the tie strength between institution i and institutionj.
Our A matrix
Our P matrix
Block Model P Matrix - Clustered
Block Model Matrix – Our C Matrix Clustered
Edward J. Wegman
Department of Computational and Data Sciences
MS 6A2, George Mason University
4400 University Drive
Fairfax, VA 22030-4444 USA
Phone: +1 703 993-1691