鄂旭, 高学东, 武森, 张秋月. 信息表中不完备数据的填补方法[J]. 工程科学学报, 2005, 27(3): 364-366. DOI: 10.13374/j.issn1001-053x.2005.03.027
引用本文: 鄂旭, 高学东, 武森, 张秋月. 信息表中不完备数据的填补方法[J]. 工程科学学报, 2005, 27(3): 364-366. DOI: 10.13374/j.issn1001-053x.2005.03.027
E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. DOI: 10.13374/j.issn1001-053x.2005.03.027
Citation: E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. DOI: 10.13374/j.issn1001-053x.2005.03.027

信息表中不完备数据的填补方法

A New method of packing the missing data

  • 摘要: 提出了一种基于粗糙集的不完备数据填补方法.本算法以突出信息表的决策规则为主要目的,选取重要断点为主要手段,以分类质量作为迭代约束条件.实验和数值实例表明,本算法不但不会产生冲突规则,而且能够进一步突出决策规则.

     

    Abstract: A new algorithm for filling up in complete data was presented according to rough sets. In this method, the main purpose was emphasizing the decision rules, the main means was selecting the important breaking points, and the iterative constraint was the quality of classification. Numerical illustration and database experiments show that the algorithm did not generate conflict rules,but highlighted them.

     

/

返回文章
返回