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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
