Abstract
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 rule-based system. To evaluate the algorithms, two experiments have been conducted.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B.H. Ahmad, „Credit Apportionment Scheme for Rule-Based Systems: Implementation and Comparative Study, „B.Sc dissertation, Islamic University of Gaza, (2001).
HJ. Antonisse, “Unsupervised Credit Assignment in Knowledge-Based Sensor Fusion Systems” IEEE Trans. on Sys, Man and Cyber., sep./Oct, vol. 20, no. 5. (1990), 1153–1171.
D. Derrig, and D.J. Johannes, “Hierarchical Exemplar Based Credit Allocation for Genetic Classifier Systems”, Proceedings of the 3rd annual Genetic Programming Conference, Univ. of Wisconsin, Madison, Wisconsin, Morgan Kaufman Publishers San Francisco, California, USA, July 22-25,(1998), 622–628.
M. Dorigo,“Message-Based Bucket Brigade: An Algorithm for the Apportionment of Credit Problem” in Lecture Notes in Artificial Intelligent, Machine Learning, Springer Verlag, New York, (1991), 235–637.
N.M. Hewahi and K.K. Bharadwaj, “Bucket brigade algorithm for Hierarchical Censored Production Rule-Based systems”, International Journal of Intelligent Systems, USA, Vol. 11, John (1996), 197–225.
N.M. Hewahi, “Genetic Algorithms Approach for Adaptive Hierarchical Censored Production Rule-Based System”, School of Computer and Systems Sciences Jawaharlal Nehru University New Delhi, India, Jan. (1994).
N.M. Hewahi, “Fuzzy system as a credit assignment scheme for rule based systems”, Proceedings of 3rd Scientific Conference on Computers and Their Applications, Amman, Jordan, Feb. 11-13, (2001).
N.M. Hewahi, “Credit Apportionment Scheme for Rule Based Systems”, Journal of Islamic University of Gaza,(2001), vol. 9, No. 1, part2, 25–41.
J.H. Holland, “Properties of the bucket brigade algorithm”, in J.Grefenstette (Ed.), Proceedings of Inter.Conf. on Genetic Algorithms and Their Applications, Carnegie-Mellon University, Pittsburg, PA, July (1985).
J.H. Holland, “Escaping Brittleness: The Possibility of General-Purpose Learning Algorithm Applied to Parallel Rule-Based Systems”, in R.S. Michalski, J.G. Carbonell, and T.M. Michalski, J.G. Carbonell, and T.M. Mitchell (Eds.), Machine Learning: Artificial Intelligence Approach, vol. 2,(1986).
D. Huang, “A Framework for the Credit-Apportionment Process in Rule-Based System“. IEEE Trans, on Sys.Man and Cyber, May/June (1989), Vol. 19, no. 3, 489–498.
M. Minsky, “Step Toward Artificial Intelligence”, in A.E. Feigenbaum and J. Feldman, Eds., Computers and Thought, McGraw-Hill, New York, (1961).
R. Riolo, “Bucket Brigade Performance: I. Long Sequences of Classifier”, in J. Grefenstette (ED.), Proceeding of 2nd Inter.Conf. on Genetic Algorithms, July 1987.
AX. Samuel, “Some Studies in Machine Learning Using The Game of Checkers”, IBM Journal of Res. and Devel., No. 3, (1959).
P. Spiessens, “PCS: A Classifier System that builds a predictive internal world model”, in 9th European Conf. in AI, Stockholm, Sweden, ECA190, August 6-10, (1990), 622–627.
T.H. Westardale, “A Reward Scheme for Production Systems with Overlapping Conflict Sets”, IEEE Trans. Sys. Man and Cyber., vol. SMC-16, no. 3, May/June(1986), 369–383.
S.W. Wilson, “Hierarchical Credit Allocation in Classifier System”, in M.S. Elzas, T.I. Oren, and B.P. Zeiglar (Eds.), Model. and Simul. Methodol. Knowledge Systems’ Paradigms, Elsevier Science Publishers B.V. (North Holland), (1989), 352–357.
http://www.fifa2.com/scripts/runisa.dll?s7:gp::67173+refs/laws
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hewahi, N.M., Ahmad, H. (2002). Credit Apportionment Scheme for Rule-Based Systems: Implementation and Comparative Study. In: Hendtlass, T., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2002. Lecture Notes in Computer Science(), vol 2358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48035-8_43
Download citation
DOI: https://doi.org/10.1007/3-540-48035-8_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43781-9
Online ISBN: 978-3-540-48035-8
eBook Packages: Springer Book Archive