曹峰,唐超,张婧.一种结合二元蚁群和粗糙集的连续属性离散化算法[J].计算机科学,2017,44(9):222-226
一种结合二元蚁群和粗糙集的连续属性离散化算法
Algorithm of Continuous Attribute Discretization Based on Binary Ant Colony and Rough Sets
投稿时间:2016-08-05  修订日期:2016-12-12
DOI:10.11896/j.issn.1002-137X.2017.09.041
中文关键词:  离散化,二元蚁群算法,粗糙集
英文关键词:Discretization,Binary ant colony algorithm,Rough sets
基金项目:本文受国家自然科学基金项目(41401521,61403238,61502288),山西省青年科技研究基金(2015021101),智能信息处理山西省重点实验室开放课题基金项目(2004001,2016001),安徽高校自然科学研究项目(KJ2015A206),合肥学院人才科研基金项目(15RC07)资助
作者单位
曹峰 山西大学计算机与信息技术学院 太原030006 
唐超 合肥学院计算机与科学技术系 合肥230601 
张婧 太原学院数学系 太原030006 
摘要点击次数: 91
全文下载次数: 45
中文摘要:
      离散化是一个重要的数据预处理过程,在规则提取、知识发现、分类等研究领域都有广泛的应用。提出一种结合二元蚁群和粗糙集的连续属性离散化算法。该算法在多维连续属性候选断点集空间上构建二元蚁群网络,通过粗糙集近似分类精度建立蚁群算法适宜度评价函数,寻找全局最优离散化断点集。通过UCI数据集验证算法的有效性,实验结果表明,该算法具有较好的离散化性能。
英文摘要:
      Discretization is an important process of data preprocessing and has been widely applied in the research fields of rule extraction,knowledge discovery,and classification.A discretization algorithm of continuous attribute based on binary ant colony and rough sets was proposed in this paper.The algorithm constructs binary ant colony network on the cut points set generated by multidimensional continuous attributes.Meanwhile,it searches global optimal discretization cut points set by using fitness function constructed with the accuracy of approximation classification of rough sets.To validate the effectiveness of the proposed discretization algorithm,it is applied to seven UCI data sets.And the experimental results indicate that it has relative better performance.
查看全文  查看/发表评论  下载PDF阅读器