Search Results - (( pattern mining algorithm ) OR ( between ((force algorithm) OR (tree algorithm)) ))

Discovering Pattern in Medical Audiology Data with FP-Growth Algorithm by G. Noma, Nasir, Mohd Khanapi, Abd Ghani

“…We use frequent pattern growth (FP-Growth) algorithm in the data processing step to build the FP-tree data structure and mine it for frequents itemsets. …”
Get full text
Get full text

Comparison of expectation maximization and K-means clustering algorithms with ensemble classifier model by Sulaiman, Md. Nasir, Mohamed, Raihani, Mustapha, Norwati, Zainudin, Muhammad Noorazlan Shah

“…Meanwhile, Kmeans clustering algorithm has also been reported has widely known for solving most unsupervised classification problems. …”
Get full text
Get full text
Get full text

Classification of cervical cancer using random forest by Bahirah, Mohd Bashah, Ku Muhammad Naim, Ku Khalif, Nor Azuana, Ramli

“…In this research, the cervical cancer risk classification model was used by using data mining approach which consider Decision Tree and Random Forest algorithm. …”
Get full text
Get full text
Get full text

Classification Analysis Of The Badminton Five Directional Lunges by Ho, Zhe Wei

“…There are no works conducted to mine the patterns of directional badminton lunge motions. …”
Get full text
Get full text

Development of a Web Access Control Technique Based User Access Behavior by Abdelrahman, Selmaelsheikh

“…A set of algorithms is used for mining user access behavior, preprocessing tasks for data preparation, association rules for defining the rules that describe the correlation between web user access transaction entries patterns, and sequential pattern discovery for finding the sequences of the web user access transaction entries pattern using Prefixspan (Pattern growth via frequent sequence lattice) algorithms. …”
Get full text
Get full text

Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud by Shariff, S. Sarifah Radiah, Hud, Hady

“…Secondly, in solving every Machine Learning problem, there is no one algorithm superior to other algorithms. Every algorithm makes its own respective prior assumptions about the relationships between the features and target variables, which create different types and levels of bias. …”
Get full text
Get full text

Finger Motion In Classifying Offline Handwriting Patterns by Yeoh, Shen Horng

“…The preprocessed data is classified using the J48 tree algorithm. The correctly classified accuracy prediction after trained could achieve up to 98 %, Finding revealed that the angle of thumbs plays a significant role in classification of the inclination of the English sentence.…”
Get full text
Get full text

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

Modifying iEclat algorithm for infrequent patterns mining by Julaily Aida, J., Mustafa, M.

“…This paper proposes an enhancement algorithm based on iEclat algorithms for mining infrequent pattern.…”
Get full text
Get full text

Modifying iEclat algo ithm for infrequent patterns mining by Julaily Aida, Jusoh, Mustafa, Man

“…This paper proposes an enhancement algorithm based on iEclat algorithms for mining infrequent pattern.…”
Get full text
Get full text

Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset by Julaily Aida, Jusoh, Wan Aezwani, Wan Abu Bakar, Mustafa, Man

“…The multiple variants in the R-Eclat algorithm generate varied performances in infrequent mining patterns. …”
Get full text
Get full text

Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

“…Since rerunning mining algorithms from scratch is very costly and time-consuming, researchers have introduced interactive mining of frequent patterns. …”
Get full text
Get full text

Web user navigation pattern mining approach based on graph partitioning algorithm. by Jalali, Mehrdad, Mustapha, Norwati, Mamat, Ali, Sulaiman, Md. Nasir

Get full text
Get full text
Get full text

Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

“…Since rerunning the mining algorithms from scratch can be very time consuming, researchers have introduced interactive mining to find proper patterns by using the current mining model with various minsup. …”
Get full text
Get full text

DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database by Zailani, Abdullah, Herawan, Tutut, Noraziah, Ahmad, Mustafa, Mat Deris

“…Nowadays, FP-Growth is one of the famous and benchmarked algorithms to mine the frequent patterns from FP-Tree data structure. …”
Get full text
Get full text
Get full text

A comparative study between rough and decision tree classifiers by Mohamad Mohsin, Mohamad Farhan

“…Theoretically, a good set of knowledge should provide good accuracy when dealing with new cases.Besides accuracy, a good rule set must also has a minimum number of rules and each rule should be short as possible.It is often that a rule set contains smaller quantity of rules but they usually have more conditions.An ideal model should be able to produces fewer, shorter rule and classify new data with good accuracy.Consequently, the quality and compact knowledge will contribute manager with a good decision model.Because of that, the search for appropriate data mining approach which can provide quality knowledge is important.Rough classifier (RC) and decision tree classifier (DTC) are categorized as RBC.The purpose of this study is to investigate the capability of RC and DTC in generating quality knowledge which leads to the good accuracy.To achieve that, both classifiers are compared based on four measurements that are accuracy of the classification, the number of rule, the length of rule, and the coverage of rule.Five dataset from UCI Machine Learning namely United States Congressional Voting Records, Credit Approval, Wisconsin Diagnostic Breast Cancer, Pima Indians Diabetes Database, and Vehicle Silhouettes are chosen as data experiment.All datasets were mined using RC toolkit namely ROSETTA while C4.5 algorithm in WEKA application was chosen as DTC rule generator.The experimental results indicated that both classifiers produced good classification result and had generated quality rule in different types of model – higher accuracy, fewer rule, shorter rule, and higher coverage.In term of accuracy, RC obtained higher accuracy in average while DTC significantly generated lower number of rule than RC.In term of rule length, RC produced compact and shorter rule than DTC and the length is not significantly different.Meanwhile, RC has better coverage than DTC.Final conclusion can be decided as follows “If the user interested at a variety of rule pattern with a good accuracy and the number of rule is not important, RC is the best solution whereas if the user looks for fewer nr, DTC might be the best choice”…”
Get full text
Get full text
Get full text
Get full text

Algorithms for frequent itemset mining: a literature review by Chee, C.-H., Jaafar, J., Aziz, I.A., Hasan, M.H., Yeoh, W.

“…This paper reviews and presents a comparison of different algorithms for Frequent Pattern Mining (FPM) so that a more efficient FPM algorithm can be developed. …”
Get full text
Get full text

Frequent Lexicographic Algorithm for Mining Association Rules by Mustapha, Norwati

“…The mined frequent patterns are then used in generating association rules. …”
Get full text
Get full text

A numerical method for frequent pattern mining by Mustapha, Norwati, Nadimi-Shahraki, Mohammad-Hossein, Mamat, Ali, Sulaiman, Md. Nasir

“…Frequent pattern mining is one of the active research themes in data mining. …”
Get full text
Get full text

A frequent pattern mining algorithm based on FP-growth without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

“…An interesting method to frequent pattern mining without generating candidate pattern is called frequent-pattern growth, or simply FP-growth, which adopts a divide-and-conquer strategy as follows. …”
Get full text
Get full text