A reward scheme for production systems with overlapping conflict sets
IEEE Transactions on Systems, Man and Cybernetics
Bucket brigade performance: I. Long sequences of classifiers
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Message-based bucket brigade: an algorithm for the apportionment of credit problem
EWSL-91 Proceedings of the European working session on learning on Machine learning
Properties of the Bucket Brigade
Proceedings of the 1st International Conference on Genetic Algorithms
Some studies in machine learning using the game of checkers
IBM Journal of Research and Development
| Hi-index | 0.00 |
Credit Apportionment scheme is the backbone of the performance of adaptive rule based system. The more cases the credit apportionment scheme can consider, the better is the overall systems performance. Currently rule based systems are used in various areas such as expert systems and machine learning which means that new rules to be generated and others to be eliminated. Several credit apportionment schemes have been proposed and some of them are even used but still most of these schemes suffer from disability of distinguishing between good rules and bad rules. Correct rules might be weakened because they are involved in an incorrect inference path (produces incorrect conclusion) and incorrect rules might be strengthen because they are involved in an inference path which produces correct conclusion. In this area a lot of research has been done, we consider three algorithms, Bucket Brigade algorithm (BB), Modified Bucket Algorithm (MBB) and General Credit Apportionment (GCA). The algorithms BB and MBB are from the same family in which they use the same credit allocation techniques where GCA uses different approach.In this research, we make a comparison study by implementing the three algorithms and apply them on a simulated "Soccer" expert rulebased system. To evaluate the algorithms, two experiments have been conducted.