Improved Direct Hashing and Pruning for Mining Association Rules
碩士 === 康寧大學 === 數位應用研究所 === 101 === Algorithms applied in association rules is the key to data mining. Their functions focus on finding associations of varieties of item combinations, thus the time and space complexity increases rapidly when the process is reaching its minimum support and minimum co...
Main Authors: | Yen-Cho Liu, 劉彥卓 |
---|---|
Other Authors: | Tzan-ShiShiun Yangn |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/45316850820036518527 |
Similar Items
-
Partition Hashing and Pruning Algorithm for Mining Temporal Association Rules
by: Jung-Cheng Chen, et al.
Published: (2004) -
A Minimal Perfect Hashing and Pruning Approach for Mining Association Rules
by: Tsai Wun-Fu, et al.
Published: (2002) -
A Novel Incremental Mining Algorithm for Association Rules based on Minimal Perfect Hashing and Pruning
by: CHOU, EN-SHENG, et al.
Published: (2010) -
Mining Generalized Association Rules Using Pruning Techniques
by: Chiech-Ming Wu, et al.
Published: (2002) -
Locality Sensitive Hashing for Sampling-based Algorithms in Association Rule Mining
by: Chin-Ping Huang, et al.
Published: (2009)