Compare Leskovec et al. WWW 10 and Leskovec et al. WWW 08
Papers
Empirical comparison of algorithms for network community detection, Leskovec et al., WWW 2010
Statistical properties of community structure in large social and information networks. In WWW ’08, Leskovec et al.
Method
The WWW08 paper suggest that NCP is a good way to analyse community structure. And it is also a good way to analyse community detection algorithms to test if the detected networks have the same properties with NCP plot from real communities. WWW10 paper did a extensive comparison and analysis of different community detection algorithms. While comparing, besides NCP and conductance, more criterion and features are discussed to give a comprehensive view of these algorithm.
Dataset Used
As both the papers are kind of a discussion-and-comparison-style, they use a lot of datasets and they overlaps mostly.
Problem
Both papers focus on community network structure. The WWW08 one more focuses on the properties shown by NCP and WWW10 one more focuses on different network detection algorithms.
Big Idea
The big idea of WWW08 is the utilization of NCP to show new network properties.
The big idea of the other one is discuss community detection algorithms based on whether they have the ability to preserve these network properties.
Questions
- How much time did you spend reading the (new, non-wikified) paper you summarized?
- 1.5 hour
- How much time did you spend reading the old wikified paper?
- 1.5 minutes
- How much time did you spend reading the summary of the old paper?
- 15 minutes
- How much time did you spend reading background material?
- 30 minutes
- Was there a study plan for the old paper?
- Yes
- If so, did you read any of the items suggested by the study plan? and how much time did you spend with reading them?
- 30 minutes. But as I read the non-wikified paper first and I actually already read most of items suggested by the study plan during reading the new paper before reading the wikified paper as they are quite related.
