Prime-based method for interactive mining of frequent patterns
Over the past decade, an increasing number of efficient mining algorithms have been proposed to mine the frequent patterns by satisfying a user specified threshold called minimum support (minsup). However, determining an appropriate value for minsup to find proper frequent patterns in different appl...
Saved in:
Main Author: | Nadimi-Shahraki, Mohammad-Hossein |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2010
|
Online Access: | http://psasir.upm.edu.my/id/eprint/19628/1/FSKTM_2010_10.pdf http://psasir.upm.edu.my/id/eprint/19628/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
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) -
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) -
A frequent pattern mining algorithm based on FP-growth without generating tree
by: Tohidi, Hossein, et al.
Published: (2010)