New heuristic method for data discretization based on rough set theory

被引：8

作者：

ZHAO, Jun ^{[1
]}

ZHOU, Ying-hua ^{[1
]}

机构：

[1] Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing

来源：

Journal of China Universities of Posts and Telecommunications | 2009年 / 16卷 / 06期

基金：

中国国家自然科学基金;

关键词：

cut; cut significance; data discretization; rough set theory; selection probability;

D O I：

10.1016/S1005-8885(08)60296-4

中图分类号：

学科分类号：

摘要：

Data discretization contributes much to the induction of classification rules or trees by machine learning methods. The rough set theory is a valid tool for discretizing continuous information systems. Herein, a new method is proposed to improve those typical rough set based heuristic algorithms for data discretization, by utilizing decision information to reduce the scales of candidate cuts, and by more reasonably measuring cut significance with a new conception of cut selection probability. Simulations demonstrate that compared with other typical discretization algorithms based on the rough set theory, the proposed method is more capable and valid to discretize continuous information systems. It can effectively improve the predictive accuracies of information systems while still conceptually keeping their consistency. © 2009 The Journal of China Universities of Posts and Telecommunications.

引用

页码：113 / 120

页数：7

共 19 条

[11] Pan W., Li J.C., Wang Y.S., Et al., A new algorithm of discretization of consecutive attribute based on the decision in rough sets, Computer Science, 34, 8, pp. 208-210, (2007)
[12] Fomina M., Kulikov A., Vagin V., The development of the generalization algorithm based on the rough set theory, Information Theories and Applications, 13, 4, pp. 255-262, (2005)
[13] Nguyen S.H., Discretization problems for rough set methods, Proceedings of the 1st International Conference on Rough Sets and Current Trend in Computing (RSCTC'98), Jun 22-26, 1998, Warsaw, Poland. LNCS 1424, pp. 545-552, (1998)
[14] Hou L.J., Wang G.Y., Nie N., Et al., Discretization in rough set theory, Computer Science, 27, 12, pp. 89-94, (2000)
[15] Ning W., Zhao M.Q., More improved greedy algorithm for discretizaflon of decision table, Computer Engineering and Applications, 43, 3, pp. 173-174, (2007)
[16] Hou L.J., Yan H.W., Discretization algorithm in rough set based on binary discernibility matrix's tansformation, Computer Engineering and Design, 29, 9, pp. 2330-2332, (2008)
[17] Zhao J., Wang G.Y., Wu Z.F., Et al., New algorithms for data discretization based on rough set theory, Journal of Chongqing University: Natural Science, 25, 3, pp. 18-21, (2002)
[18] Chang L.Y., Wang G.Y., Wu Y., Et al., An approach for attribute reduction and rule generation based on rough set theory, Journal of Software, 10, 11, pp. 1206-1211, (1999)
[19] Mollestad T., Skowron A., Rough set framework for data mining of propositional default rules, Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems (ISMIS'96), Jun 9-13, 1996, Zakopane, Poland. LNCS 1079, pp. 448-457, (1996)

← 1 2 →