Search Results - (( program solution mining algorithm ) OR ( java application tree algorithm ))

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

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.

Talent classification using support vector machine technique / Hamidah Jantan, Norazmah Mat Yusof and Mohd Hanapi Abdul Latif by Jantan, Hamidah, Mat Yusof, Norazmah, Abdul Latif, Mohd Hanapi

Subjects: Get full text
Get full text

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

“…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
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

Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

“…This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
Get full text
Get full text
Get full text

Towards a better feature subset selection approach by Shiba, Omar A. A.

“…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
Get full text
Get full text
Get full text

Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli by Seyed Hamidreza , Aghay Kaboli

“…To assess the applicability and accuracy of the proposed method for long-term electrical energy consumption, its estimates are compared with those obtained from artificial neural network (ANN), support vector regression (SVR), adaptive neuro-fuzzy inference system (ANFIS), rule-based data mining algorithm, GEP, linear, quadratic and exponential models optimized by particle swarm optimization (PSO), cuckoo search algorithm (CSA), artificial cooperative search (ACS) algorithm and backtracking search algorithm (BSA). …”
Get full text
Get full text
Get full text

Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

“…In effect, they are very useful in generating rules when solving the classification problem that is inherent in data mining. The thesis emphasizes mainly on the improvement of the original SIP/DRIP algorithm in term of performance. …”
Get full text
Get full text

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

“…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
Get full text
Get full text
Get full text

Web page design for electronic commerce / Lee Fong Wai by Lee , Fong Wai

“…The sixth part covers the system implementation that involved the transformation of modules and algorithm into implementable commands by using the specified programming languages. …”
Get full text
Get full text

AI powered asthma prediction towards treatment formulation: an android app approach by Murad, Saydul Akbar, Adhikary, Apurba, Md Muzahid, Abu Jafar, Sarker, Md Murad Hossain, Khan, Md. Ashikur Rahman, Hossain, Md. Bipul, Bairagi, Anupam Kumar, Masud, Mehedi, Kowsher, Md

“…We utilized eight robust machine learning algorithms to analyze this dataset. We found that the Decision tree classifier had the best performance, out of the eight algorithms, with an accuracy of 87%. …”
Get full text
Get full text
Get full text

Classification models for higher learning scholarship award decisions by Wirawati Dewi Ahmad, Azuraliza Abu Bakar

“…In this study, a data mining approach was used to propose a classification model of scholarship award result determination. …”
Get full text
Get full text
Get full text

AI powered asthma prediction towards treatment formulation : An android app approach by Murad, Saydul Akbar, Adhikary, Apurba, Muzahid, Abu Jafar Md, Sarker, Md. Murad Hossain, Khan, Md. Ashikur Rahman, Hossain, Md. Bipul, Bairagi, Anupam Kumar, Masud, Mehedi, Kowsher, Md.

“…We utilized eight robust machine learning algorithms to analyze this dataset. We found that the Decision tree classifier had the best performance, out of the eight algorithms, with an accuracy of 87%. …”
Get full text
Get full text
Get full text

Dynamic and adaptive execution models for data stream mining applications in mobile edge cloud computing systems / Muhammad Habib Ur Rehman by Muhammad Habib , Ur Rehman

“…At application level, the program components need to handle continuously streaming data in order to perform knowledge discovery operations. …”
Get full text
Get full text
Get full text

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