检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学理学院 [2]中国人民解放军63636部队
出 处:《模糊系统与数学》2012年第2期120-128,共9页Fuzzy Systems and Mathematics
摘 要:基于Shadowed Sets理论研究了粗糙集连续属性离散化问题,提出一种新的基于Shadowed Sets理论的候选断点集提取算法。该算法根据实例在单属性上的分布,对数据样本进行分类,采用Shadowed Sets计算出各类的上下近似,最终提取出候选断点集。使用多组UCI数据对此算法的性能进行检验,同时还与其它候选断点集提取算法做了对比实验。实验结果表明,此算法能有效地减少数据集候选断点的数目,提高离散化算法运行速度和识别率。In this paper,discretization of continuous attributes in rough sets theory is researched and a new algorithm for extracting candidate cuts is proposed based on shadowed sets.According to distribution of the instance,the algorithm sorts the instance,and uses shadowed sets to calculate every class's the upper and lower approximation,at last the candidate cuts are extracted.Several UCI data sets are applied to test the performance of the algorithm and the experiment results are compared with other algorithms.The experiment results show that the algorithm can effectively reduce the number of candidate cuts in data sets,and increase the speed of discretization and the rate of recognition.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30