Seminar Details
2011-04-26 (15.00) : A new algorithm to compute communities in large networks: application to image and video processing
At Euler building
Organized by Mathematical Engineering
Speaker :
Browet, Arnaud
Abstract :
During the last years, there has been an increasing interest for large
graph analysis due to the development of network modeling in various
areas. Real networks have an high tendency to cluster themselves in
community structures, i.e. in groups of highly connected vertices with
weak links between groups. The Louvain method is a community detection
algorithm that has proven its high capacity to extract good
communities. In this talk, we will present a new community detection
technique based on a fast approximation of the classical Louvain
method with only one assignment and one correction step. We will show
that, in spite of its simplicity, the method also extracts good
community structures and can even be better in terms of quality than
the classical Louvain method when the uncertainty of the graph is
increasing. We will apply this algorithm to the image segmentation and
video tracking problems.