DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, H | ko |
dc.contributor.author | Kim, KJ | ko |
dc.contributor.author | Han, Ingoo | ko |
dc.date.accessioned | 2013-03-04T04:09:54Z | - |
dc.date.available | 2013-03-04T04:09:54Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | COMPUTATIONAL AND INFORMATION SCIENCE, PROCEEDINGS, v.3314, pp.922 - 927 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/81852 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.subject | CLASSIFICATION | - |
dc.subject | SELECTION | - |
dc.title | Hybrid genetic algorithms and case-based reasoning systems | - |
dc.type | Article | - |
dc.identifier.wosid | 000226644400142 | - |
dc.identifier.scopusid | 2-s2.0-26844575881 | - |
dc.type.rims | ART | - |
dc.citation.volume | 3314 | - |
dc.citation.beginningpage | 922 | - |
dc.citation.endingpage | 927 | - |
dc.citation.publicationname | COMPUTATIONAL AND INFORMATION SCIENCE, PROCEEDINGS | - |
dc.contributor.localauthor | Han, Ingoo | - |
dc.contributor.nonIdAuthor | Ahn, H | - |
dc.contributor.nonIdAuthor | Kim, KJ | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
dc.subject.keywordPlus | CLASSIFICATION | - |
dc.subject.keywordPlus | SELECTION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.