Search Results - candidate ((((generation algorithm) OR (function algorithm))) OR (detection algorithm))
Search alternatives:
-
1
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text
Thesis -
2
An efficient anomaly intrusion detection method with feature selection and evolutionary neural network
Published 2020“…The proposed search algorithm uses mutation to more accurately examine the search space, to allow candidates to escape local minima. …”
Get full text
Get full text
Get full text
Article -
3
3D face candidate region detection using background subtraction / Zulfikri Paidi and Nurzaid Muhd Zain
Published 2016“…Our focus is to solve the first challenge in face registration, which is to detect and identify face region. From the experiment, it shows some promising results related to using background subtraction in face candidate region detection algorithm. …”
Get full text
Get full text
Get full text
Article -
4
Improved Malware detection model with Apriori Association rule and particle swarm optimization
Published 2019“…Particle swarm optimization (PSO) is used to optimize the random generation of candidate detectors and parameters associated with apriori algorithm (AA) for features selection. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
5
PMT : opposition based learning technique for enhancing metaheuristic algorithms performance
Published 2020“…Experimentally, the PMT shows promising results by accelerating the convergence rate against the original algorithms with the same number of fitness evaluations comparing to the original metaheuristic algorithms in benchmark functions and real-world optimization problems.…”
Get full text
Get full text
Thesis -
6
Static code analysis of permission-based features for android malware classification using apriori algorithm with particle swarm optimization
Published 2015“…This paper presents a classification approach on android malware using candidate detectors generated from an unsupervised association rule of Apriori Algorithm. …”
Get full text
Get full text
Get full text
Article -
7
Android Malware classification using static code analysis and Apriori algorithm improved with particle swarm optimization
Published 2014“…This paper presents a classification of android malware using candidate detectors generated from an unsupervised association rule of Apriori algorithm improved with particle swarm optimization to train three different supervised classifiers. …”
Get full text
Get full text
Get full text
Proceeding Paper -
8
Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm
Published 2021“…The main feature of AAHC is the fact that the algorithm allows adaptive assignment of its population agents into cowards and heroes based on the exponential controlling functions. …”
Get full text
Get full text
Get full text
Article -
9
Optimal Location And Sizing Of Distrubuted Generator Using PSO And GA Algorithms In Power Systems
Published 2019“…The multi-objective function, which represents the summation of product three indices by corresponding weights was utilized to identify the candidate buses to reduce the search space of the algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
An improved grey wolf with whale algorithm for optimization functions
Published 2022“…The performance of the proposed algorithm is tested and evaluated on five benchmarked unimodal and five multimodal functions. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
11
PMT: opposition-based learning technique for enhancing meta-heuristic performance
Published 2019“…Unlike existing OBL-based techniques, the PMT generates more than one candidate in multiple solution-space directions. …”
Get full text
Get full text
Get full text
Article -
12
Levy slime mould algorithm for solving numerical and engineering optimization problems
Published 2022“…We took advantage of the Levy flight, which solved the local optima problem and improved traditional SMA efficiency. The proposed LSMA algorithm performance was evaluated using 23 well-known benchmark test functions, namely unimodal benchmark functions, multimodal benchmark functions, and fixed-dimension multimodal benchmark functions, as well as compared with the traditional SMA. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Hash function of finalist SHA-3: analysis study
Published 2013“…Thus, for this reason the paper addresses the comparative and analysis study of the finalist SHA-3 candidates in: complexity of security, design and structure, as well as performance and cost, to measure the robustness of the algorithms in this area, through the Fundamentals Security Measurement Factors of Hash Function (FSMFHF) of Secure Hash Algorithm (SHA). …”
Get full text
Get full text
Get full text
Article -
14
Informative top-k class associative rule for cancer biomarker discovery on microarray data
Published 2020“…This paper proposes an informative top-k class associative rule (iTCAR) method in an integrative framework for identifying candidate genes of specific cancers. iTCAR introduces an enhanced associative classification algorithm that integrates microarray data with biological information from gene ontology, KEGG pathways, and protein-protein interactions to generate informative class associative rules. …”
Get full text
Get full text
Get full text
Article -
15
Informative top-k class associative rule for cancer biomarker discovery on microarray data
Published 2020“…This paper proposes an informative top-k class associative rule ( i TCAR) method in an integrative framework for identifying candidate genes of specific cancers. i TCAR introduces an enhanced associative classification algorithm that integrates microarray data with biological informa- tion from gene ontology, KEGG pathways, and protein-protein interactions to generate informative class associative rules. …”
Get full text
Get full text
Get full text
Article -
16
Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm
Published 2025“…Data vectors are generated based on the time needed, sequential and parallel candidate feature data are obtained, and the data rate is combined. …”
Article -
17
Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things
Published 2022“…On the other hand, existing stream data learning models with limited labelling have many limitations. Most importantly, algorithms that suffer from a limited capability to adapt to the evolving nature of data generated from network traffic are called concept drift. …”
Get full text
Get full text
Thesis -
18
An optimized variant of machine learning algorithm for datadriven electrical energy efficiency management (D2EEM)
Published 2024“…This study recommends a selection trade-off as the function of prediction efficiency and efficacy of the algorithm. …”
Get full text
Get full text
Thesis -
19
Defect green coffee bean detection using image recognition and supervised learning
Published 2022“…Therefore, in this research project, the process will be conducted by using an image classifier with the model of a machine learning algorithm which the candidates comprise of Support Vector Machine, k-Nearest Neighbour and Decision Tree. k-nearest neighbour has the highest F1-score (0.51) than the other two algorithms (Support Vector Machine: 0.50, and Decision Tree: 0.48). …”
Get full text
Get full text
Get full text
Academic Exercise -
20
A new variant of black hole algorithm based on multi population and levy flight for clustering problem
Published 2020“…The second modification is the multiple population BH that is proposed as a generalization to the BH algorithm, in which the algorithm was not reliant upon the best solution but rather on a set of best solutions generated, called “MBH”. …”
Get full text
Get full text
Thesis
