首页 | 本学科首页   官方微博 | 高级检索  
     

面向属性概念格基于覆盖的压缩
引用本文:魏玲,李强.面向属性概念格基于覆盖的压缩[J].电子科技大学学报(自然科学版),2012,41(2):299-304.
作者姓名:魏玲  李强
作者单位:1.西北大学数学系 西安 710069
基金项目:国家自然科学基金(60703117,11071281,61005042)
摘    要:提出了一种直接从形式背景出发,获得简化面向属性概念格的方法。针对一个形式背景,引入对象集和属性集上的相似度,产生对象邻域与属性邻域,进而根据对象的相似程度或属性的相似程度来调整对象邻域或属性邻域的大小,控制面向属性概念格节点的个数,实现对面向属性概念格的动态压缩。该方法可以分别从对象的覆盖和属性的覆盖两个角度压缩面向属性概念格中节点的个数,且压缩后的概念集为原概念集的子集,从而达到简化知识库的效果。

关 键 词:覆盖    形式背景    邻域    面向属性概念格    相似度
收稿时间:2010-04-16

Covering-Based Reduction of Property-Oriented Concept Lattices
WEI Ling,LI Qiang.Covering-Based Reduction of Property-Oriented Concept Lattices[J].Journal of University of Electronic Science and Technology of China,2012,41(2):299-304.
Authors:WEI Ling  LI Qiang
Affiliation:1.Department of Mathematics,Northwest University Xi'an 710069
Abstract:A method to reduce the property-oriented concept lattice of a formal context directly is proposed in this paper. The similarity degree between object sets and the similarity degree between attribute sets are firstly introduced, and then, object neighborhood and attribute neighborhood are created accordingly. The sizes of object neighborhood or the attribute neighborhood are adjusted by the similarity degrees, thus, the number of the property-oriented concepts can be controlled and the property-oriented concept lattice is compressed. Using this method, we can compress the property-oriented concept lattice from the viewpoints of object covering and attribute covering, and the most important is that the reduced lattice is a subset of the original one.
Keywords:
本文献已被 万方数据 等数据库收录!
点击此处可从《电子科技大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《电子科技大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号