Fast 1-itemset frequency count using CUDA
Frequent itemset mining is one of the main and compute-intensive operations in the field of data mining. The said algorithm is use in finding frequent patterns in transactional databases. The 1-itemset frequent count is used as basis for finding succeeding k-itemset mining. Thus there is a need to s...
Saved in:
Main Authors: | Uy, Roger Luis, Marcos, Nelson |
---|---|
Format: | text |
Published: |
Animo Repository
2017
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/2187 https://animorepository.dlsu.edu.ph/context/faculty_research/article/3186/type/native/viewcontent/TENCON.2016.7847991 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
Serial and parallel implementation of Needleman-Wunsch algorithm
by: Lee, Yun Sup, et al.
Published: (2020) -
A support-ordered trie for fast frequent itemset discovery
by: LIM, Ee Peng, et al.
Published: (2004) -
An approach for fast Hierarchical agglomerative clustering using graphics processors with CUDA
by: Shalom, S.A.A., et al.
Published: (2016) -
Mining top-k regular-frequent itemsets from transactional database
by: Komate Amphawan
Published: (2012) -
A fast algorithm for mining the longest frequent itemset
by: FU QIAN
Published: (2010)