摘要
研究在不完备信息系统(incomplete information system,IIS)中的知识获取已经成为近期粒度计算研究的热点方向之一.为探索一种高效的知识获取方法,基于相容粒度计算的基本原理,针对不完备信息系统的特点,提出了一种完整的知识获取算法.该算法包括不完备信息系统的属性约简算法和系统中对象的约简算法.其主要特点是在由完全覆盖构成的粒度世界中去研究知识的表示和获取问题,其基本粒就是最大相容类.对算法的性能进行了理论和实验分析,证明了算法的有效性和可行性.
Study on knowledge acquisition in incomplete information system(IIS) has attracted increasing attention in Granular Computing(GrC). Based on principle of tolerance granular computing, an efficient and effective approach to acquire knowledge in incomplete information system is put forward, which contains attribute reduct algorithm for incomplete information system and reduct algorithm for objects. The approach is characterized by studying representation and acquisition of knowledge in granular world which consists of maximal tolerance classes. And theoretical and experimental analysis is given to prove feasibility and validity of the approach.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2008年第z1期264-267,共4页
Journal of Computer Research and Development
基金
国家自然科学基金项目(60435010,60404021)
广西壮族自治区教育厅科研项目经费基金项目(桂教科研[2006]26号)
关键词
相容粒度计算
不完备信息系统
知识获取
约简
tolerance granular computing
incomplete information system
knowledge acquisition
reduct
