应用科学学报

• 论文 • 上一篇    下一篇

海量信息系统分层约简算法研究

梁洪力 张化光 黎明 刘金海 冯健   

  1. 东北大学 教育部暨辽宁省流程工业综合自动化重点实验室, 辽宁 沈阳 110004
  • 收稿日期:2004-10-12 修回日期:2004-12-09 出版日期:2006-01-31 发布日期:2006-01-31

Hierarchical Reduction Algorithm of Huge Information System


LIANG Hong-li, ZHANG Hua-guang, LI Ming, LIU Jin-hai FENG Jian   

  1. Key Laboratory of Process Industry Automation, Ministry of Education, Northeastern University, Shenyang 110004,China
  • Received:2004-10-12 Revised:2004-12-09 Online:2006-01-31 Published:2006-01-31

摘要:

针对海量信息系统的约简问题提出了分层约简算法. 通过对确定增量算子的进一步深入讨论, 得到一系列定理. 进一步给出了有核信息系统与无核信息系统的分层约简算法. 最后, 通过一个实例, 证明了该算法的有效性.

关键词:

核, 约简, 粗糙集, 海量信息系统, 确定增量算子

Abstract:

A hierarchical reduction algorithm is proposed to reduce a huge information system. Based on detailed studies on the certain increment operator, a series of theorems are derived, which form a theoretic basis for the hierarchical reduction algorithm. The hierarchical reduction algorithms are then presented for both the information system with and without core attributes. Validity of the algorithms is shown with an example.

Key words:

core, hierarchical reduction, rough set, huge information system, certain increment operator