Search Results - parallel program ((during algorithm) OR (mining algorithm))

Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

“…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
Get full text
Get full text

Measuring GPU-accelerated parallel SVM performance using large datasets for multi-class machine learning problem by Sulaiman M.A.H.B., Suliman A., Ahmad A.R.

A Community-Based Fault Isolation Approach for Effective Simultaneous Localization of Faults by Zakari, Abubakar, Lee, Sai Peck, Targio Hashem, Ibrahim Abaker

“…During program testing, software programs may be discovered to contain multiple faults. …”
Get full text
Get full text

Effective software fault localization based on complex network theory / Abubakar Zakari by Abubakar , Zakari

“…This has led researchers to adopt approaches such as one bug-at-a-time debugging approach (OBA) and parallel debugging approach. However, using OBA debugging approach increases software time-to-delivery and potentially leads to more faults during regression testing, while utilizing k-mean clustering algorithm with Euclidean distance metric to group failed tests based on their execution profile similarity in parallel debugging approach is claimed to be problematic and inappropriate. …”
Get full text
Get full text
Get full text

Local search approaches for patient scheduling problem in parallel operating theatre by Alimin, Nur Neesha

“…Scheduling for patients in parallel OT can help to schedule a large number of patients and emergency patients are considered in this study .Other than that, emergency patients are able to be scheduled and treated on the day as the modification of schedule is performed during the dynamic processof scheduling. …”
Get full text
Get full text

CUDA implementation of fractal image compression by Al Sideiri A., Alzeidi N., Al Hammoshi M., Chauhan M.S., AlFarsi G.

K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata by Md Shah, Wahidah, Othman, Mohd Fairuz Iskandar, Hussian Hassan, Ali Abdul, Talib, Mohammed Saad, Mohammed, Ali Abdul Jabbar

“…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
Get full text
Get full text
Get full text

Scheduling dynamic cellular manufacturing systems in the presence of cost uncertainty using heuristic method by Delgoshaei, Aidin

“…Since the proposed models (like similar models in the literature) are likely to fall into local optimum points, a Branch and Bound based heuristic, a hybrid Simulated Annealing and Genetic algorithm, a hybrid Tabu search and Simulated Annealing, a hybrid Genetic algorithm and Simulated Annealing, a hybrid Ant Colony Optimization and Simulated Annealing and a hybrid Multi-layer Perceptron and Simulated Annealing algorithms are developed. …”
Get full text
Get full text

Investigating computational thinking among primary school students in Terengganu using visual programming by Osmanullrazi, Abdullah

“…Recent studies have shown that visual programming is one of the efficient tools to develop CT skills. …”
Get full text
Get full text

Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

“…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
Get full text
Get full text