Hybrid genetic algorithms and case-based reasoning systems

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 973
  • Download : 14
DC FieldValueLanguage
dc.contributor.authorKim, Kyoung-jae-
dc.contributor.authorAhn, Hyunchul-
dc.contributor.authorHan, In goo-
dc.date.accessioned2008-04-11T07:48:38Z-
dc.date.available2008-04-11T07:48:38Z-
dc.date.issued2005-
dc.identifier.citationComputational and Information Science, First International Symposium, CIS 2004, Shanghai, China, December 16-18, 2004. Proceedings, pp.922-927en
dc.identifier.issn1611-3349-
dc.identifier.urihttp://www.springerlink.com/content/n8g66eke6eb2xpte/-
dc.identifier.urihttp://hdl.handle.net/10203/3802-
dc.description.abstractCase-based reasoning (CBR) has been applied to various problem-solving areas for a long time because it is suitable to complex and unstructured problems. However, the design of appropriate case retrieval mechanisms to improve the performance of CBR is still a challenging issue. In this paper, we encode the feature weighting and instance selection within the same genetic algorithm (GA) and suggest simultaneous optimization model of feature weighting and instance selection. This study applies the novel model to corporate bankruptcy prediction. Experimental results show that the proposed model outperforms other CBR models.en
dc.language.isoen_USen
dc.publisherSpringer Verlag (Germany)en
dc.titleHybrid genetic algorithms and case-based reasoning systemsen
dc.typeArticleen
dc.identifier.doi10.1007/b104566-

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0