A new method for mining maximal frequent itemsets

QR Code

A new method for mining maximal frequent itemsets

In this paper, we propose a new method for mining maximal frequent itemsets. Our method introduces an efficient database encoding technique, a novel tree structure called PC_Tree and also PC_Miner algorithm. The database encoding technique utilizes Prime number characteristics and transforms each tr...

Full description

Bibliographic Details
Main Authors:	Nadimi-Shahraki, Mohammad-Hossein, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali
Format:	Conference or Workshop Item
Language:	English
Published:	IEEE 2008
Online Access:	http://psasir.upm.edu.my/id/eprint/68672/ http://psasir.upm.edu.my/id/eprint/68672/1/A%20new%20method%20for%20mining%20maximal%20frequent%20itemsets.pdf

Similar Items

A numerical method for frequent pattern mining
by: Mustapha, Norwati, et al.
Published: (2009)

Efficient prime-based method for interactive mining of frequent patterns.
by: Mohammad Hossein, Nadimi Shahraki, et al.
Published: (2011)

Prime-based method for interactive mining of frequent patterns
by: Nadimi-Shahraki, Mohammad-Hossein
Published: (2010)

Mining frequent sequences using itemset-based extension
by: Ma, Zhixin, et al.
Published: (2008)

HYBRID: an efficient unifying process to mine frequent itemsets
by: Zulkurnain, Nurul Fariza, et al.
Published: (2018)

Frequent itemset mining in high dimensional data: a review
by: Md. Zaki, Fatimah Audah, et al.
Published: (2019)

An efficient algorithm to discover large and frequent itemset in high dimensional data
by: Zulkurnain, Nurul Fariza
Published: (2019)

Frequent Lexicographic Algorithm for Mining Association Rules
by: Mustapha, Norwati
Published: (2005)

RARE: mining colossal closed itemset in high dimensional data
by: Md Zaki, Fatimah Audah, et al.
Published: (2018)

Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)
by: Zailani, Abdullah, et al.
Published: (2011)

Towards scalable algorithm for closed itemset mining in high-dimensional data
by: Md. Zaki, Fatimah Audah, et al.
Published: (2017)

Projection Based Sampling for More Efficient High Utility Itemset Mining
by: Erwin, Alva, et al.
Published: (2010)

A novel association rule mining approach using TID intermediate itemset
by: Aqra, Iyad, et al.
Published: (2018)

Evaluation and optimization of frequent, closed and maximal association rule based classification.
by: Shaharanee, I., et al.
Published: (2014)

Compact structure representation in discovering frequent patterns for association rules
by: Mustapha, Norwati, et al.
Published: (2002)

Expectation maximization clustering algorithm for user modeling in web usage mining system
by: Mustapha, Norwati, et al.
Published: (2009)

A new clustering approach based on graph partitioning for navigation patterns mining
by: Jalali, Mehrdad, et al.
Published: (2008)

A frequent pattern mining algorithm based on FP-growth without generating tree
by: Tohidi, Hossein, et al.
Published: (2010)

Using unique-prime-factorization theorem to mine frequent patterns without generating tree
by: Tohidi, Hossein, et al.
Published: (2011)

SEQUEST: Mining frequent subsequences using DMA strips
by: Tan, H., et al.
Published: (2006)

Implications of frequent subtree mining using hybrid support definitions
by: Hadzic, Fedja, et al.
Published: (2007)

Intrusion detection system with data mining approach: a review
by: Khalilian, Majdid, et al.
Published: (2011)

Improved BVBUC algorithm to discover closed itemsets in long biological datasets
by: Md Zaki, Fatimah Audah, et al.
Published: (2019)

DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
by: Zailani, Abdullah, et al.
Published: (2012)

Web user navigation pattern mining approach based on graph partitioning algorithm.
by: Jalali, Mehrdad, et al.
Published: (2008)

A web usage mining approach based on LCS algorithm in online predicting recommendation systems
by: Jalali, Mehrdad, et al.
Published: (2008)

Comparison of expectation maximization and K-means clustering algorithms with ensemble classifier model
by: Sulaiman, Md. Nasir, et al.
Published: (2018)

Tree model guided candidate generation for mining frequent subtrees from XML
by: Tan, Henry, et al.
Published: (2008)

EFP-M2: Efficient model for mining frequent patterns in transactional database
by: Herawan, Tutut, et al.
Published: (2012)

Efficiently mining frequent patterns from dense datasets using a cluster of computers
by: Rudra, Amit, et al.
Published: (2003)

Incorporating qualitative information for credit risk assessment through frequent subtree mining for XML
by: Ikasari, Novita, et al.
Published: (2011)

Intelligent mining of large-scale bio-data: bioinformatics applications
by: Hashemi, Farahnaz Sadat Golestan, et al.
Published: (2017)

A new classification model for online predicting users' future movements
by: Jalali, Mehrdad, et al.
Published: (2008)

DisClose: Discovering colossal closed itemsets via a memory efficient compact row-tree
by: Zulkurnain , N.F., et al.
Published: (2013)

Chinese maximalism: a new artistic methodology?
by: Abdullah, Sarena
Published: (2005)

Visual mining of moving flock patterns in large spatio-temporal data sets using a frequent pattern approach
by: Turdukulov, Ulanbek, et al.
Published: (2014)

Mining web navigation profiles for recommendation systems
by: AlMurtadha, Yahya M., et al.
Published: (2010)

Improved web page recommender system based on web usage mining
by: Almurtadha, Yahya Mohammed, et al.
Published: (2011)

The behavioral effects of frequent nightmares on stress tolerance
by: Hochard, Kevin D., et al.
Published: (2016)

Position score weighting technique for mining web content outliers.
by: Mustapha, Norwati, et al.
Published: (2013)