Yousef Elsheikh

Dr. Yousef Elsheikh

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 October 2022 in Information and Software Technology
Verified
Journal Article
Closed access
SHShaima Hameed
Shaima Hameed
YEYousef Elsheikh
Yousef Elsheikh
MAMohammad Azzeh
Mohammad Azzeh

28 April 2022 in Science of Computer Programming
Verified
Journal Article
Closed access
Mohammad AzzehMohammad Azzeh
Mohammad Azzeh
ANAli Bou Nassif
Ali Bou Nassif
YEYousef Elsheikh
Yousef Elsheikh
LALefteris Angelis
Lefteris Angelis

11 March 2017 in arXiv
Verified
Preprint
Open access
PDF file
MAMohammad Azzeh
Mohammad Azzeh
YEYousef Elsheikh
Yousef Elsheikh
MAMarwan Alseid
Marwan Alseid
Despite the predictive performance of Analogy-Based Estimation (ABE) in generating better effort estimates, there is no consensus on how to predict the best number of analogies, and which adjustment technique produces better estimates. This paper proposes a new adjusted ABE model based on optimizing and approximating complex relationships between features and reflects that approximation on the final estimate. The results show that the predictive performance of ABE has noticeably been improved, and the number of analogies was remarkably variable for each test project.

25 November 2024 in Soft Computing
Verified
Journal Article
Closed access
PDF file
Mohammad AzzehMohammad Azzeh
Mohammad Azzeh
YEYousef Elsheikh
Yousef Elsheikh
YAYousef Alqasrawi
Yousef Alqasrawi

11 March 2017 in arXiv
Verified
Preprint
Open access
PDF file
MAMohammad Azzeh
Mohammad Azzeh
YEYousef Elsheikh
Yousef Elsheikh
Case-Based Reasoning (CBR) has been widely used to generate good software effort estimates. The predictive performance of CBR is a dataset dependent and subject to extremely large space of configuration possibilities. Regardless of the type of adaptation technique, deciding on the optimal number of similar cases to be used before applying CBR is a key challenge. In this paper we propose a new technique based on Bisecting k-medoids clustering algorithm to better understanding the structure of a dataset and discovering the the optimal cases for each individual project by excluding irrelevant cases. Results obtained showed that understanding of the data characteristic prior prediction stage can help in automatically finding the best number of cases for each test project. Performance figures of the proposed estimation method are better than those of other regular K-based CBR methods.