Abstract
In preference-based CBR (Pref-CBR), problem solving experience is represented in the form of contextualized preferences, namely, preferences between candidate solutions in the context of a target problem to be solved. Since a potentially large number of such preferences can be collected in the course of each problem solving episode, case base maintenance clearly becomes an issue in Pref-CBR. In this paper, we therefore extend our Pref-CBR framework by another component, namely, a method for dynamic case base maintenance. The main goal of this method is to increase efficiency of case-based problem solving, by reducing the size of the case base, while maintaining performance. To illustrate the effectiveness of our approach, we present a case study in which Pref-CBR is used for the repetitive traveling salesman problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The solution \({\varvec{y}}^*\) could be a purely imaginary solution, which may not exist in practice.
- 2.
The notion of “direction” should not be taken literally. In fact, the mathematical structure of \(\mathbb {Y}\) will normally not allow for defining a direction in a geometrical sense.
- 3.
Actually, we could even create more than a qualitative preference, because the numerical values of the solutions (lengths of the tours) are known as well. This is indeed additional information we are not exploiting in this application.
- 4.
References
Abdel-Aziz, A., Cheng, W., Strickert, M., Hüllermeier, E.: Preference-based CBR: a search-based problem solving framework. In: Delany, S.J., Ontañón, S. (eds.) ICCBR 2013. LNCS, vol. 7969, pp. 1–14. Springer, Heidelberg (2013)
Abdel-Aziz, A., Strickert, M., Hüllermeier, E.: Learning solution similarity in preference-based CBR. In: Lamontagne, L., Plaza, E. (eds.) ICCBR 2014. LNCS, vol. 8765, pp. 17–31. Springer, Heidelberg (2014)
Bergmann, R., Wilke, W.: Towards a new formal model of transformational adaptation in case-based reasoning. In: Prade, H. (ed.) ECAI-98, 13th European Conference on Artificial Intelligence, pp. 53–57 (1998)
Craw, S., Massie, S., Wiratunga, N.: Informed case base maintenance: a complexity profiling approach. In: Proceedings AAAI-2007, Twenty-Second National Conference on Artificial Intelligence, 22–26 July 2007, Vancouver, British Columbia, Canada, pp. 1618–1621 (2007)
Cummins, L., Bridge, D.: On dataset complexity for case base maintenance. In: Ram, A., Wiratunga, N. (eds.) ICCBR 2011. LNCS, vol. 6880, pp. 47–61. Springer, Heidelberg (2011)
Cunningham, P., Smyth, B., Hurley, N.: On the use of CBR in optimisation problems such as the TSP. Technical report TCD-CS-95-19, Trinity College Dublin, Department of Computer Science (1995)
Erfani, H.: Integrating case-based reasoning, knowledge-based approach and TSP algorithm for minimum tour finding. J. Appl. Math. Islam. Azad Univ. Lahijan 3(9), 49–59 (2006)
Gates, G.W.: The reduced nearest neighbor rule. IEEE Trans. Inf. Theor. 18(3), 431–433 (1972)
Hart, P.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theor. 14(3), 515–516 (1968)
Hüllermeier, E., Schlegel, P.: Preference-based CBR: first steps toward a methodological framework. In: Ram, A., Wiratunga, N. (eds.) ICCBR 2011. LNCS, vol. 6880, pp. 77–91. Springer, Heidelberg (2011)
Jalali, V., Leake, D.: Adaptation-guided case base maintenance. In: Proceedings AAAI, National Conference on Artificial Intelligence (2014)
Kraay, D.R., Harker, P.T.: Case-based reasoning for repetitive combinatorial optimization problems, part I: framework. J. Heuristics 2, 55–85 (1996)
Lawanna, A., Daengdej, J.: Hybrid technique and competence-preserving case deletion methods for case maintenance in case-based reasoning. Int. J. Eng. Sci. Technol. 2(4), 492–497 (2010)
Lupiani, E., Juarez, J.M., Palma, J.: Evaluating case-base maintenance algorithms. Knowl. Based Syst. 67, 180–194 (2014)
Ontañón, S., Plaza, E.: Justification-based selection of training examples for case base reduction. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 310–321. Springer, Heidelberg (2004)
Salamó, M., Golobardes, E.: Rough sets reduction techniques for case-based reasoning. In: Aha, D.W., Watson, I. (eds.) ICCBR 2001. LNCS (LNAI), vol. 2080, pp. 467–482. Springer, Heidelberg (2001)
Salamo, M., Golobardes, E.: Hybrid deletion policies for case base maintenance. In: Proceedings of FLAIRS-2003, pp. 150–154 (2003). Enginyeria Arquitectura, and La Salle
Smiti, A., Elouedi, Z.: Overview of maintenance for case based reasoning systems. Int. J. Comput. Appl. 32(2), 49–56 (2011)
Smyth, B., Keane, T.: Remembering to forget. In: Mellish, C.S. (ed.) Proceedings International Joint Conference on Artificial Intelligence, pp. 377–382, Morgan Kaufmann (1995)
Smyth, B.: Case-base maintenance. In: del Pobil, A.P., Mira, J., Ali, M. (eds.) Tasks and Methods in Applied Artificial Intelligence. LNCS, vol. 1416, pp. 507–516. Springer, Heidelberg (1998)
Zhu, J., Yang, Q.: Remembering to add: competence-preserving case-addition policies for case-base maintenance. In: Proceedings IJCAI-99, 16th International Joint Conference on Artificial Intelligence, pp. 234–239. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Abdel-Aziz, A., Hüllermeier, E. (2015). Case Base Maintenance in Preference-Based CBR. In: Hüllermeier, E., Minor, M. (eds) Case-Based Reasoning Research and Development. ICCBR 2015. Lecture Notes in Computer Science(), vol 9343. Springer, Cham. https://doi.org/10.1007/978-3-319-24586-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-24586-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24585-0
Online ISBN: 978-3-319-24586-7
eBook Packages: Computer ScienceComputer Science (R0)