Using unique-prime-factorization theorem to mine frequent patterns without generating tree

QR Code

Using unique-prime-factorization theorem to mine frequent patterns without generating tree

Problem statement: Ffrequent patterns are patterns that appear in a data set frequently. Finding such frequent patterns plays an essential role in mining associations, correlations and many other interesting relationships among data. Approach: Most of the previous studies adopt an Apriorilike approa...

Full description

Bibliographic Details
Main Authors:	Tohidi, Hossein, Ibrahim, Hamidah
Format:	Article
Language:	English
Published:	Science Publications 2011
Online Access:	http://psasir.upm.edu.my/id/eprint/22476/ http://psasir.upm.edu.my/id/eprint/22476/1/ajebasp.2011.58.65.pdf

Similar Items

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

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

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

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

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

Dirichlet’s theorem and prime gap statistics
by: Pah, Chin Hee
Published: (2011)

A Scalable Algorithm for Constructing Frequent Pattern Tree
by: Noraziah, Ahmad, et al.
Published: (2014)

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

Dirichlet's theorem related prime gap statistics
by: Pah, Chin Hee
Published: (2016)

Constructing the prime orbit theorem for the beta transformation
by: Kamel Ariffin, Muhammad Rezal
Published: (2009)

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

A new method for mining maximal frequent itemsets
by: Nadimi-Shahraki, Mohammad-Hossein, et al.
Published: (2008)

EFP-M2: Efficient model for mining frequent patterns in transactional database
by: Herawan, Tutut, 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)

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

Frequent Lexicographic Algorithm for Mining Association Rules
by: Mustapha, Norwati
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)

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

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

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

Generating theorems for s-norms and t-norms
by: Shawkat Mahmoud Rasheed Alkhazaleh,, et al.
Published: (2008)

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

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

The existence-uniqueness theorem for a system of differential equations in the spaces l2r+1
by: Allahabi, Fateh Abdo Ali
Published: (2011)

The existence and uniqueness theorem of the solution to a class of nonlinear fractional order system with time delay
by: Wang, F., et al.
Published: (2016)

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

Electromagnetic fields theory of electrical machines - Part II: Uniqueness theorem for time-varying electromagnetic fields in hysteretic media
by: Mukerji, , SK, et al.
Published: (2005)

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

Frequent patterns minning of stock data using hybrid clustering association algorithm
by: B., Baharudin, et al.
Published: (2009)

On the Cauchy-Goursat theorem
by: Azram, Mohammad, et al.
Published: (2010)

MY SAY: Priming a third-generation Alliance
by: Abd Razak, Dzulkifli
Published: (2010)

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
by: Saputra , Dhany, et al.
Published: (2008)

The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop
by: Kerdprasop, Nittaya, et al.
Published: (2014)

MB3-Miner: Efficient mining eMBedded subTREEs using tree model guided candidate generation
by: Chang, Elizabeth, et al.
Published: (2005)

No-Go theorems and quantization
by: Zainuddin, Hishamuddin, et al.
Published: (2007)

Parallelization of prime number generation using message passing interface
by: I.A., Aziz, et al.
Published: (2008)

Analysis of Self and Retrieval Generated Priming in Human Recognition Memory
by: Nitka, Aleksander Wojciech
Published: (2021)

Prime implicants for modularised non-coherent fault trees using binary decision diagrams
by: Remenyte-Prescott, Rasa, et al.
Published: (2007)

An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP
by: Saputra, Dhany, et al.
Published: (2007)

On Quantum Markov Chains on Cayley tree I: uniqueness of the associated chain with XY-model on the Cayley tree of order two
by: Accardi, Luigi, et al.
Published: (2011)