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.
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.
If references are entirely missing, you can add them using this form.