Article Per Year (5 Year)
p-Index From 2020 - 2025
0.92
P-Index
This Author published in this journals
All Journal IAES International Journal of Artificial Intelligence (IJ-AI) Bulletin of Electrical Engineering and Informatics
Admassu Assegie, Tsehay
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering Engineering

Published : 5 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 5 Documents
Search

 1 
Early prediction of chronic heart disease with recursive feature elimination and supervised learning techniques Kumar Napa, Komal; Kalyan Kumar, Angati; Murugan, Sangeetha; Mahammad, Kamaluru; Admassu Assegie, Tsehay
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 13, No 1: March 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v13.i1.pp730-736

Abstract

Chronic heart disease (CHD) is a common complication among patients suffering in the cardiological intensive care unit, often resulting in poor prognosis and high mortality. Early prediction of CHD can reduce mortality by preventing the severity of the disease. This study evaluated the efficacy of on recursive feature elimination for predicting CHD using supervised learning techniques for predicting CHD. The study employed 1190 Cleveland Hungarian CHD dataset. Different supervised learning techniques (support vector machine, decision tree, k-nearest neighbor, Naive Bayes, stochastic gradient descent, adaptive boosting, and multilayer perceptron) were used to study the efficacy of the recursive feature elimination. Chest pain type, sex, blood sugar level, angina, depression, and slope were associated with CHD occurrence. The accuracy of the K-nearest neighbor and decision tree model was 89.91% for the feature-selected dataset indicating good predictive ability. Ultimately, the support vector machine and logistic regression with the selected features exhibited good discriminatory ability for early prediction of CHD. Thus, the recursive feature elimination is a good approach to develop a a model with higher accuracy to predict CHD.
Scalability and performance of decision tree for cardiovascular disease prediction Admassu Assegie, Tsehay; Kumar Napa, Komal; Thulasi, Thiyagu; Kalyan Kumar, Angati; Thiruvarasu Vasantha Priya, Maran Jeyanthiran; Dhamodaran, Vigneswari
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 13, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v13.i3.pp2540-2545

Abstract

As one of the most common types of disease, cardiovascular disease is a serious health concern worldwide. Early detection is crucial for successful treatment and improved survival rates. The decision tree is a robust classifier for predicting the risk of cardiovascular disease and getting insights that would assist in making clinical decisions. However, selecting a better model for cardiovascular disease could be challenging due to scalability issues. Hence, this study examines the scalability and performance of decision trees for cardiovascular disease prediction. The study evaluated the performance of a decision tree for predicting cardiovascular disease. The performance evaluation was carried out by employing a confusion matrix, cross-validation score, model complexity, and training score for varying sizes of training samples. The experiment depicted that, the decision tree model was 88.8% accurate in predicting the presence or absence of cardiovascular disease. Therefore, the implementation of the decision tree is beneficial for the prediction and early detection of heart disease events in patients.
Evaluation of sequential feature selection in improving the K-nearest neighbor classifier for diabetes prediction Govindarajan, Rajkumar; Balaji, Vidhyashree; Arumugam, Jayanthi; Admassu Assegie, Tsehay; Mothukuri, Radha
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 13, No 2: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v13.i2.pp1567-1573

Abstract

The K-nearest neighbor (KNN) classifier employs distance metrics to measure the distance between the test instance and the samples used in training. With smaller samples, the KNN classifier achieves higher accuracy with low computational time. However, computing the distance between the test instance and all training samples to determine the class of the test instance requires higher computational time for a high-dimensional dataset. This research employs sequential feature selection (SFS) to select the optimal feature for diabetes prediction while reducing the computational time complexity of the KNN classifier. The KNN classifier showed effectiveness with an accuracy rate of 84.41% with nine features. The performance of the KNN improves by 2.6% when trained on the optimal features selected with the SFS. The result revealed glucose level, blood pressure (BP), skin thickness (ST), diabetes pedigree function (DPF), age, and body mass index (BMI) as the most representative features in diabetes prediction. The KNN classifier gives higher accuracy with these features. However, insulin and the number of times a woman is pregnant do not show a significant effect on the KNN classifier.
Cluster-based routing protocols through optimal cluster head selection for mobile ad hoc network Alayu Melkamu, Yenework; Purushothaman, Raguraman; Sujatha, Madugula; Kumar Napa, Komal; Zeleke Mekonen, Mareye; Admassu Assegie, Tsehay; Olalekan Salau, Ayodeji
Bulletin of Electrical Engineering and Informatics Vol 14, No 1: February 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i1.8863

