Improved Algorithm for Discretization of Decision Table

Abstract:

Discretization of decision table is the important step for pretreatment of data mining and machine learning, which related to the effect of learning. It has great contribution to speeding up the followed learning algorithms, cutting down the real demand of algorithms on running space and time. In this paper, the basic characteristics and framework of discretization approaches about greedy and improved algorithm are analyzed at first, then a new algorithm is put forward to select the useful cuts. The example is given to show that the useful cuts is consistent with the result of technicist. The algorithm offered the important theoretics basis for followed attribute reduction.

• Periodical: Advanced Materials Research (Volumes 532-533)
• Pages: 1649-1653
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.532-533.1649
• Online since: June 2012
• Authors: Li Fang Chen, Ying Ma
• Keywords: Clustering, Discretization, Greedy Algorithm

References

[1] Wang Guoyin. Rough set theory and Knowledge Acquisition , Xi'an Jiaotong University Press(2001), pp.105-116.

[2] Zhao Jun, Wang Guoyin, etc. New Algorithm for Data Discretization based on Rough set. Chongqing University(2002), pp.18-21.

[3] Ning Wei, Zhao Qingming. Discrete decision table on the further improvement of the greedy algorithm. Computer Engineering and Applications(2007), pp.173-178.

[4] Zhang Wenxiu, Chiu Guofang. Uncertain Decision-making based on Rough set. Qinghua University Press(2005).

[5] Wu Shanchan, Mao feng, etc. Two Discretization Algorithm based on Rough set. Computer Engineering and Applications(2004), pp.68-69.