SSDE-cluster: East overlapping clustering of networks using sampled spectral distance embedding and GMMs

Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011

Volumn , Issue , 2011, Pages 756-759

  Magdon Ismail, Malik ^a   Purnell, Jonathan ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ALGORITHM; GAUSSIAN MIXTURE MODEL; ONLINE INTERACTION; OVERLAPPING CLUSTERING; OVERLAPPING CLUSTERS; SINGLE CPU; SOCIAL NETWORKS;

CLUSTER COMPUTING; SOCIAL NETWORKING (ONLINE); SOCIAL SCIENCES COMPUTING;

CLUSTERING ALGORITHMS;

EID: 84856140883     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PASSAT/SocialCom.2011.237     Document Type: Conference Paper

References (20)

1. M. McPherson, L. Smith-Lovin, and J. Cook, "Birds of a feather: Homophily in social networks, " Rev. Soc., vol. 27, pp. 415-444, 2001.
2. S. Fortunato, "Community detection in graphs, " Phys. Rep. 486, 75-174 (2010), vol. 486, pp. 75-174, 2010.
3. M. Girvan and M. E. J. Newman, "Community structure in social and biological networks." PNAS, vol. 99, no. 12, pp. 7821-7826, June 2002. (Pubitemid 34650963)
4. M. Newman, "The structure and function of complex networks, " SIAM review, vol. 45, no. 2, pp. 167-256, 2003.
5. M. Newman and M. Girvan, "Finding and evaluating community structure in networks, " Phys. Rev. E, vol. 69, no. 2, pp. 1-15, February 2004.
6. S. Gregory, "An algorithm to find overlapping community structure in networks, " Proc. PKDD, pp. 91-102, 2007.
7. K. Sequeira and M. Zaki, "SCHISM: a new approach to interesting subspace mining, " Bus. Intel. & Data Min., vol. 1, no. 2, p. 137, 2005.
8. J. Baumes, M. Goldberg, and M. Magdon-Ismail, "Efficient Identification of overlapping communities, " ISI, vol. 1, no. 2, pp. 27-36, 2005. (Pubitemid 41314419)
9. M. Al Hasan, S. Salem, B. Pupacdi, and M. Zaki, "Clustering with Lower Bound on Similarity, " in Proc. 13th PAKDD, 2009, p. 122.
10. G. Palla, I. Deŕenyi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society." Nature, vol. 435, no. 7043, pp. 814-8, June 2005. (Pubitemid 40839731)
11. M. Zaki, M. Peters, I. Assent, and T. Seidl, "Clicks: An effective algorithm for mining subspace clusters in categorical dataset, " Data & Knowledge Engineering, vol. 60, no. 1, pp. 51-70, January 2007. (Pubitemid 46053589)
12. A. Ng, M. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm, " NIPS, vol. 2, pp. 849-856, 2002.
13. D. Yan, L. Huang, and M. I. Jordan, "Fast approximate spectral clustering, " in Proc. 15th SIGKDD, 2009.
14. A. Civril, M. Magdon-Ismail, and E. Bocek-Rivele, "SSDE: Fast graph drawing using sampled spectral distance embedding, " in Graph Drawing, 2006, pp. 30-41.
15. C. M. Bishop, Neural Networks for Pattern Recognition. Oxford University Press, 1996.
16. M. Magdon-Ismail and J. Purnell, "Approximating the covariance matrix with low rank perturbations, " in Proc. IDEAL", 2010.
17. J. Baumes, M. Goldberg, M. Krishnamoorthy, M. Magdon-Ismail, and N. Preston, "Finding communities by clustering a graph into overlapping subgraphs, " in IADIS, 2005, pp. 97-104.
18. M. Ley, "DBLP: Computer science bibliography, " 1993.
19. C. van Rijsbergen and S. Robertson, "New models in probabilistic information retreival, " London British Library, 1980.
20. J. Purnell, "LRGMM code, " www.cs.rpi.edu/̃purnej/code. php, 2010.