Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/20983
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZighed, Narimane-
dc.contributor.authorBounour, Nora-
dc.date.accessioned2019-06-30T08:28:38Z-
dc.date.available2019-06-30T08:28:38Z-
dc.date.issued2019-03-05-
dc.identifier.urihttp://dspace.univ-ouargla.dz/jspui/handle/123456789/20983-
dc.descriptionLe 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019en_US
dc.description.abstractThis paper presents an ongoing work on using KStar algorithm to predict Object-Oriented software maintainability. The maintainability is measured as the number of changes made to code throughout the maintenance period by using Object-Oriented software metrics. We build a prediction model based on data collected from two different Object-Oriented systems. However, to figure out the advantages of KStar algorithm we made five experiments with the Weka machine learning workbench and to compare our proposed model with the other algorithms which are (linear Regression, Neural Network, Decision Tree, SVM), the prediction accuracy of all models is evaluated and compared using cross-validation and different types of accuracy measures. As a result, KStar yields better results and it demonstrated to be the best of them to predict more accurately than the other typical techniques.en_US
dc.language.isoenen_US
dc.publisherUniversité Kasdi Merbah Ouarglaen_US
dc.relation.ispartofseries2019;-
dc.subjectMachine Learning Techniquesen_US
dc.subjectKStaren_US
dc.subjectSoftware Maintainabilityen_US
dc.subjectObject-Oriented Metricsen_US
dc.titleOn The Use Of KStar Algorithm For Predicting Object-Oriented Software Maintainabilityen_US
dc.typeArticleen_US
Appears in Collections:2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:
File Description SizeFormat 
Zighed Narimane.pdf599,93 kBAdobe PDFView/Open


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