Abstract

Mobile ad hoc networks (MANETs) operate without fixed infrastructure, with mobile nodes acting as both hosts and routers. These networks face challenges due to node mobility and limited resources, causing frequent changes in topology and instability. Clustering is essential to manage this issue. Significant research has been devoted to optimal clustering algorithms to improve cluster-based routing protocols (CBRP), such as the weighted clustering algorithm (WCA), optimal stable clustering algorithm (OSCA), lowest ID (LID) clustering algorithm, and highest connectivity clustering (HCC) algorithm. However, these protocols suffer from high re-clustering frequency and do not adequately account for energy efficiency, leading to network instability and reduced longevity. This work aims to improve the CBRP to create a more stable and long-lasting network. During cluster head (CH) selection, nodes with high residual energy or degree centrality are chosen as CH and backup cluster head (BCH). This approach eliminates the need for re-clustering, as the BCH can seamlessly replace a failing CH, ensuring continuous cluster maintenance. The proposed modified cluster-based routing protocol (MCBRP) evaluated network simulator 2 (ns2) demonstrates that MCBRP is more energy-efficient, selecting optimal CH and balancing the load to enhance network stability and longevity.
An enhanced key schedule mechanism to improve the security strength of the data encryption standard algorithm Zeleke Mekonen, Mareye; Kumar Napa, Komal; Andulalem Ayalew, Amogne; Manivannan, Bommy; Suresh, Tamilarasi; Senthil Murugan, Janakiraman; Admassu Assegie, Tsehay
Bulletin of Electrical Engineering and Informatics Vol 14, No 4: August 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i4.9712

Abstract

The rapid growth of internet accessibility requires strong data security measures, mainly for safeguarding sensitive information. Since many threats and attacks steal our private data. Data encryption standard (DES) is one of the cryptographic methods that uses a symmetric key encryption method to resist various types of cryptographic attacks. This work proposes an improved key scheduling algorithm (KSA) to enhance DES security. The modified KSA is evaluated using criteria such as frequency test, hamming weight, and bit difference to measure round key randomness and resilience. Moreover, the avalanche effect is evaluated to assess the diffusion and confusion character of the generated ciphertext. The final result indicates that the enhanced KSA attains better frequency distribution (0.89-1.0), increased hamming weight consistency (97.13%), and high bit transition rates compared to the original DES KSA. These enhancements demonstrate increased randomness and complexity, making the algorithm more resistant to brute-force and other cryptographic attacks. Our proposed work shows enhanced security capabilities, albeit with increased computational requirements, and establishes a foundation for future improvement in symmetric key cryptography.
Co-Authors Alayu Melkamu, Yenework Andulalem Ayalew, Amogne Arumugam, Jayanthi Balaji, Vidhyashree Dhamodaran, Vigneswari Govindarajan, Rajkumar Kalyan Kumar, Angati Kumar Napa, Komal Mahammad, Kamaluru Manivannan, Bommy Mothukuri, Radha Murugan, Sangeetha Olalekan Salau, Ayodeji Purushothaman, Raguraman Senthil Murugan, Janakiraman Sujatha, Madugula Suresh, Tamilarasi Thiruvarasu Vasantha Priya, Maran Jeyanthiran Thulasi, Thiyagu Zeleke Mekonen, Mareye