Search Results - (( java application mining algorithm ) OR ( variable selection problem algorithm ))

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

Get full text
Get full text

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

Get full text
Get full text

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
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

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…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

Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

“…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
Get full text
Get full text
Get full text

A web-based implementation of k-means algorithms by Lee, Quan

“…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
Get full text
Get full text

Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers by Uraibi, Hassan S.

“…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

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

“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
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

“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
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

“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text

Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

Get full text
Get full text

Mixed-variable ant colony optimisation algorithm for feature subset selection and tuning support vector machine parameter by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…ACOMV-SVM algorithm is able to simultaneously tune SVM parameters and feature subset selection. …”
Get full text
Get full text

A New Quadratic Binary Harris Hawk Optimization For Feature Selection by Abdullah, Abdul Rahim, Too, Jing Wei, Mohd Saad, Norhashimah

“…However, the original HHO is developed to solve the continuous optimization problems, but not to the problems with binary variables. …”
Get full text
Get full text
Get full text

Robust diagnostics and variable selection procedure based on modified reweighted fast consistent and high breakdown estimator for high dimensional data by Baba, Ishaq Abdullahi

“…However, in practice, high leverage points may lead to misleading results in solving variable selection problems. Therefore, a robust sure independence screening procedure based on the weighted correlation algorithm of MRFCH for high dimensional data is developed to address this problem. …”
Get full text
Get full text

SURE-Autometrics algorithm for model selection in multiple equations by Norhayati, Yusof

“…Its application on real data indicated that several models are able to forecast accurately if the data has no quality problem. 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

Hybrid ACO and SVM algorithm for pattern classification by Alwan, Hiba Basim

“…However, SVM suffers two main problems which include feature subset selection and parameter tuning. …”
Get full text
Get full text
Get full text

Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition by Yahya, Anwar Ali, Mahmod, Ramlan, Ramli, Abd Rahman

“…In the second stage, the developed variable length genetic algorithm is used to select different sets of lexical cues to constitute the dynamic Bayesian networks' random variables. …”
Get full text
Get full text

Dynamic Bayesian Networks and Variable Length Genetic Algorithm for Dialogue Act Recognition by Ali Yahya, Anwar

“…In the selection phase, a new variable length genetic algorithm is applied to select the lexical cues. …”
Get full text
Get full text

Scaled Conjugate Gradient using strong Wolfe line search for portfolio selection / Nurfatihah Anizan by Anizan, Nurfatihah

“…LAMR is the most effective algorithm among those compared, balancing quick problem-solving and solving a larger number of problems. …”
Get full text
Get full text