Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/15614
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAGRAWAL, ANUSHREE-
dc.date.accessioned2017-02-17T06:29:42Z-
dc.date.available2017-02-17T06:29:42Z-
dc.date.issued2014-07-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/15614-
dc.description.abstractSoftware defect prediction is the process of identification of defects early in the life cycle so as to optimize the testing resources and reduce maintenance efforts. Defect prediction works well if sufficient amount of data is available to train the prediction model. However, not always this is the case. For example, when the software is the first release or the company has not maintained significant data. In such cases, cross project defect prediction may identify the defective classes. In this work, we have studied the feasibility of cross project defect prediction and empirically validated the same. We conducted our experiments on 12 open source datasets. The prediction model is built using 12 software metrics. After studying the various train test combinations, we found that cross project defect prediction was feasible in 35 out of 132 cases. The success of prediction is determined via precision, recall and AUC of the prediction model. We have also analysed 14 descriptive characteristics to construct the decision tree. The decision tree learnt from this data has 15 rules which describe the feasibility of successful cross project defect prediction.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD NO.1411;-
dc.subjectDEFECT PREDICTIONen_US
dc.subjectOPEN SOURCE SOFTWAREen_US
dc.subjectPREDICTION MODELen_US
dc.subjectFEASIBILITYen_US
dc.titleCROSS PROJECT DEFECT PREDICTION FOR OPEN SOURCE SOFTWAREen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Computer Engineering

Files in This Item:
File Description SizeFormat 
ANUSHREE_2K12-SWE-09.pdf1.44 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.