A New Algorithm of Discretization of Consecutive Attributes Based on Decisions in Rough Sets

Abstract:

Proposes a new domain-knowledge independent algorithm of discretization of consecutive attributes based on decisions to amend the limitation that Rough Sets can only deal with the discrete attributes in data sets. Unlike traditional methods, the candidate breakpoint set is obtained after the calculation and sorting of the attribute significance of each consecutive attribute thus leads to a smaller set size and less computational complexity. At the same time, proposes some rules of reducing candidate breakpoints in order to increase the velocity of system convergence. Using the algorithm, the decision table after discretization will be always consistent and can reserve useful information as much as possible. Finally, the algorithm is knowledge-independent and can be used in different fields without any additional information.

• Periodical: Applied Mechanics and Materials (Volumes 44-47)
• Pages: 3942-3947
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.44-47.3942
• Online since: December 2010
• Authors: Wei Pan, Rong An, Hong Ji Yang
• Keywords: Attribute Discretization, Candidate Breakpoint, Decision Consistency, Rough Set (RS)

References

[1] Zhao Jun, Data discretization methods based on rough set theory, Journal of Chinese Computer System, 25(1) (2004) 60-64.

[2] Nguyen H. S., Discretization problem for rough sets methods, Proc. of 1st International Conference on Rough Sets and Current Trends in Computing (1998) 545-552.

DOI: 10.1007/3-540-69115-4_75

[3] Nguyen, H.S., A. Skowron, Quantization of real values attributes, rough set and Boolean reasoning approaches, Proc. of 2nd Joint Annual Conference on Information Science (1995) 34-37.

[4] Xiang Xin-jian, Stolle. M., An algorithm of discretization of continuous attributes in rough sets based on cluster, Journal of Zhejiang University of Science and Technology, 15(3) (2003) 154-157.

[5] Zhao Jun, Wang Guo-yin, and et al., New algorithms for data discretization based on rough set theory, Journal of Chongqing University (Natural Science Edtion), 25(3) (2002) 18-21.

[6] Shen Dong-sheng. A new algorithm of discretization of consecutive attributes, Zhangzhou Teachers College (Natural Science), 16(4) (2003) 27-30.

[7] Tsai zhi, Wang Xu-Fa, Cai Qing-Sheng, Research of data discretization methods based on rough set theory, Computer Science, 28(5) (2001) 39-41, 22.

[8] Liu Kai, Wang Yi-Nao, Pang Yan-Jun, Data discretization methods based on clustering neural network, Computer Science, 28(5) (2001) 136-137, 168.

[9] Slowinski R., Rough classification of HSV patients, Intelligent Decision Support, Kluwer: Roman Slowinski, (1992) 77-94.

[10] Hu X H, Cercone N., Learning in relational databases: a rough set approach, International Journal of Computational Intelligence, 11(3) (1995) 323-338.

DOI: 10.1111/j.1467-8640.1995.tb00035.x

[11] Chen Zun-de, Zhang Rong-jin, Pattern classification method based on K-mean and rough set theory, Computer Science, 28(5) (2001) 64-66.

[12] Miao Duo-qian, Discretization method of consecutive attributes in Rough Sets, ACTA AUTOMATIC SINICA, 27(3) (2001) 296-302.