HIIT seminars in spring 2007 will be held in hall **B222** of Exactum, on Fridays starting at 10:15 a.m. Coffee available from 10.
Fri May 11
Pekka Orponen
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Abstract:
We address the problem of determining the natural neighbourhood of a
given node i in a large nonuniform network G in a way that uses only
local computations, i.e. without recourse to the full adjacency
matrix of G. We present a constrained spectral clustering approach
to the task. Observing that a gradient method for computing the
respective Fiedler vector values at each node can be implemented in
a local manner leads to our eventual algorithm. The algorithm
is evaluated experimentally using three types of nonuniform networks:
randomised "caveman graphs", a scientific collaboration network, and
a small social interaction network. (Joint work with Satu Elisa Schaeffer.)
Last updated on 11 May 2007 by Martti Mäntylä - Page created on 11 May 2007 by Teija Kujala