A support-ordered trie for fast frequent itemset discovery
The importance of data mining is apparent with the advent of powerful data collection and storage tools; raw data is so abundant that manual analysis is no longer possible. Unfortunately, data mining problems are difficult to solve and this prompted the introduction of several novel data structures...
Saved in:
Main Authors: | LIM, Ee Peng, WOON, Yew-Kwong, NG, Wee-Keong |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2004
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/123 https://ink.library.smu.edu.sg/context/sis_research/article/1122/viewcontent/Support_ordered_trie_for_fast_frequent_itemset_discovery.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Mining top-k regular-frequent itemsets from transactional database
by: Komate Amphawan
Published: (2012) -
Discover, recycle and reuse frequent patterns in association rule mining
by: CONG GAO
Published: (2010) -
Mining RDF metadata for generalized association rules: Knowledge discovery in the semantic web era
by: JIANG, Tao, et al.
Published: (2006) -
A fast algorithm for mining the longest frequent itemset
by: FU QIAN
Published: (2010) -
Fast 1-itemset frequency count using CUDA
by: Uy, Roger Luis, et al.
Published: (2017)