%0 Journal Article
%T Information entropy discretization algorithm based on ranking means clustering<br>基于逐级均值聚类的信息熵的离散化算法
%A LIU Jing
%A LUO Wei-min
%A LIU Jing-bob
%A <br>刘静
%A 罗卫敏
%A 刘井波b
%J 计算机应用研究
%D 2010
%I 
%X The recent discrete algorithms are very difficult to achieve high efficiency and high recognition rate of both. This paper proposed an information entropy discretization algorithm based on ranking means clustering. Firstly, used ranking means clustering method for analyzing information entropy value of each candidate cuts, and generated a new candidate cuts set. Se-condly, used information entropy method for completing the selection of cuts for the discretization of continuous attributes va-lues. Finally, simulation experiment results show that the method has lower time complexity than traditional methods.
%K rough set
%K discretization
%K continuous attribute values
%K ranking means clustering
%K information entropy<br>粗糙集
%K 离散化
%K 连续值属性
%K 逐级均值聚类
%K 信息熵
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=94AA144CB61BDFF04EAAA96BA3299229&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=9CF7A0430CBB2DFD&sid=0E763684CEBA82AB&eid=77EFA9B64E3B7D14&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10