A novel Univariate Marginal Distribution Algorithm based discretization algorithm
Many data mining algorithms can only deal with discrete data or have a better performance on discrete data; however, for some technological reasons often we can only obtain the continuous value in the real world. Therefore, discretization has played an important role in data mining. Discretization is defined as the process of mapping the continuous attribute space into the discrete space, namely, using integer values or symbols to represent the continuous spaces. In this paper, we proposed a discretization method on the basis of a Univariate Marginal Distribution Algorithm (UMDA). The UMDA is a combination of statistics learning theory and Evolution Algorithms. The fitness function of the UMDA not only took the accuracy of the classifier into account, but also the number of breakpoints. Experimental results showed that the algorithm proposed in this paper could effectively reduce the number of breakpoints, and at the same time, improve the accuracy of the classifier.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 82 (2012)
Issue (Month): 11 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:82:y:2012:i:11:p:2001-2007. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.