Rough Sets and Association Rules - Which is Efficient?
暂无分享,去创建一个
We evaluate the rough set and the association rule method with respect to their performance and the quality of the produced rules. It is shown that despite their different approaches, both methods are based on the same principle and, consequently, must generate identical rules. However, they differ strongly with respect to performance. Subsequently an optimized association rule procedure is presented which unifies the advantages of both methods.
[1] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[2] Hans-Joachim Lenz,et al. Tree Based Indexes Versus Bitmap Indexes: A Performance Study , 2001, Int. J. Cooperative Inf. Syst..
[3] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.