A particle swarm optimization approach for the case retrieval stage in CBR

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Finding the good experiment to reuse from the case memory is the key of success in Case Based Reasoning (CBR). The paper presents a novel associative memory model to perform this task. The algorithm is founded on a Particle Swarm Optimization (PSO) approach to compute the neighborhood of a new problem. Then, direct access to the cases in the neighborhood is performed. The model was experimented on the Adult dataset, acquired from the University of California at Irvine Machine Learning Repository and compared to flat memory model for performance. The obtained results are very promising. © 2011 Springer-Verlag London Limited.

Cite

CITATION STYLE

APA

Nouaouria, N., & Boukadoum, M. (2011). A particle swarm optimization approach for the case retrieval stage in CBR. In Res. and Dev. in Intelligent Syst. XXVII: Incorporating Applications and Innovations in Intel. Sys. XVIII - AI 2010, 30th SGAI Int. Conf. on Innovative Techniques and Applications of Artificial Intel. (pp. 209–222). Springer London. https://doi.org/10.1007/978-0-85729-130-1_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free