MIL: a data discretisation approach Online publication date: Thu, 26-Feb-2015
by Bikash Kanti Sarkar, Shib Sankar Sana, Kripasindhu Chaudhuri
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 3, No. 3, 2011
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook