Summary
It is our understanding that a selection algorithm in Case Based Reasoning (CBR) must not only apply the principles of evolution found in nature, to the predicament of finding an optimal solution, but to be assisted by a methodology for problem solving based on the concept of agent. On the other hand, a drawback of any evolutionary algorithm is that a solution is better only in comparison to other(s), presently known solutions; such an algorithm actually has no concept of an optimal solution, or any way to test whether a solution is optimal. In this paper it is addressed the problem of The Selection Dilemma in CBR, where the candidate solutions are seen as evolutionary logic programs or theories, here understood as making the core of computational entities or agents, being the test whether a solution is optimal based on a measure of the quality-of-information that stems out of them.
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
Aamodt, A., Plaza, E.: Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. AI Communications 7(1), 39–59 (1994)
Analide, C., Novais, P., Machado, J., Neves, J.: Quality of Knowledge in Virtual Entities. In: Encyclopedia of Communities of Practice in Information and Knowledge Management, pp. 436–442. Idea Group Inc. (2006)
Angeline, P.J.: Parse Trees. In: BŁck, T., et al. (eds.) Evolutionary Computation 1: Basic Algorithms And Operators. Institute of Physics Publishing, Bristol (2000)
Jennings, N.R., Faratin, P., Johnson, M.J., Norman, T.J., O‘Brien, Wiegand, M.E.: Journal of Cooperative Information Systems 5(2-3), 105–130 (1996)
Leake, D.: Case-Based Reasoning - Experience, Lessons and Future Direction. MIT Press, Cambridge (1996)
Mendes, R., Kennedy, J., Neves, J.: Avoiding the Pitfalls of Local Optima: How topologies can Save the Day. In: Proceedings of the 12th Conference Intelligent Systems Application to Power Systems (ISAP 2003). IEEE Computer Society, Lemnos (2003)
Neves, J.: A Logic Interpreter to Handle Time and Negation in Logic Data Bases. In: Proceedings of ACM 1984 Annual Conference, San Francisco, USA, October 24-27 (1984)
Neves, J., Machado, J., Analide, C., Abelha, A., Brito, L.: The Halt Condition in Genetic Programming. In: Neves, J., Santos, M.F., Machado, J.M. (eds.) EPIA 2007. LNCS (LNAI), vol. 4874, pp. 160–169. Springer, Heidelberg (2007)
Rudolph, G.: Convergence Analysis of Canonical Genetic Algorithms. IEEE Transactions on Neural Networks, Special Issue on Evolutionary Computation 5(1), 96–101 (1994)
Teller, A.: Evolving programmers: The co-evolution of intelligent recombination operators. In: Kinnear, K., Angeline, P. (eds.) Advances in Genetic Programming 2, MIT, Cambridge (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Analide, C., Abelha, A., Machado, J., Neves, J. (2008). An Agent Based Approach to the Selection Dilemma in CBR. In: Badica, C., Mangioni, G., Carchiolo, V., Burdescu, D.D. (eds) Intelligent Distributed Computing, Systems and Applications. Studies in Computational Intelligence, vol 162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85257-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-85257-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85256-8
Online ISBN: 978-3-540-85257-5
eBook Packages: EngineeringEngineering (R0)