The application of ant colony optimization in CBR

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

Abstract

In the Case-Based Reasoning (CBR) System, the retrieval efficiency and system performance are reduced because of the unlimited increasing case base with the incremental learning. This paper proposes the method of ant colony optimization (ACO) in the CBR system. This method combines the increased efficiency of case retrieval, the effective case base indexing, and the validity of maintenances by adding or reducing cases. Through the all processes we have used the clustering and classification algorithm based ACO. The implementation of the ACO algorithm into the CBR system is successful and the experimental results verify its effectiveness. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Shu, J. (2013). The application of ant colony optimization in CBR. Advances in Intelligent Systems and Computing, 212, 1229–1236. https://doi.org/10.1007/978-3-642-37502-6_143

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