Improved Direct Hashing and Pruning for Mining Association Rules

• 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

碩士 === 康寧大學 === 數位應用研究所 === 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 confidence. In this research, we propose a scheme, Improved Direct Hashing and Pruning (IDHP) algorithm, to improve the efficiency by deleting the non-frequent items early. The simulation results show that our IDHP algorithm achieves better computational efficiency than the traditional DHP algorithm.