Stochastic local clustering for massive graphs

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

Volumn 3518 LNAI, Issue , 2005, Pages 354-360

  Schaeffer, Satu Elisa ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANNEALING; CALCULATIONS; GRAPH THEORY; HEURISTIC METHODS;

CLUSTERING GRAPHS; EXAMINED DATA; THEORETICAL CLUSTERINGS;

RANDOM PROCESSES;

EID: 26944485494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11430919_42     Document Type: Conference Paper

References (14)

1. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In G. Di Battista and U. Zwick, eds, Proc. of ESA, vol. 2832 of LNCS, pp. 568-579, Heidelberg, Germany, 2003. Springer-Verlag.
2. S. Guha, et al. Clustering data streams. In Proc. of FOCS, pp. 359-366, Los Alamitos, USA, 2000. IEEE Comp. Soc. Press.
3. R. Kannan, S. Vempala, and A. Vetta. On clusterings - good, bad and spectral. In Proc. of FOCS, pp. 367-377, Los Alamitos, USA, 2000. IEEE Comp. Soc. Press.
4. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, 1983.
5. J. Kleinberg and S. Lawrence. The structure of the web. Science, 294(5548):1849-1850, 2001.
6. M. Mihail, et al. On the semantics of Internet topologies. Tech. report GIT-CC-02-07, Atlanta, USA, 2002.
7. M. E. J. Newman. The structure of scientific collaboration networks. Proc Natl Acad Sci USA, 98(2):404-409, 2001.
8. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69:066133, 2004.
9. L. O'Callaghan, et al. Streaming-data algorithms for high-quality clustering. In Proc. of ICDE, pp. 685-694, Los Alamitos, USA, 2002. IEEE Comp. Soc. Press.
10. P. Orponen and S. E. Schaeffer. Local clustering of large graphs by approximate Fiedler vectors. In S. Nikoletseas, ed., Proc. of WEA, LNCS, Heidelberg, Germany, to appear. Springer-Verlag.
11. J. Šíma and S. E. Schaeffer. On the NP-completeness of some cluster fitness measures, 2005. In preparation.
12. S. E. Virtanen. Clustering the Chilean web. In Proc. of LA-Web, pp. 229-231, Los Alamitos, USA, 2003. IEEE Comp. Soc. Press.
13. S. E. Virtanen. Properties of nonuniform random graph models. Research Report A77, TCS, TKK, Espoo, Finland, 2003.
14. S. E. Virtanen and P. Nikander. Local clustering for hierarchical ad hoc networks. In Proc. of WiOpt'04, pp. 404-405, 2004.