Search Results - (( pattern mining algorithm ) OR ((( pattern bees algorithm ) OR ( pattern _ algorithm ))))

Data normalization techniques in swarm-based forecasting models for energy commodity spot price by Yusof, Yuhanis, Mustaffa, Zuriani, Kamaruddin, Siti Sakira

“…Data mining is a fundamental technique in identifying patterns from large data sets.The extracted facts and patterns contribute in various domains such as marketing, forecasting, and medical.Prior to that, data are consolidated so that the resulting mining process may be more efficient.This study investigates the effect of different data normalization techniques.which are Min-max, Z-score and decimal scaling, on Swarm-based forecasting models.Recent swarm intelligence algorithms employed includes the Grey Wolf Optimizer (GWO) and Artificial Bee Colony (ABC).Forecasting models are later developed to predict the daily spot price of crude oil and gasoline.Results showed that GWO works better with Z-score normalization technique while ABC produces better accuracy with the Min-Max.Nevertheless, the GWO is more superior than ABC as its model generates the highest accuracy for both crude oil and gasoline price.Such a result indicates that GWO is a promising competitor in the family of swarm intelligence algorithms.…”
Get full text
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

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

Frequent Lexicographic Algorithm for Mining Association Rules by Mustapha, Norwati

“…An algorithm called Flex (Frequent lexicographic patterns) has been proposed in obtaining a good performance of searching li-equent patterns. …”
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

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

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

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

“…Our algorithm works based on prime factorization, and is called Frequent Pattern-Prime Factorization (FPPF).…”
Get full text
Get full text

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

“…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
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

Neural Network Training Using Hybrid Particle-move Artificial Bee Colony Algorithm for Pattern Classification by Nuaimi, Zakaria Noor Aldeen Mahmood Al, Abdullah, Rosni

“…Artificial Bees Colony (ABC) optimization algorithm is one of the competitive algorithms in the SI algorithms group. …”
Get full text
Get full text
Get full text

Neural network training using hybrid particle-move artificial bee colony algorithm for pattern classification by Al Nuaimi, Zakaria Noor Aldeen Mahmood, Abdullah, Rosni

“…In this work, we aimed to highlight the performance of the Hybrid Particle-move Artificial Bee Colony (HPABC) algorithm by applying it on the ANNT application.The performance of the HPABC algorithm was investigated on four benchmark pattern-classification data sets and the results were compared with other algorithms.The results obtained illustrate that HPABC algorithm can efficiently be used for ANNT.HPABC outperformed the original ABC and PSO as well as other state-of-art and hybrid algorithms in terms of time, function evaluation number and recognition accuracy.…”
Get full text
Get full text
Get full text

Sequential pattern mining using PrefixSpan with pseudoprojection and separator database by Saputra, D., Rambli, D.R.A., Foong, Oi Mean

“…Sequential pattern mining is a new branch of data mining science that solves inter-transaction pattern mining problems. …”
Get full text
Get full text

Using unique-prime-factorization theorem to mine frequent patterns without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

“…An interest solution is to design an approach that without generating candidate is able to mine frequent patterns. Results: 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
Get full text

MINING CUSTOMER DATA FOR DECISION MAKING USING NEW HYBRID CLASSIFICATION ALGORITHM by Aurangzeb, khan, Baharum, Baharudin, Khairullah, khan

“…In this paper we proposed an algorithm for mining patterns of huge stock data to predict factors affecting the sale of products. …”
Get full text
Get full text

IncSPADE: An Incremental Sequential Pattern Mining Algorithm Based on SPADE Property by Omer, Adam, Zailani, Abdullah, Amir, Ngah, Kasypi, Mokhtar, Wan Muhamad Amir, Wan Ahmad, Herawan, Tutut, Noraziah, Ahmad, Mustafa, Mat Deris, Abdul Razak, Hamdan

“…In this paper we propose Incremental Sequential PAttern Discovery using Equivalence classes (IncSPADE) algorithm to mine the dynamic database without the requirement of re-scanning the database again. …”
Get full text
Get full text
Get full text

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

“…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
Get full text