Title | ||
---|---|---|
Discovering the Structures of Open Source Programs from Their Developer Mailing Lists |
Abstract | ||
---|---|---|
This paper presents a method which discovers the structure of given open source programs from their developer mailing lists. Our goal is to help successive developers understand the structures and the components of open source programs even if documents about them are not provided sufficiently. Our method consists of two phases: (1) producing a mapping between the source files and the emails, and (2) constructing a lattice from the produced mapping and then reducing it with a novel algorithm, called PRUNIA (PRUN ing Algorithm Based on I ntroduced A ttributes), in order to obtain a more compact structure. We performed experiments with some open source projects which are originally from or popular in Japan such as Namazu and Ruby. The experimental results reveal that the extracted structures reflect very well important parts of the hidden structures of the programs. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1007/978-3-642-04747-3_19 | Discovery Science |
Keywords | Field | DocType |
developer mailing lists,compact structure,open source project,hidden structure,source file,novel algorithm,developer mailing list,open source programs,prun ing algorithm,important part,open source program | Data mining,Computer science,Database | Conference |
Volume | ISSN | Citations |
5808 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dinh Anh Nguyen | 1 | 0 | 0.34 |
Koichiro Doi | 2 | 31 | 7.59 |
Akihiro Yamamoto | 3 | 135 | 26.84 |