Search Results - (( java implementation path algorithm ) OR ( pattern classification colony algorithm ))
Search alternatives:
- pattern classification »
- classification colony »
- java implementation »
- implementation path »
- path algorithm »
-
1
Incremental continuous ant colony optimization for tuning support vector machine’s parameters
Published 2013“…Support Vector Machines are considered to be excellent patterns classification techniques. The process of classifying a pattern with high classification accuracy counts mainly on tuning Support Vector Machine parameters which are the generalization error parameter and the kernel function parameter.Tuning these parameters is a complex process and Ant Colony Optimization can be used to overcome the difficulty. …”
Get full text
Get full text
Get full text
Article -
2
Neural Network Training Using Hybrid Particle-move Artificial Bee Colony Algorithm for Pattern Classification
Published 2017“…The performance of the HPABC algorithm was investigated on four benchmark pattern-classification datasets and the results were compared with other algorithms. …”
Get full text
Get full text
Get full text
Article -
3
Neural network training using hybrid particle-move artificial bee colony algorithm for pattern classification
Published 2017“…In this work, we aimed to highlight the performance of the Hybrid Particle-move Artificial Bee Colony (HPABC) algorithm by applying it on the ANNT application.The performance of the HPABC algorithm was investigated on four benchmark pattern-classification data sets and the results were compared with other algorithms.The results obtained illustrate that HPABC algorithm can efficiently be used for ANNT.HPABC outperformed the original ABC and PSO as well as other state-of-art and hybrid algorithms in terms of time, function evaluation number and recognition accuracy.…”
Get full text
Get full text
Get full text
Article -
4
Optimizing support vector machine parameters using continuous ant colony optimization
Published 2012“…Support Vector Machines are considered to be excellent patterns classification techniques.The process of classifying a pattern with high classification accuracy counts mainly on tuning Support Vector Machine parameters which are the generalization error parameter and the kernel function parameter.Tuning these parameters is a complex process and may be done experimentally through time consuming human experience.To overcome this difficulty, an approach such as Ant Colony Optimization can tune Support Vector Machine parameters.Ant Colony Optimization originally deals with discrete optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
-
6
Ant colony algorithm for text classification in multicore-multithread environment / Ahmad Nazmi Fadzal
Published 2017“…ACO classification accuracy is compared to Genetic Algorithm classifier which also a wrapper method. …”
Get full text
Get full text
Thesis -
7
Hybrid ACO and SVM algorithm for pattern classification
Published 2013“…Support Vector Machine (SVM) is a pattern classification approach originated from statistical approaches. …”
Get full text
Get full text
Get full text
Thesis -
8
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…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
Thesis -
9
-
10
Design of intelligent Qira’at identification algorithm
Published 2017“…To evaluate the algorithm, 350 samples for 10 types of Qira’at recitation are in used, and for justifying the best pattern classification, few algorithms are tested in the early preliminary evaluation with K-Nearest Neighbour, GMM and PPCA. …”
Get full text
Get full text
Thesis -
11
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…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
Thesis -
12
Lexicon-based and immune system based learning methods in Twitter sentiment analysis
Published 2016“…In future work, the accuracy of proposed model can be strengthened by comparative study with other heuristic based searching algorithms such as genetic algorithm, ant colony optimization, swam algorithms and etc.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…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
Article -
14
Enhanced grey wolf optimisation algorithm for feature selection in anomaly detection
Published 2022“…Experimental results of the EBGWO algorithm on the NSL-KDD dataset in terms of number of selected features and classification accuracy are superior to other benchmark optimisation algorithms. …”
Get full text
Get full text
Thesis -
15
Smart appointment organizer for mobile application / Mohd Syafiq Adam
Published 2009“…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
Thesis -
16
A survey on improvement of Mahalanobis Taguchi system and its application
Published 2024Subjects:Article -
17
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text
Thesis
