Search Results - (( java implementation path algorithm ) OR ( using continuous ant algorithm ))

Incremental continuous ant colony optimization for tuning support vector machine’s parameters by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous in nature, the values wil have to be discretized.The discretization process will result in loss of some information and, hence, affects the classification accuracy and seeks time.This paper presents an algorithm to optimize Support Vector Machine parameters using Incremental continuous Ant Colony Optimization without the need to discretize continuous values.Eight datasets from UCI were used to evaluate the performance of the proposed algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.Experimental results of the proposed algorithm also show promising performance in terms of classification accuracy and size of features subset.…”
Get full text
Get full text
Get full text

Optimizing support vector machine parameters using continuous ant colony optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous parameters, there is a need to discretize the continuous value into a discrete value.This discretization process results in loss of some information and, hence, affects the classification accuracy and seek time.This study proposes an algorithm to optimize Support Vector Machine parameters using continuous Ant Colony Optimization without the need to discretize continuous values for Support Vector Machine parameters.Seven datasets from UCI were used to evaluate the performance of the proposed hybrid algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques.Experimental results of the proposed algorithm also show promising performance in terms of computational speed.…”
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

AntNet: a robust routing algorithm for data networks by Haseeb, Shariq, Sidek, Khairul Azami, Ismail, Ahmad Faris, Weng Kin, Lai, Yit Mei, Aw

“…AntNet is an innovative algorithm that may be used for data networks. …”
Get full text
Get full text
Get full text

Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

“…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
Get full text
Get full text
Get full text

Predicting autistic spectrum disorder for toddler using ant colony optimization / Nur Ibtisyam Zafri by Zafri, Nur Ibtisyam

“…The Ant-Miner algorithm was used to predict the ASD and was compared with the J48 algorithm. …”
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

Incremental continuous ant colony optimization technique for support vector machine model selection problem by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This study proposes an algorithm that can optimize Support Vector Machine parameters using Incremental Continuous Ant Colony Optimization without the need to discretize continuous value for support vector machine parameters.Seven datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithmin terms of classification accuracy.Promising results were obtained when compared to grid search technique.…”
Get full text
Get full text

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Performance analysis of ant colony's algorithm: load-balancing in QoS-based wireless mesh networks routing by Moghanjoughi, Ayyoub Akbari, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir

“…The main point considered in this proposed method is capability of breeding of ants. This capability is continuation of route that is produced by the parent ants. …”
Get full text
Get full text
Get full text

Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

“…OMNeT++ was used to simulate the IARNA algorithm for WMNs and MANET. …”
Get full text
Get full text

A new ant based rule extraction algorithm for web classification by Ku-Mahamud, Ku Ruhana, Saian, Rizauddin

“…Using Classifier-based attribute subset selection will reduce more attributes, but sacrifice the performance of the classifier.A hybrid ant colony optimization with simulated annealing algorithm to discover rules from data is proposed.The simulated annealing technique will minimize the problem of low quality discovered rule by an ant in a colony.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The rule set is arranged in decreasing order of generation.Thirteen data sets which consist of discrete and continuous data were used to evaluate the performance of the proposed algorithm in terms of accuracy, number of rules and number of terms in the rules.Experimental results obtained from the proposed algorithm are comparable to the results of the Ant-Miner algorithm in terms of rule accuracy but are better in terms of rule simplicity.…”
Get full text
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

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
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

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

The study of ant colony optimization (ACO) parameters for STATCOM optimization / Melor Md Hodari by Md Hodari, Melor

“…The proposed technique was tested using the standard IEEE 30-bus system and the capability of developed ACO in solving continuous optimization problems has been revealed as the added value in the algorithm.…”
Get full text
Get full text

The study of ant colony optimization (ACO) parameters for STATCOM optimization: article / Melor Md Hodari by Md Hodari, Melor

“…The proposed technique was tested using the standard IEEE 30-bus system and the capability of developed ACO in solving continuous optimization problems has been revealed as the added value in the algorithm.…”
Get full text
Get full text

Suitability Factor on the Capacitated Vehicle Routing Problem by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

“…One of the most popular solutions is using Ant Colony System (ACS) algorithm. Several versions of ACOs have been proposed which aim to achieve an optimum solution. …”
Get full text
Get full text