Mining Collaboration Patterns from a Large Developer Network

Didi Surian, David Lo, Ee-Peng Lim

Abstract

In this study, we extract patterns from a large developer collaborations network extracted from Source Forge. Net at high and low level of details. At the high level of details, we extract various network-level statistics from the network. At the low level of details, we extract topological sub-graph patterns that are frequently seen among collaborating developers. Extracting sub graph patterns from large graphs is a hard NP-complete problem. To address this challenge, we employ a novel combination of graph mining and graph matching by leveraging network-level properties of a developer network. With the approach, we successfully analyze a snapshot of Source Forge. Net data taken on September 2009. We present mined patterns and describe interesting observations.
BibTeX
@inproceedings{surian2010mining,
  author = {Didi Surian and David Lo and Ee-Peng Lim},
  title = {{Mining Collaboration Patterns from a Large Developer Network}},
  booktitle = {WCRE},
  year = {2010},
  doi = {10.1109/wcre.2010.38},
}

Loading related content...

Figure