Search Results - (( problem using support algorithm ) OR ( java application mining 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

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

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

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

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

Get full text
Get full text

Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text

Decision Support System Algorithm for the Beneficiary of Uninhabitable Housing Funds by Diena Rauda, Ramdania, Subaeki, B, L., Muliawaty, M. A, Ramdhani

“…This result indicates that the decision support system using the ELECTRE method can use as an alternative to the efficiency of determining the prospective beneficiaries of uninhabitable housing in Indonesia.…”
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

Enhanced artificial bee colony-least squares support vector machines algorithm for time series prediction by Zuriani, Mustaffa

“…The lvABC algorithm is introduced to overcome the local optima problem by enriching the searching behaviour using Levy mutation. …”
Get full text
Get full text
Get full text

Using the bees algorithm to optimise a support vector machine for wood defect classification by Pham, D.T, Muhammad, Zaidi, Mahmuddin, Massudi, Ghanbarzadeh, Afshin, Koc, Ebubekir, Otri, Sameh

Get full text
Get full text
Get full text

Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Ant Colony Optimization has been used to solve Support Vector Machine model selection problem.Ant Colony Optimization originally deals with discrete optimization problem.In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time.This study proposes an algorithm that can optimize Support Vector Machine parameters using Continuous Ant Colony Optimization without the need to discretize continuous value for Support Vector Machine parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.…”
Get full text
Get full text
Get full text

Hand gesture recognition for autism diagnosis using Support Vector Machine (SVM) Algorithm / Muhammad Asyraf Mohamad Zain by Mohamad Zain, Muhammad Asyraf

“…To counter this problem, a system has been proposed to detect the hand gesture using one of the machine learning technique which is Support Vector Machine (SVM) Algorithm. …”
Get full text
Get full text

Extending the decomposition algorithm for support vector machines training by Zaki, N,M., Deris, S., Chin, K.K.

“…One can design a dedicated optimizer that will take full advantage of the specific nature of the QP problem in SVM training. The decomposition algorithm developed by Osuna et al. (1997a) reduces the training cost to an acceptable level. …”
Get full text
Get full text
Get full text

Efficient radio resource management algorithms for downlink long term evolution networks by Mamman, Maharazu

“…The algorithm is based on the idea of the optimization problem in which resource allocation problem is formulated as an optimization problem. …”
Get full text
Get full text

Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

“…This paper presents a solution to the MCP problem using genetic algorithm (GA). Through simulation, this algorithm has been shown to give a high probability of finding a feasible path if such paths exist. �2007 IEEE.…”

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

“…This paper proposed a solution to the MCP problem using genetic algorithm (GA). The effectiveness of the proposed algorithm is evaluated through simulation. …”

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

“…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
Get full text
Get full text
Get full text

An Integrated Principal Component Analysis And Weighted Apriori-T Algorithm For Imbalanced Data Root Cause Analysis by Ong, Phaik Ling

“…However, frequent pattern mining (FPM) using Apriori-like algorithms and support-confidence framework suffers from the myth of rare item problem in nature. …”
Get full text
Get full text
Get full text
Get full text