IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v2y2011i1p1-17.html
   My bibliography  Save this article

Discrete Artificial Bee Colony Optimization Algorithm for Financial Classification Problems

Author

Listed:
  • Yannis Marinakis

    (Technical University of Crete, Greece)

  • Magdalene Marinaki

    (Technical University of Crete, Greece)

  • Nikolaos Matsatsinis

    (Technical University of Crete, Greece)

  • Constantin Zopounidis

    (School of Production Engineering and Management, Technical University of Crete, Greece & Audencia Business School, France)

Abstract

Nature-inspired methods are used in various fields for solving a number of problems. This study uses a nature-inspired method, artificial bee colony optimization that is based on the foraging behaviour of bees, for a financial classification problem. Financial decisions are often based on classification models, which are used to assign a set of observations into predefined groups. One important step toward the development of accurate financial classification models involves the selection of the appropriate independent variables (features) that are relevant to the problem. The proposed method uses a discrete version of the artificial bee colony algorithm for the feature selection step while nearest neighbour based classifiers are used for the classification step. The performance of the method is tested using various benchmark datasets from UCI Machine Learning Repository and in a financial classification task involving credit risk assessment. Its results are compared with the results of other nature-inspired methods.

Suggested Citation

  • Yannis Marinakis & Magdalene Marinaki & Nikolaos Matsatsinis & Constantin Zopounidis, 2011. "Discrete Artificial Bee Colony Optimization Algorithm for Financial Classification Problems," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(1), pages 1-17, January.
  • Handle: RePEc:igg:jamc00:v:2:y:2011:i:1:p:1-17
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2011010101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:2:y:2011:i:1:p:1-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.