摘要
在不完备序信息系统中,通过引入包含度的概念,对属性重要度进行了定义;在此基础上,提出了一种基于包含度的属性约简算法;最后,通过实例分析表明,该算法能得到不完备序信息系统的一个约简.
In this paper,by introducing the concept of inclusion degree to incomplete ordered information system,the significance of attribute was defined.Then,an inclusion degree-based algorithm for attribute reduction under incomplete ordered information system was proposed.The experimental results show that this algorithm can find the reduction of an incomplete ordered information system.
出处
《佳木斯大学学报（自然科学版）》
CAS
2012年第2期270-272,277,共4页
Journal of Jiamusi University：Natural Science Edition
关键词
粗糙集
不完备序信息系统
优势关系
包含度
属性约简
rough set
incomplete ordered information system
dominance relation
inclusion degree
attribute reduction
