Community Detection in Large-scale Networks

PhD Qualifying Examination


Title: "Community Detection in Large-scale Networks"

by

Miss Hua LIU


Abstract:

Detecting clusters or communities in large real-world graphs is of considerable 
interest. In this survey, we review some major works about community detection. 
We start with introducing the background and importance of studying the 
community detection problem. Next, we analyze the graph patterns of large-scale 
networks as well as the statistical properties of communities in real-world 
graphs. Then, we discuss some major evaluation metrics researchers use in 
measuring the quality of a community. After that, we discuss some 
representative community detection algorithm by dividing them into three 
categorizes: link analysis algorithms, content analysis algorithms and 
algorithms which combine both of these two information sources. We discuss 
these algorithms one by one and voice our own opinions about the pros and cons 
of these algorithms. Finally, we conclude this survey and discuss some 
potential directions for future research.


Date:                   Monday, 10 January 2011

Time:                   12:00noon - 2:00pm

Venue:                  Room 3494
                         lifts 25/26

Committee Members:      Prof. Nevin Zhang (Supervisor)
                         Dr. Raymond Wong (Chairperson)
 			Dr. Lei Chen
 			Prof. Dit-Yan Yeung


**** ALL are Welcome ****