Search Results - (( variable selected selection algorithm ) OR ( java application optimization algorithm ))
Search alternatives:
- application optimization »
- selection algorithm »
- java application »
- variable »
-
1
Mixed-variable ant colony optimisation algorithm for feature subset selection and tuning support vector machine parameter
Published 2017“…ACOMV-SVM algorithm is able to simultaneously tune SVM parameters and feature subset selection. …”
Get full text
Get full text
Article -
2
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
3
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text
Conference or Workshop Item -
4
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…In order to fill this gap, this article proposes a novel framework for comparing various variants of variable length-searching meta-heuristic algorithms in the application of feature selection. …”
Get full text
Get full text
Get full text
Article -
5
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…In order to fill this gap, this article proposes a novel framework for comparing various variants of variable length-searching meta-heuristic algorithms in the application of feature selection. …”
Get full text
Get full text
Get full text
Article -
6
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…In order to fill this gap, this article proposes a novel framework for comparing various variants of variable length-searching meta-heuristic algorithms in the application of feature selection. …”
Get full text
Get full text
Get full text
Article -
7
Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique
Published 2015“…The variable block matching developed based on four stages which is the video and frame selection, threshold calculation, block size selection and search pattern. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
8
A meta-heuristics based input variable selection technique for hybrid electrical energy demand prediction models
Published 2017“…The significance of the selected input variable vectors is studied to analyze their effects on the prediction process. …”
Get full text
Get full text
Article -
9
SURE-Autometrics algorithm for model selection in multiple equations
Published 2016“…This automatic model selection algorithm is better than non-algorithm procedure which requires knowledge and extra time. …”
Get full text
Get full text
Get full text
Thesis -
10
Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers
Published 2016“…To overcome the instability selection problem, a stability selection approach is put forward to enhance the performance of single-split variable selection method. …”
Get full text
Get full text
Thesis -
11
Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier
Published 2013“…Support Vector Machine (SVM) is a present day classification approach originated from statistical approaches.Two main problems that influence the performance of SVM are selecting feature subset and SVM model selection. 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
Article -
12
Formulating new enhanced pattern classification algorithms based on ACO-SVM
Published 2013“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text
Article -
13
Taguchi?s T-method with Normalization-Based Binary Bat Algorithm
Published 2025Subjects:Conference paper -
14
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
15
Dynamic Bayesian Networks and Variable Length Genetic Algorithm for Dialogue Act Recognition
Published 2007“…In the selection phase, a new variable length genetic algorithm is applied to select the lexical cues. …”
Get full text
Get full text
Thesis -
16
New selection algorithm for Mengubah Destini Anak Bangsa (MDAB) students / Zamali Tarmudi ... [et al.]
Published 2014“…This research introduces a new algorithm to select students from low income family the so-called Mengubah Destini Anak Bangsa (MDAB) using fuzzy approach. …”
Get full text
Get full text
Research Reports -
17
Characteristic wavelength optimization for partial least squares regression using improved flower pollination algorithm
Published 2023“…This study proposes a new wavelength selection method, interval flower pollination algorithm (iFPA), for spectral variable selection in the partial least squares regression (PLSR) model. …”
Get full text
Get full text
Get full text
Article -
18
-
19
Mixed variable ant colony optimization technique for feature subset selection and model selection
Published 2013“…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
Conference or Workshop Item -
20
Deterministic Mutation-Based Algorithm for Model Structure Selection in Discrete-Time System Identification
Published 2011“…A deterministic mutation-based algorithm is introduced to overcome this problem. Identification studies using NARX (Nonlinear AutoRegressive with eXogenous input) models employing simulated systems and real plant data are used to demonstrate that the algorithm is able to detect significant variables and terms faster and to select a simpler model structure than other well-known EC methods.…”
Get full text
Get full text
Get full text
Article
