Compact structure representation in discovering frequent patterns for association rules

QR Code

Compact structure representation in discovering frequent patterns for association rules

Frequent pattern mining is a key problem in important data mining applications, such as the discovery of association rules, strong rules and episodes. Structure used in typical algorithms for solving this problem operate in several database scans and a large number of candidate generation. This pape...

Full description

Bibliographic Details
Main Authors:	Mustapha, Norwati, Sulaiman, Md. Nasir, Othman, Mohamed, Selamat, Mohd Hasan
Format:	Article
Language:	English
Published:	Universiti Utara Malaysia Press 2002
Online Access:	http://psasir.upm.edu.my/id/eprint/34764/ http://psasir.upm.edu.my/id/eprint/34764/1/Compact%20structure%20representation%20in%20discovering%20frequent%20patterns%20for%20association%20rules.pdf

Similar Items

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

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

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)

Evaluation and optimization of frequent association rule based classification
by: Izwan Nizal Mohd Shaharanee,, et al.
Published: (2014)

Discovering association rules for mining images datasets: a proposal
by: Hamzah, Azizi, et al.
Published: (2005)

Fast discovery of long patterns for association rules
by: Mustapha, N., et al.
Published: (2003)

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

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

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

SwSim: discovering semantic similarity association in semantic web
by: Shariatmadari, Shahdad, et al.
Published: (2008)

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

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

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

Mining association rules from structured XML data
by: Abazeed, Ashraf Riad, et al.
Published: (2009)

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)

IP algorithms in compact rough classification modeling
by: Bakar, Azuraliza Abu, et al.
Published: (2001)

Discovering decision algorithm of distance protective relay based on rough set theory and rule quality measure
by: Othman, Mohamad Lutfi
Published: (2011)

Scalable approach for mining association rules from structured XML data
by: Abazeed, Ashraf Riad, et al.
Published: (2009)

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

Analysis of Traffic Accident Patterns Using Association Rule Mining
by: Yudy, Pranata, et al.
Published: (2024)

Discovering sequential patterns in a UK general practice database
by: Reps, Jenna, et al.
Published: (2012)

Discovering Genomic Patterns Using Fuzzy Self Organizing Map
by: Chu , Ho Yi
Published: (2009)

A hybrid model for discovering significant patterns in data mining
by: Abdullah, Zailani
Published: (2012)

Frequent nocturnal awakening in early life is associated with nonatopic asthma in children
by: Kozyrskyj, A., et al.
Published: (2009)

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

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

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

Informative top-k class associative rule for cancer biomarker discovery on microarray data
by: Ong, Huey Fang, et al.
Published: (2020)

Informative top-k class associative rule for cancer biomarker discovery on microarray data
by: Ong, Huey Fang, et al.
Published: (2020)

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

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

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

Rough sets, rule-based approaches, and knowledge representation
by: Ciucci, D., et al.
Published: (2016)

Measure and integration on non-locally compact spaces and representation theory
by: Waller, Raven
Published: (2019)

Discovering Quality
by: Mansor Fadzil,
Published: (2013)

Discovering beneficial cooperative structures for the automatic construction of heuristics
by: Terrazas, German, et al.
Published: (2010)

Improving strategy for discovering interacting genetic variants in association studies
by: Uppu, S., et al.
Published: (2016)

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