Clustering social networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4863 LNCS, Issue , 2007, Pages 56-67

  Mishra, Nina ^a,d   Schreiber, Robert ^b   Stanton, Isabelle ^a   Tarjan, Robert E ^b,c  

^a University of Virginia

^b HEWLETT PACKARD LABORATORIES   (United States)

^c Princeton University

^d MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; CLUSTERING ALGORITHMS;

EXTERNAL SPARSITY; INTERNAL DENSITY; SOCIAL NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 38149014810     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77004-6_5     Document Type: Conference Paper

References (19)

1. Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598-612. Springer, Heidelberg (2002)
2. Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC 2000. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, Oregon, pp. 171-180 (May 21-23, 2000)
3. Van Dongen, S.: A new cluster algorithm for graphs. Technical report, Universiteit Utrecht (July 10, 1998)
4. Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Mathematics 1(4), 385-408 (2004)
5. Gomory, R.E., Hu, T.C.: Multi terminal network flows. Journal of the Society for Industrial and Applied Mathematics 9, 551-571 (1961)
6. Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. IPL: Information Processing Letters 76, 175-181 (2000)
7. KDD Cup 2003 HEP-TH (2003), http://www.cs.Cornell.edu/projects/kddcup/ datasets.html
8. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters 27(3), 119-123 (1988)
9. Kannan, R., Vempala, S., Vetta, A.: On clusterings -good, bad and spectral. In: Proceedings of the 41th Annual Symposium on Foundations of Computer Science, pp. 367-377 (2000)
10. Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distrib. Comput. 48(1), 71-95 (1998)
11. Kempe, D., McSherry, F.: A decentralized algorithm for spectral analysis. In: STOC-2004. Proceedings of the thirty-sixth annual ACM Symposium on Theory of Computing, pp. 561-568. ACM Press, New York (June 13-15, 2004)
12. Krebs, V.: Uncloaking terrorist networks. First Monday 7(4) (2002)
13. Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. Computer Networks 31(11-16), 1481-1493 (1999)
14. LiveJournal, http://www.livejournal.com
15. Newman, M.E.J.: Modularity and community structure in networks. National Academy of Sciences 103, 8577-8582 (2006)
16. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence 22(8), 888-905 (2000)
17. Spielman, D.A., Teng, S.: Spectral partitioning works: Planar graphs and finite element meshes. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, vol. 37, pp. 96-105 (1996)
18. Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505-517 (1977)
19. Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Transactions on Algorithms 1(1), 2-13 (2005)