%0 Journal Article
%T Study on two kinds of discretization methods based on rough set theory<br>基于粗糙集理论的两类离散化方法研究
%A 张文波
%J 重庆邮电大学学报(自然科学版)
%D 2011
%I 
%X The discretization of continuous attributes is one of the key steps of Data Pretreatment. In practical application, continuous information systems are usually discretized by efficient heuristic algorithms. Herein, two kinds of heuristic data discretization approaches, i.e. discretization methods respectively based on auxiliary matrixes and information entropy, are thoroughly studied by simulation experiments. Five typical algorithms of each kind are realized and their performances are comprehensively compared by a series of experiments. The experimental results suggest that auxiliary matrix based algorithms are with higher capability, but more complex and time consuming, thus is appropriate for small-scaled continuous systems; and the characteristics of information entropy based algorithms are on the contrary.
%K rough set
%K discretization
%K assistant matrix
%K information entropy<br>粗糙集
%K 离散化
%K 辅助矩阵
%K 信息熵
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=96E6E851B5104576C2DD9FC1FBCB69EF&jid=5C2694A2E5629ECD6B59D7B28C6937AD&aid=8A9892E12714AC7FBE797FAF7F728387&yid=9377ED8094509821&vid=EA389574707BDED3&iid=94C357A881DFC066&sid=9A596D09E9486F3E&eid=6C62BFE34266FA92&journal_id=1673-825X&journal_name=重庆邮电大学学报(自然科学版)&referenced_num=0&reference_num=0