Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Systems Engineering-theory & Practice》 2001-12
Add to Favorite Get Latest Update

Reduction of Attribute in Information Systems

LIANG Ji-ye+{1,2}, QU Kai-she+2, XU Zong-ben+1(1. Institute for Information and System Science, Faculty of Science, Xi'an Jiaotong University, Xi'an 710049, China; 2. Department of Computer Science, Shanxi University, Taiyuan 030006, China)  
Rough set theory is a new mathematical tool to deal with vagueness and uncertainty. Reduction of attribute is one of the important topics in the research on rough set theory. It has been proved that finding the minimal reduction of an information system is a NP-hard problem .In this paper, an information quantity-based heuristic algorithm for reduction of attribute is proposed, the time complexity of this algorithm is $O(|A|+3|U|+2)$. Though running an example, we show that this algorithm is effective.
【Fund】: 国家青年科学基金 ( 6 980 5 0 0 4 );; 山西省软科学基金 ( 982 0 5 2 -1 )
【CateGory Index】: TP18
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved