A Discretization Method of Continuous Attributes Based on Rough Set

Abstract:

when the rough set be used to deal with Knowledge representation system, the data in decision table should be expressed in discrete data, if some conditions or decision attribute is continuous value, which should be discrete Before process.Discretization is not specific data processing only by rough set theory , people have conducted extensive research on discretization problem before the rough set theory put forward , and Made a lot of progress ,but the discretization technique is can not be completely in common used in every subject, different areas have their own unique requirements and handling .This paper proposes a discretization algorithm based on regular conditional entropy.

• Periodical: Applied Mechanics and Materials (Volumes 556-562)
• Pages: 3711-3713
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.556-562.3711
• Online since: May 2014
• Authors: Xiao Kang Tang*, Xue Zhi Zhang, Qiong Zou, You Guo Wei, Cheng Jun Cao
• Keywords: Conditional Entropy, Decision Table, Discretization, Rough Set (RS)

References

[1] Miao tuo qian, Li guo dao. Rough set theory, Algorithm and application [M]. Beijing: Tsinghua university press , (2008).

[2] Wang J, Miao D Q. Analysis on attribute reduction strategies of rough set[J]. Journal of Computer Science and Technology, 1998, 13(2): 189-192.

DOI: 10.1007/bf02946606

[3] PAWIAK Z, et al. Rough sets: probabilistic versus deterministic approach[J]. International Journal of Man-Machine Studies, 1998, 29: 81-95.

DOI: 10.1016/s0020-7373(88)80032-4

[4] Yang shu zi, Ding hong, Shi tie lin etc. Diagnosis reasoning based on knowledge [M]. Nanning: Guangxi science and technology press , (1993).