%0 Journal Article
%T Study on comparison of discretization algorithms of continuous attributes<br>连续属性离散化算法比较研究
%A LIU Ye-zheng
%A JIAO Ning
%A JIANG Yuan-chun
%A <br>刘业政
%A 焦宁
%A 姜元春
%J 计算机应用研究
%D 2007
%I 
%X This paper disscussed four kinds of discretization methods which include greedy and some improved algorithms, significance of attributes, entropy of information and clustering-based algorithms. And compard the quality of the four categories of algorithms. The last experiments indicate that the quality of discretization of dataset not only lies on the algorithm, but also is closely related to distributing of continuous attributes and data of decision.
%K discretization
%K greedy algorithm
%K significance of attributes
%K entropy of information
%K clustering<br>离散化
%K 贪心算法
%K 属性重要性
%K 信息熵
%K 聚类
%K 连续属性
%K 属性离散化算法
%K 算法比较
%K 研究
%K continuous
%K attributes
%K algorithms
%K discretization
%K comparison
%K 关系
%K 分类
%K 数据集
%K 决策
%K 分布
%K 使用
%K 结果
%K 实验验证
%K 效果
%K 聚类
%K 信息熵
%K 属性重要性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C793235A4E87B8F600065F1CBE56C01C&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=9CF7A0430CBB2DFD&sid=D3E34374A0D77D7F&eid=340AC2BF8E7AB4FD&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=10