Nowadays, software development societies have given more precedence to Open Source Software (OSS). There is much research aimed at understanding the OSS society to sustain the OSS product. To lead an OSS project to a successful conclusion, researchers study how developers change source codes called patches in project repositories. In existing studies, we found an argument in the conventional patch acceptance detection procedure. It was so simplified that it omitted important cases from the analysis, and would lead researchers to wrong conclusions. In this research, we propose an algorithm to overcome the problem. To prove out our algorithm, we constructed a framework and conducted two case studies. As a result, we came to a new and interesting understanding of patch activities.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Passakorn PHANNACHITTA, Akinori IHARA, Pijak JIRAPIWONG, Masao OHIRA, Ken-ichi MATSUMOTO, "An Algorithm for Gradual Patch Acceptance Detection in Open Source Software Repository Mining" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 9, pp. 1478-1489, September 2012, doi: 10.1587/transfun.E95.A.1478.
Abstract: Nowadays, software development societies have given more precedence to Open Source Software (OSS). There is much research aimed at understanding the OSS society to sustain the OSS product. To lead an OSS project to a successful conclusion, researchers study how developers change source codes called patches in project repositories. In existing studies, we found an argument in the conventional patch acceptance detection procedure. It was so simplified that it omitted important cases from the analysis, and would lead researchers to wrong conclusions. In this research, we propose an algorithm to overcome the problem. To prove out our algorithm, we constructed a framework and conducted two case studies. As a result, we came to a new and interesting understanding of patch activities.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1478/_p
Copy
@ARTICLE{e95-a_9_1478,
author={Passakorn PHANNACHITTA, Akinori IHARA, Pijak JIRAPIWONG, Masao OHIRA, Ken-ichi MATSUMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Algorithm for Gradual Patch Acceptance Detection in Open Source Software Repository Mining},
year={2012},
volume={E95-A},
number={9},
pages={1478-1489},
abstract={Nowadays, software development societies have given more precedence to Open Source Software (OSS). There is much research aimed at understanding the OSS society to sustain the OSS product. To lead an OSS project to a successful conclusion, researchers study how developers change source codes called patches in project repositories. In existing studies, we found an argument in the conventional patch acceptance detection procedure. It was so simplified that it omitted important cases from the analysis, and would lead researchers to wrong conclusions. In this research, we propose an algorithm to overcome the problem. To prove out our algorithm, we constructed a framework and conducted two case studies. As a result, we came to a new and interesting understanding of patch activities.},
keywords={},
doi={10.1587/transfun.E95.A.1478},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - An Algorithm for Gradual Patch Acceptance Detection in Open Source Software Repository Mining
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1478
EP - 1489
AU - Passakorn PHANNACHITTA
AU - Akinori IHARA
AU - Pijak JIRAPIWONG
AU - Masao OHIRA
AU - Ken-ichi MATSUMOTO
PY - 2012
DO - 10.1587/transfun.E95.A.1478
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2012
AB - Nowadays, software development societies have given more precedence to Open Source Software (OSS). There is much research aimed at understanding the OSS society to sustain the OSS product. To lead an OSS project to a successful conclusion, researchers study how developers change source codes called patches in project repositories. In existing studies, we found an argument in the conventional patch acceptance detection procedure. It was so simplified that it omitted important cases from the analysis, and would lead researchers to wrong conclusions. In this research, we propose an algorithm to overcome the problem. To prove out our algorithm, we constructed a framework and conducted two case studies. As a result, we came to a new and interesting understanding of patch activities.
ER -