Conference Proceeding Article
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
Databases and Information Systems | Numerical Analysis and Scientific Computing | Software Engineering
Data Management and Analytics; Software and Cyber-Physical Systems
WCRE 2010: 17th Working Conference on Reverse Engineering: 13-16 October 2010, Beverly, Massachusetts: Proceedings
City or Country
SURIAN, Didi; LO, David; and LIM, Ee Peng.
Mining Collaboration Patterns from a Large Developer Network. (2010). WCRE 2010: 17th Working Conference on Reverse Engineering: 13-16 October 2010, Beverly, Massachusetts: Proceedings. 269-273. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1339
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.