Search Results - (( variable optimization svm algorithm ) OR ( simulation optimization sensor algorithm ))

Hybrid ACO and SVM algorithm for pattern classification by Alwan, Hiba Basim

“…The first two algorithms, ACOR-SVM and IACOR-SVM, tune the SVM parameters while the second two algorithms, ACOMV-R-SVM and IACOMV-R-SVM, tune the SVM parameters and select the feature subset simultaneously. …”
Get full text
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
Get full text
Get full text
Get full text

Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text

Mixed variable ant colony optimization technique for feature subset selection and model selection by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents the integration of Mixed Variable Ant Colony Optimization and Support Vector Machine (SVM) to enhance the performance of SVM through simultaneously tuning its parameters and selecting a small number of features.The process of selecting a suitable feature subset and optimizing SVM parameters must occur simultaneously,because these processes affect each ot her which in turn will affect the SVM performance.Thus producing unacceptable classification accuracy.Five datasets from UCI were used to evaluate the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with the small size of features subset.…”
Get full text
Get full text
Get full text

Solving SVM model selection problem using ACOR and IACOR by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…In applying ACO for optimizing SVM parameters which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretize process would result in loss of some information and hence affect the classification accuracy.In order to enhance SVM performance and solving the discretization problem, this study proposes two algorithms to optimize SVM parameters using Continuous ACO (ACOR) and Incremental Continuous Ant Colony Optimization (IACOR) without the need to discretize continuous value for SVM parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed integrated algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM. …”
Get full text
Get full text
Get full text

Intelligent classification algorithms in enhancing the performance of support vector machine by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two intelligent algorithms that hybridized between ant colony optimization (ACO) and SVM for tuning SVM parameters and selecting feature subset without having to discretize the continuous values. …”
Get full text
Get full text
Get full text

Integrated ACOR/IACOMV-R-SVM Algorithm by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…The first algorithm, ACOR-SVM, will tune SVM parameters, while the second IACOMV-R-SVM algorithm will simultaneously tune SVM parameters and select the feature subset. …”
Get full text
Get full text
Get full text

Simulated Kalman Filter optimization algorithm for maximization of wireless sensor networks coverage by Nor Azlina, Ab. Aziz, Zuwairie, Ibrahim, Kamarulzaman, Ab Aziz, Nor Hidayati, Abdul Aziz

“…Simulated Kalman Filter (SKF) is a population based optimization algorithm inspired by the Kalman filtering method. …”
Get full text
Get full text
Get full text

IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks by Gumaida, Bassam, Ibrahim, Adamu Abubakar

“…Additionally, simulation results confirm that the proposed algorithm IWDSA exhibits outstanding performance compared to other algorithms utilizing optimization techniques, including genetic algorithms, bat algorithms, ant colony optimization, and swarm optimization. …”
Get full text
Get full text
Get full text

Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Ant Colony Optimization has been used to solve Support Vector Machine model selection problem.Ant Colony Optimization originally deals with discrete optimization problem.In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time.This study proposes an algorithm that can optimize Support Vector Machine parameters using Continuous Ant Colony Optimization without the need to discretize continuous value for Support Vector Machine parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.…”
Get full text
Get full text
Get full text

Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

“…The simulated robot is equipped with a sonar sensor and several infrared sensors on its chassis. …”
Get full text
Get full text
Get full text

Hybridization of enhanced ant colony system and Tabu search algorithm for packet routing in wireless sensor network by Husna, Jamal Abdul Nasir

“…Better performances were also achieved for success rate, throughput, and latency when compared to other hybrid routing algorithms such as Fish Swarm Ant Colony Optimization (FSACO), Cuckoo Search-based Clustering Algorithm (ICSCA), and BeeSensor-C. …”
Get full text
Get full text
Get full text
Get full text

Deterministic static sensor node placement in wireless sensor network based on territorial predator scent marking behavior by Abidin H.Z., Din N.M., Radzi N.A.M.

“…This paper proposes a sensor node placement algorithm that utilizes a new biologically inspired optimization algorithm that imitates the behaviour of territorial predators in marking their territories with their odours known as Territorial Predator Scent Marking Algorithm (TPSMA). …”

Provisioning an energy efficient with maximum coverage WSN through biological inspired sensor node placement by Abidin H.Z., Din N.M.

Cluster head selection optimization in wireless sensor network via genetic-based evolutionary algorithm by Vincent Chung, Hamzarul Alif Hamzah, Norah Tuah, Kit, Guan Lim, Min, Keng Tan, Kenneth Tze Kin Teo

“…Genetic-based evolutionary algorithms such as Genetic Algorithm (GA) and Differential Evolution (DE) have been popularly used to optimize cluster head selection in WSN to improve energy efficiency for the extension of network lifetime. …”
Get full text
Get full text
Get full text
Get full text

Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

“…This study proposed Extended Virtual Force and Cuckoo Search (EVFCS) algorithm with a combination of EVFA and CS algorithm to find an optimal node placement. …”
Get full text
Get full text
Get full text

Multi-objective biological mimicry optimization algorithm for WSN sensor node placement by Abidin H.Z., Din N.M., Radzi N.A.M.

Chaotic Mapping Lion Optimization Algorithm-Based Node Localization Approach for Wireless Sensor Networks by Motwakel, Abdelwahed, Hassan Abdalla Hashim, Aisha, Alamro, Hayam, Alqahtani, Hamed, Alotaibi, Faiz Abdullah, Sayed, Ahmed

“…Keywords: anchor nodes; metaheuristic optimization algorithm; node localization; tent chaotic mapping; wireless sensor networks…”
Get full text
Get full text
Get full text
Get full text

Wireless sensor network deployment performance based on FOA, PSO and TPSMA / Nurhidayah Kamal Akbar, Husna Zainol Abidin, and Ahmad Ihsan Mohd Yassin by Kamal Akbar, Nurhidayah, Zainol Abidin, Husna, Mohd Yassin, Ahmad Ihsan

“…This paper compares the random deployment with other two algorithms known as Fruit Fly Optimization (FOA) and Particles Swarm Optimization (PSO) Territorial Predator Scent Marking Algorithm (TPSMA) to solve the coverage hole problem. …”
Get full text
Get full text
Get full text

An energy-efficient spectrum-aware reinforcement learning-based clustering algorithm for cognitive radio sensor networks by Mustapha, Ibrahim, Mohd Ali, Borhanuddin, A. Rasid, Mohd Fadlee, Sali, Aduwati, Mohamad, Hafizal

“…We first model the network energy consumption and then determine the optimal number of clusters for the network. The problem of selecting an optimal cluster is formulated as a Markov Decision Process (MDP) in the algorithm and the obtained simulation results show convergence, learning and adaptability of the algorithm to dynamic environment towards achieving an optimal solution. …”
Get full text
Get full text
Get full text