东南大学学报（英文版）2008，Vol.24Issue(1)：20-24,5.
基于概念格的分布式约简理论框架
Theoretical framework for distributed reduction in concept lattice
摘要
Abstract
In order to reduce knowledge reasoning space and improve knowledge processing efficiency, a framework of distributed attribute reduction in concept lattices is presented. By employing the idea similar to that of the rough set,the characterization of core attributes,dispensable attributes and unnecessary attributes are described from the point of view of local formal contexts and virtual global contexts.A determinant theorem of attribute reduction is derived.Based on these results,an approach for distributed attribute reduction is presented.It first performs reduction independently on each local context using the existing approaches,and then local reducts are merged to compute reducts of global contexts.An algorithm implementation is provided and its effectiveness is validated.The distributed reduction algorithm facilitates not only improving computation efficiency but also avoiding the problems caused by the existing approaches,such as data privacy and communication overhead.关键词
分布式约简/知识处理/形式背景Key words
distributed reduction/ knowledge processing/ formal context分类
信息技术与安全科学引用本文复制引用
杨彬,徐宝文,李亚军..基于概念格的分布式约简理论框架[J].东南大学学报（英文版）,2008,24(1):20-24,5.基金项目
The National Outstanding Young Scientist Foundation by NSFC(No.60425206),the National Natural Science Foundation of China(No.60503020),the Natural Science Foundation of Jiangsu Province(No.BK2006094). （No.60425206）
