The success of Case Based Reasoning (CBR) problem solving is mainly based on the recall process. The ideal CBR memory is one that simultaneously speeds up the retrieval step while improving the reuse of retrieved cases. In this paper, the authors present a novel associative memory model to perform the retrieval stage in a case based reasoning system. The described approach makes no prior assumption of a specific organization of the case memory, thus leading to a generic recall process. This is made possible by using Particle Swarm Optimization (PSO) to compute the neighborhood of a new problem, followed by direct access to the cases it contains. The fitness function of the PSO stage has a reuse semantic that combines similarity and adaptability as criteria for optimal case retrieval. The model was experimented on two proprietary databases and compared to the flat memory model for performance. The obtained results are very promising.
Performance-aware placement and chaining scheme for virtualized network functions: a particle swarm optimization approach