Mining association rules using inverted hashing and pruning |
| |
Authors: | John D. HoltSoon M. Chung |
| |
Affiliation: | Department of Computer Science and Engineering, Wright State University, Dayton, OH 45435, USA |
| |
Abstract: | In this paper, we propose a new algorithm named Inverted Hashing and Pruning (IHP) for mining association rules between items in transaction databases. The performance of the IHP algorithm was evaluated for various cases and compared with those of two well-known mining algorithms, Apriori algorithm [Proc. 20th VLDB Conf., 1994, pp. 487-499] and Direct Hashing and Pruning algorithm [IEEE Trans. on Knowledge Data Engrg. 9 (5) (1997) 813-825]. It has been shown that the IHP algorithm has better performance for databases with long transactions. |
| |
Keywords: | Data mining Association rules Inverted hashing and pruning Performance analysis Databases |
本文献已被 ScienceDirect 等数据库收录! |
|