IDEAS home Printed from https://ideas.repec.org/a/ids/ijdmmm/v3y2011i3p303-318.html
   My bibliography  Save this article

MIL: a data discretisation approach

Author

Listed:
  • Bikash Kanti Sarkar
  • Shib Sankar Sana
  • Kripasindhu Chaudhuri

Abstract

Data discretisation is an important step in the process of machine learning, since it is easier for classifiers to deal with discrete attributes rather than continuous attributes. Over the years, several methods of performing discretisation such as Boolean reasoning, equal frequency binning, entropy have been proposed, explored, and implemented. In this article, a simple supervised discretisation approach called minimum information loss (MIL) is introduced. The prime goal of MIL is to maximise classification accuracy of classifier, minimising loss of information while discretisation of continuous attributes. The performance of the suggested approach is compared with the supervised discretisation algorithms: selective pseudo iterative deletion 4.7 (SPID4.7) and minimum description length principle (MDLP), using four state-of-the-art rule inductive algorithms – neural network, C4.5, Naive-Bayes, and CN2. The empirical results show that the presented approach performs better in several cases in comparison to the other two algorithms.

Suggested Citation

  • Bikash Kanti Sarkar & Shib Sankar Sana & Kripasindhu Chaudhuri, 2011. "MIL: a data discretisation approach," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 3(3), pages 303-318.
  • Handle: RePEc:ids:ijdmmm:v:3:y:2011:i:3:p:303-318
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=41811
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijdmmm:v:3:y:2011:i:3:p:303-318. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=342 .

    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.