| 基于二进制可辩识矩阵变换的离散化算法 |
| |
| 引用本文： | 侯利娟,颜宏文.基于二进制可辩识矩阵变换的离散化算法[J].计算机工程与设计,2008,29(9):2330-2332. |
| |
| 作者姓名： | 侯利娟 颜宏文 |
| |
| 作者单位： | 长沙理工大学,计算机与通信工程学院,湖南,长沙,410076 |
| |
| 摘 要： | 在用粗糙集理论处理决策表进行约简时,要求决策表中的各值用离散值表达,即离散化.求最小数目的断点集是一个NP-hard问题,解决这类问题的一般方法是采用启发式算法求出最优或次优解,给出了离散化中的二进制可辩识矩阵的定义,并提出了基于二进制可辩识矩阵变换的离散化算法,实例证明,该算法是有效的和高效的.
|
| 关 键 词： | 粗糙集理论 决策表 二进制可辨识矩阵 离散化 断点核 |
| 文章编号： | 1000-7024(2008)09-2330-03 |
| 修稿时间： | 2007年5月21日 |
Discretization algorithm in rough set based on binary discernibility matrix's tansformation |
| |
| HOU Li-juan,YAN Hong-wen.Discretization algorithm in rough set based on binary discernibility matrix's tansformation[J].Computer Engineering and Design,2008,29(9):2330-2332. |
| |
| Authors: | HOU Li-juan YAN Hong-wen |
| |
| Affiliation: | HOU Li-juan,YAN Hong-wen(Institute of Computer , Communication Engineering,Changsha University of Science , Technology,Changsha 410076,China) |
| |
| Abstract: | Before processing decision table's reduction in rough set,it request the data is discretized.In other words,it requests di-scretization.The NP-hard problem is proved for seaching the minimum cut set.The common method to solve this problem is to adopt the heuristic algorithm.The definition of binary discernibility in discretization fields is given and the algorithm of discretization based on binary discernibility matrix's tansformation is proposed,the example proved this algorithm is effective and highly eff... |
| |
| Keywords: | rough set theory decision table binary discernibility matrix discretization cut core |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
