Hybrid genetic algorithms and case-based reasoning systems

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 242
  • Download : 0
Case-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.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2004
Language
English
Article Type
Article; Proceedings Paper
Keywords

CLASSIFICATION; SELECTION

Citation

COMPUTATIONAL AND INFORMATION SCIENCE, PROCEEDINGS, v.3314, pp.922 - 927

ISSN
0302-9743
URI
http://hdl.handle.net/10203/81852
Appears in Collection
MT-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0