MétaCan
Menu
Back to cohort
Record W1965873953 · doi:10.5539/ijef.v4n5p116

Bankruptcy Prediction Using Memetic Algorithm with Fuzzy Approach: Empirical Evidence from Iran

2012· article· en· W1965873953 on OpenAlexvenueno aff
Gholamreza Karami, Seyed Mohammad Hashem Hosseini, Navid Attaran, Seyed Mojtaba Seyed Hosseini

Bibliographic record

VenueInternational Journal of Economics and Finance · 2012
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicFinancial Distress and Bankruptcy Prediction
Canadian institutionsnot available
Fundersnot available
KeywordsBankruptcy predictionBankruptcyMemetic algorithmFuzzy logicStock exchangeComputer scienceEconometricsAlgorithmData miningArtificial intelligenceEconomicsLocal search (optimization)Finance

Abstract

fetched live from OpenAlex

Several corporate failures have recently occurred, many have suffered from serious losses and most notably public confidence has deteriorated. In order to facilitate investor’s decision making regarding potential investment opportunities, this paper seeks to demonstrate that it is model specific constraints that limits the usefulness of accounting information, not the nature of variables per se. Thus we develop a Hybrid model which is an adaptive Memetic Algorithm combined with fuzzy approach that generates and optimizes a set of if-then rules for bankruptcy prediction. Data are derived from Tehran Stock Exchange (TSE) data bank, adopting 18 variables all of which are accounting ones, between 2001 and 2009. Four out of five models used in this survey have either accomplished high degree of accuracy or low level of type I error; however experimental results show that in terms of both average accuracy in prediction and occurrence of type I and II errors, fuzzy memetic performs better than GA, MLP, C4.5 and LDA in comparison.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.010
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.068
GPT teacher head0.254
Teacher spread0.186 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Economics and FinanceSame topicFinancial Distress and Bankruptcy PredictionFrench-language works237,207