Article Per Year (5 Year)
p-Index From 2020 - 2025
0.562
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Indonesian Journal of Electrical Engineering and Computer Science
Rafid Sagban
University of Babylon
Computer Science & IT Electrical & Electronics Engineering

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

Found 4 Documents
Search

 1 
Hybrid bat-ant colony optimization algorithm for rule-based feature selection in health care Rafid Sagban; Haydar A. Marhoon; Raaid Alubady
International Journal of Electrical and Computer Engineering (IJECE) Vol 10, No 6: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v10i6.pp6655-6663

Abstract

Rule-based classification in the field of health care using artificial intelligence provides solutions in decision-making problems involving different domains. An important challenge is providing access to good and fast health facilities. Cervical cancer is one of the most frequent causes of death in females. The diagnostic methods for cervical cancer used in health centers are costly and time-consuming. In this paper, bat algorithm for feature selection and ant colony optimization-based classification algorithm were applied on cervical cancer data set obtained from the repository of the University of California, Irvine to analyze the disease based on optimal features. The proposed algorithm outperforms other methods in terms of comprehensibility and obtains better results in terms of classification accuracy.
Adaptive Parameter Control Strategy for Ant-Miner Classification Algorithm Hayder Naser Khraibet Al-Behadili; Rafid Sagban; Ku Ruhana Ku-Mahamud
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 8, No 1: March 2020
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (908.687 KB) | DOI: 10.52549/ijeei.v8i1.1423

Abstract

Pruning is the popular framework for preventing the dilemma of overfitting noisy data. This paper presents a new hybrid Ant-Miner classification algorithm and ant colony system (ACS), called ACS-AntMiner. A key aspect of this algorithm is the selection of an appropriate number of terms to be included in the classification rule. ACS-AntMiner introduces a new parameter called importance rate (IR) which is a pre-pruning criterion based on the probability (heuristic and pheromone) amount. This criterion is responsible for adding only the important terms to each rule, thus discarding noisy data. The ACS algorithm is designed to optimize the IR parameter during the learning process of the Ant-Miner algorithm. The performance of the proposed classifier is compared with related ant-mining classifiers, namely, Ant-Miner, CAnt-Miner, TACO-Miner, and Ant-Miner with a hybrid pruner across several datasets. Experimental results show that the proposed classifier significantly outperforms the other ant-mining classifiers.
Annealing strategy for an enhance rule pruning technique in ACO-Based rule classification Hayder Naser Khraibet AL-Behadili; Ku Ruhana Ku-Mahamud; Rafid Sagban
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 3: December 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i3.pp1499-1507

Abstract

Ant colony optimization (ACO) was successfully applied to data mining classification task through ant-mining algorithms. Exploration and exploitation are search strategies that guide the learning process of a classification model and generate a list of rules. Exploitation refers to the process of intensifying the search for neighbors in good regions, whereas exploration aims towards new promising regions during a search process. The existing balance between exploration and exploitation in the rule construction procedure is limited to the roulette wheel selection mechanism, which complicates rule generation. Thus, low-coverage complex rules with irrelevant terms will be generated. This work proposes an enhancement rule pruning procedure for the ACO algorithm that can be used in rule-based classification. This procedure, called the annealing strategy, is an improvement of ant-mining algorithms in the rule construction procedure. Presented as a pre-pruning technique, the annealing strategy deals first with irrelevant terms before creating a complete rule through an annealing schedule. The proposed improvement was tested through benchmarking experiments, and results were compared with those of four of the most related ant-mining algorithms, namely, Ant-Miner, CAnt-Miner, TACO-Miner, and Ant-Miner with hybrid pruner. Results display that our proposed technique achieves better performance in terms of classification accuracy, model size, and computational time. The proposed annealing schedule can be used in other ACO variants for different applications to improve classification accuracy.
An improved ACS algorithm for data clustering Ayad Mohammed Jabbar; Ku Ruhana Ku-Mahamud; Rafid Sagban
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 3: March 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i3.pp1506-1515

Abstract

Data clustering is a data mining technique that discovers hidden patterns by creating groups (clusters) of objects. Each object in every cluster exhibits sufficient similarity to its neighbourhood, whereas objects with insufficient similarity are found in other clusters. Data clustering techniques minimise intra-cluster similarity in each cluster and maximise inter-cluster dissimilarity amongst different clusters. Ant colony optimisation for clustering (ACOC) is a swarm algorithm inspired by the foraging behaviour of ants. This algorithm minimises deterministic imperfections in which clustering is considered an optimisation problem. However, ACOC suffers from high diversification in which the algorithm cannot search for best solutions in the local neighbourhood. To improve the ACOC, this study proposes a modified ACOC, called M-ACOC, which has a modification rate parameter that controls the convergence of the algorithm. Comparison of the performance of several common clustering algorithms using real-world datasets shows that the accuracy results of the proposed algorithm surpasses other algorithms. 
Co-Authors Ayad Mohammed Jabbar Haydar A. Marhoon Hayder Naser Khraibet AL-Behadili Ku Ruhana Ku-Mahamud Ku Ruhana Ku-Mahamud Raaid Alubady