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

Leafcutter Ant Colony Optimization Algorithm for Feature Subset Selection on Classifying Digital Mammograms

Author

Listed:
  • Abubacker Kaja Mohideen

    (Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, Tamil Nadu, India)

  • Kuttiannan Thangavel

    (Department of Computer Science, Periyar University, Salem, Tamil Nadu, India)

Abstract

Ant Colony Optimization (ACO) has been applied in wide range of applications. In ACO, for every iteration the entire problem space is considered for the solution construction using the probability of the pheromone deposits. After convergence, the global solution is made with the path which has highest pheromone deposit. In this paper, a novel solution construction technique has been proposed to reduce the time complexity and to improve the performance of the ACO. The idea is derived from the behavior of a special ant species called ‘Leafcutter Ants', they spend much of their time for cutting leaves to make fertilizer to gardens in which they grow the fungi that they eat. This behavior is incorporated with the general ACO algorithm to propose a novel feature selection method called ‘Leafcutter Ant Colony Optimization' (LACO) algorithm. The LACO has been applied to select the relevant features for digital mammograms and their corresponding classification performance is studied and compared.

Suggested Citation

  • Abubacker Kaja Mohideen & Kuttiannan Thangavel, 2014. "Leafcutter Ant Colony Optimization Algorithm for Feature Subset Selection on Classifying Digital Mammograms," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 5(3), pages 23-43, July.
    • Handle: RePEc:igg:jamc00:v:5:y:2014:i:3:p:23-43
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2014070103
    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:5:y:2014:i:3:p:23-43. 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.