DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jo H. | ko |
dc.contributor.author | Han, Ingoo | ko |
dc.contributor.author | Lee H. | ko |
dc.date.accessioned | 2008-04-11T02:17:40Z | - |
dc.date.available | 2008-04-11T02:17:40Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1997 | - |
dc.identifier.citation | EXPERT SYSTEMS WITH APPLICATIONS, v.13, no.2, pp.97 - 108 | - |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.uri | http://hdl.handle.net/10203/3782 | - |
dc.description.abstract | Bankruptcy prediction is one of the major business classification problems. In this paper we use three different techniques: (1) Multivariate discriminant analysis, (2) case-based forecasting, and (3) neural network to predict Korean bankrupt and nonbankrupt firms. The average hit ratios of three methods range from 81.5 to 83.8%. Neural network performs better allan discriminant analysis and the case-based forecasting system. (C) 1997 Elsevier Science Ltd. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | FAILURE | - |
dc.subject | MODELS | - |
dc.title | Bankruptcy prediction using case-based reasoning, neural networks, and discriminant analysis | - |
dc.type | Article | - |
dc.identifier.wosid | A1997YB49100002 | - |
dc.identifier.scopusid | 2-s2.0-0031199479 | - |
dc.type.rims | ART | - |
dc.citation.volume | 13 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 97 | - |
dc.citation.endingpage | 108 | - |
dc.citation.publicationname | EXPERT SYSTEMS WITH APPLICATIONS | - |
dc.identifier.doi | 10.1016/S0957-4174(97)00011-0 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Han, Ingoo | - |
dc.contributor.nonIdAuthor | Jo H. | - |
dc.contributor.nonIdAuthor | Lee H. | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | FAILURE | - |
dc.subject.keywordPlus | MODELS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.