Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast discovery of association rules
Advances in knowledge discovery and data mining
The First Step Toward Processor for Rough Set Methods
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.00 |
Calculating decision rules is a very important process. There are a lot of solutions for computing decision rules, but the algorithms of computing all set of rules are time consuming. We propose a recursive version of the well known apriori algorithm [1], designed for parallel processing. We present here, how to decompose the problem of calculating decision rules, so that the parallel calculations are efficient.