全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Study on comparison of discretization algorithms of continuous attributes
连续属性离散化算法比较研究

Keywords: discretization,greedy algorithm,significance of attributes,entropy of information,clustering
离散化
,贪心算法,属性重要性,信息熵,聚类,连续属性,属性离散化算法,算法比较,研究,continuous,attributes,algorithms,discretization,comparison,关系,分类,数据集,决策,分布,使用,结果,实验验证,效果,聚类,信息熵,属性重要性

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133