arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.0190cs.AI
收藏

基于粗糙集理论的最小规则约简集的剪枝算法

Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory

Ankara University(安卡拉大学);Bilkent University(比尔肯特大学)

Şahin Emrah Amrahov, Fatih Aybar, Serhat Doğan

摘要:

本文研究了基于粗糙集理论的规则约简生成问题。规则缩减生成(RG)和修改规则生成(MRG)算法是公知的。替代这些算法的剪枝算法生成一个最小的规则约简集,或简称剪枝规则生成(PRG)算法的开发。PRG算法使用树结构的数据类型。将PRG算法与RG、MRG算法进行了比较

英文摘要:

In this paper it is considered rule reduct generation problem, based on Rough Set Theory. Rule Reduct Generation (RG) and Modified Rule Generation (MRG) algorithms are well-known. Alternative to these algorithms Pruning Algorithm of Generation A Minimal Set of Rule Reducts, or briefly Pruning Rule Generation (PRG) algorithm is developed. PRG algorithm uses tree structured data type. PRG algorithm is compared with RG and MRG algorithms

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