EFP-M2: Efficient model for mining frequent patterns in transactional database
Discovering frequent patterns plays an essential role in many data mining applications. The aim of frequent patterns is to obtain the information about the most common patterns that appeared together. However, designing an efficient model to mine these patterns is still demanding due to the capacity...
Main Authors: | Herawan, Tutut, Noraziah, Ahmad, Zailani, Abdullah, Mustafa, Mat Deris, H. Abawajyd, Jemal |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
Springer Nature Switzerland
2012
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/26642/ http://umpir.ump.edu.my/id/eprint/26642/ http://umpir.ump.edu.my/id/eprint/26642/1/EFP-M2-%20Efficient%20model%20for%20mining%20frequent%20patterns.pdf |
Similar Items
-
DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
by: Zailani, Abdullah, et al.
Published: (2012) -
Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)
by: Zailani, Abdullah, et al.
Published: (2011) -
A Scalable Algorithm for Constructing Frequent Pattern Tree
by: Noraziah, Ahmad, et al.
Published: (2014) -
Mining Least Association Rules of Degree Level Programs Selected by Students
by: Zailani, Abdullah, et al.
Published: (2014) -
Mining significant association rules from educational data using critical relative support approach
by: Zailani, Abdullah, et al.
Published: (2011)