Today,liver disease,or any deterioration in one’s ability to survive,is extremely common all around the world.Previous research has indicated that liver disease is more frequent in younger people than in older ones.W...Today,liver disease,or any deterioration in one’s ability to survive,is extremely common all around the world.Previous research has indicated that liver disease is more frequent in younger people than in older ones.When the liver’s capability begins to deteriorate,life can be shortened to one or two days,and early prediction of such diseases is difficult.Using several machine learning(ML)approaches,researchers analyzed a variety of models for predicting liver disorders in their early stages.As a result,this research looks at using the Random Forest(RF)classifier to diagnose the liver disease early on.The dataset was picked from the University of California,Irvine repository.RF’s accomplishments are contrasted to those of Multi-Layer Perceptron(MLP),Average One Dependency Estimator(A1DE),Support Vector Machine(SVM),Credal Decision Tree(CDT),Composite Hypercube on Iterated Random Projection(CHIRP),K-nearest neighbor(KNN),Naïve Bayes(NB),J48-Decision Tree(J48),and Forest by Penalizing Attributes(Forest-PA).Some of the assessment measures used to evaluate each classifier include Root Relative Squared Error(RRSE),Root Mean Squared Error(RMSE),accuracy,recall,precision,specificity,Matthew’s Correlation Coefficient(MCC),F-measure,and G-measure.RF has an RRSE performance of 87.6766 and an RMSE performance of 0.4328,however,its percentage accuracy is 72.1739.The widely acknowledged result of this work can be used as a starting point for subsequent research.As a result,every claim that a new model,framework,or method enhances forecastingmay be benchmarked and demonstrated.展开更多
Automation software need to be continuously updated by addressing software bugs contained in their repositories.However,bugs have different levels of importance;hence,it is essential to prioritize bug reports based on...Automation software need to be continuously updated by addressing software bugs contained in their repositories.However,bugs have different levels of importance;hence,it is essential to prioritize bug reports based on their sever-ity and importance.Manually managing the deluge of incoming bug reports faces time and resource constraints from the development team and delays the resolu-tion of critical bugs.Therefore,bug report prioritization is vital.This study pro-poses a new model for bug prioritization based on average one dependence estimator;it prioritizes bug reports based on severity,which is determined by the number of attributes.The more the number of attributes,the more the severity.The proposed model is evaluated using precision,recall,F1-Score,accuracy,G-Measure,and Matthew’s correlation coefficient.Results of the proposed model are compared with those of the support vector machine(SVM)and Naive Bayes(NB)models.Eclipse and Mozilla datasetswere used as the sources of bug reports.The proposed model improved the bug repository management and out-performed the SVM and NB models.Additionally,the proposed model used a weaker attribute independence supposition than the former models,thereby improving prediction accuracy with minimal computational cost.展开更多
Various binary similarity measures have been employed in clustering approaches to make homogeneous groups of similar entities in the data. These similarity measures are mostly based only on the presence or absence of ...Various binary similarity measures have been employed in clustering approaches to make homogeneous groups of similar entities in the data. These similarity measures are mostly based only on the presence or absence of features. Binary similarity measures have also been explored with different clustering approaches （e.g., agglomera- tive hierarchical clustering） for software modularization to make software systems understandable and manageable. Each similarity measure has its own strengths and weaknesses which improve and deteriorate the clustering results, respectively. We highlight the strengths of some well-known existing binary similarity measures for software mod- ularization. Furthermore, based on these existing similarity measures, we introduce several improved new binary similarity measures. Proofs of the correctness with illustration and a series of experiments are presented to evaluate the effectiveness of our new binary similarity measures.展开更多
基金the support of the Deputy for Research and Innovation-Ministry of Education,Kingdom of Saudi Arabia for this research at Najran University,Kingdom of Saudi Arabiathe support of the Deputy for Research and Innovation-Ministry of Education,Kingdom of Saudi Arabia for this research through a grant(NU/IFC/ENT/01/014)under the institutional Funding Committee at Najran University,Kingdom of Saudi Arabia.
文摘Today,liver disease,or any deterioration in one’s ability to survive,is extremely common all around the world.Previous research has indicated that liver disease is more frequent in younger people than in older ones.When the liver’s capability begins to deteriorate,life can be shortened to one or two days,and early prediction of such diseases is difficult.Using several machine learning(ML)approaches,researchers analyzed a variety of models for predicting liver disorders in their early stages.As a result,this research looks at using the Random Forest(RF)classifier to diagnose the liver disease early on.The dataset was picked from the University of California,Irvine repository.RF’s accomplishments are contrasted to those of Multi-Layer Perceptron(MLP),Average One Dependency Estimator(A1DE),Support Vector Machine(SVM),Credal Decision Tree(CDT),Composite Hypercube on Iterated Random Projection(CHIRP),K-nearest neighbor(KNN),Naïve Bayes(NB),J48-Decision Tree(J48),and Forest by Penalizing Attributes(Forest-PA).Some of the assessment measures used to evaluate each classifier include Root Relative Squared Error(RRSE),Root Mean Squared Error(RMSE),accuracy,recall,precision,specificity,Matthew’s Correlation Coefficient(MCC),F-measure,and G-measure.RF has an RRSE performance of 87.6766 and an RMSE performance of 0.4328,however,its percentage accuracy is 72.1739.The widely acknowledged result of this work can be used as a starting point for subsequent research.As a result,every claim that a new model,framework,or method enhances forecastingmay be benchmarked and demonstrated.
基金This work was supported in part by the National Research Foundation of Korea(NRF)grant funded by the Korea government(MSIT)(No.NRF-2020R1A2C1013308).
文摘Automation software need to be continuously updated by addressing software bugs contained in their repositories.However,bugs have different levels of importance;hence,it is essential to prioritize bug reports based on their sever-ity and importance.Manually managing the deluge of incoming bug reports faces time and resource constraints from the development team and delays the resolu-tion of critical bugs.Therefore,bug report prioritization is vital.This study pro-poses a new model for bug prioritization based on average one dependence estimator;it prioritizes bug reports based on severity,which is determined by the number of attributes.The more the number of attributes,the more the severity.The proposed model is evaluated using precision,recall,F1-Score,accuracy,G-Measure,and Matthew’s correlation coefficient.Results of the proposed model are compared with those of the support vector machine(SVM)and Naive Bayes(NB)models.Eclipse and Mozilla datasetswere used as the sources of bug reports.The proposed model improved the bug repository management and out-performed the SVM and NB models.Additionally,the proposed model used a weaker attribute independence supposition than the former models,thereby improving prediction accuracy with minimal computational cost.
基金supported by the Office of Research,Innovation,Commercialization and Consultancy(ORICC)Universiti Tun Hussein Onn Malaysia(UTHM),Malaysia(No.U063)
文摘Various binary similarity measures have been employed in clustering approaches to make homogeneous groups of similar entities in the data. These similarity measures are mostly based only on the presence or absence of features. Binary similarity measures have also been explored with different clustering approaches （e.g., agglomera- tive hierarchical clustering） for software modularization to make software systems understandable and manageable. Each similarity measure has its own strengths and weaknesses which improve and deteriorate the clustering results, respectively. We highlight the strengths of some well-known existing binary similarity measures for software mod- ularization. Furthermore, based on these existing similarity measures, we introduce several improved new binary similarity measures. Proofs of the correctness with illustration and a series of experiments are presented to evaluate the effectiveness of our new binary similarity measures.
