Search Results - (( selective implementation search algorithm ) OR ( java simulation optimization algorithm ))

Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text

An improved bees algorithm local search mechanism for numerical dataset by Al-Dawoodi, Aras Ghazi Mohammed

“…Furthermore, in this study the feature selection algorithm is implemented and tested using most popular dataset from Machine Learning Repository (UCI). …”
Get full text
Get full text
Get full text

Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique by Hardev Singh, Jitvinder Dev Singh

“…Overall, the developed algorithms have similar PSNR value and lower average search point compared to superior algorithms. …”
Get full text
Get full text
Get full text
Get full text

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

An empirical study of double-bridge search move on subset feature selection search of bees algorithm by Al-dawoodi, Aras Ghazi Mohammed, Mahmuddin, Massudi

“…The application of Bees Algorithm in wrapper feature selection (BAFS) has been implemented but yet too far from perfect and has few weaknesses. …”
Get full text
Get full text
Get full text

Optimization of attribute selection model using bio-inspired algorithms by Basir, Mohammad Aizat, Yusof, Yuhanis, Hussin, Mohamed Saifullah

“…Experimental results conducted on six (6) public real datasets reveal that the feature selection model with the implementation of bio-inspired search algorithm consistently performs good classification (i.e higher accuracy with fewer numbers of attributes) on the selected data set. …”
Get full text
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Sara, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

Harmony search for multi-depot vehicle routing problem by Misni, F., Lee, L. S.

“…We proposed an improved harmony search algorithm for solving this problem. Firstly, the Clarke & Wright saving algorithm is used for the initialisation of a solution vector in harmony search. …”
Get full text
Get full text

A hybrid particle swarm optimization approach and its application to solving portfolio selection problems by Shamshul Bahar, Yaakob, Prof. Madya, Watada, Junzo

Get full text

VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

“…Visualization techniques help in understanding the searching behaviour of Genetic Algorithm. lt also makes possible the user interactions during the searching process. …”
Get full text
Get full text

Enhancing Classification Algorithms with Metaheuristic Technique by Cokro, Nurwinto, Tri Basuki, Kurniawan, Misinem, ., Tata, Sutabri, Yesi Novaria, Kunang

“…In its operation, the metaheuristic algorithm optimizes the feature selection process,which will later be processed using the classification algorithm.Three (3) meta-heuristics were implemented, namely Genetic Algorithm, Particle Swarm Optimization, and Cuckoo Search Algorithm; the experiment was conducted, and the results were collected and analyzed. …”
Get full text
Get full text
Get full text

Ideal combination feature selection model for classification problem based on bio-inspired approach by Basir, Mohammad Aizat, Hussin, Mohamed Saifullah, Yusof, Yuhanis

“…The important step is to idealize the combined feature selection models by finding the best combination of search method and feature selection algorithms. …”
Get full text
Get full text

Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

“…This paper aims to compare the performance of two metaheuristic algorithms which are Jaya Algorithm (JA) and Cuckoo Search (CS) using some common benchmark functions. …”
Get full text
Get full text
Get full text
Get full text

Performance Analysis of Hexagon-Diamond Search Algorithm for Motion Estimation using MATLAB by Abdul Manap, Redzuan, Ranjit, S.S.S.

“…In recent years, many of these BMAs have been developed with similar intention of reducing the computational costs while at the same time maintaining the video signal quality. In this paper, an algorithm called Hexagon-Diamond Search (HDS) is proposed for ME where the algorithm and several fast BMAs, namely Three Step Search (TSS), New Three Step Search (NTSS), Four Step Search (4SS) as well as Diamond Search (DS), are first selected to be implemented onto various type of standard test video sequence using MATLAB before their performances are compared and analyzed in terms of peak signal-to-noise ratio (PSNR), number of search points needed as well as their computational complexity. …”
Get full text
Get full text

Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. …”
Get full text
Get full text
Get full text

Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution.Each course scheduled out of memory consideration is examined as to whether it should be pitch adjusted with probability of eight procedures. …”
Get full text
Get full text
Get full text