Efficient prime-based method for interactive mining of frequent patterns.

QR Code

Efficient prime-based method for interactive mining of frequent patterns.

Over the past decade, an increasing number of efficient algorithms have been proposed to mine frequent patterns by satisfying the minimum support threshold. Generally, determining an appropriate value for minimum support threshold is extremely difficult. This is because the appropriate value depends...

Full description

Bibliographic Details
Main Authors:	Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali
Format:	Article
Language:	English English
Published:	Elsevier 2011
Online Access:	http://psasir.upm.edu.my/id/eprint/18467/ http://psasir.upm.edu.my/id/eprint/18467/1/Efficient%20prime.pdf

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

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)

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

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

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

Tree model guided candidate generation for mining frequent subtrees from XML
by: Tan, Henry, 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)

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)

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

A recommender system approach for classifying user navigation patterns using longest common subsequence algorithm.
by: Jalali, Mehrdad, et al.
Published: (2009)

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

Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
by: Al-Saffar, Najlae Falah Hameed
Published: (2015)

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

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

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)

No evidence for subliminal affective priming with emotional facial expression primes
by: Andrews, V., et al.
Published: (2011)

Assessment of in-vitro antioxidant capacity and polyphenolic composition of frequently used legumes
by: M., Khan, et al.
Published: (2018)

A study Of channel assignment approach to reduce frequent reassignment
by: Omar, Zakaria, et al.
Published: (2011)

ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository
by: Zailani, Abdullah, et al.
Published: (2017)

Integrated pest management for German cockroach (Blattella germanica L.) in selected urban communities in Yasuj, Iran
by: Shahraki, Gholam Hossein
Published: (2011)

An efficient and effective case classification method based on slicing
by: Shiba, Omar A. A., et al.
Published: (2006)