检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]太原科技大学计算机科学与技术学院
出 处:《智能系统学报》2006年第2期31-38,共8页CAAI Transactions on Intelligent Systems
基 金:国家自然科学基金资助项目(60573075).
摘 要:概念格是一种有效的数据分析和知识提取的形式化工具.然而,随着要处理的数据量的剧增,基于原始形式背景构造出的概念格结点数目庞大,占用大的存储空间,同时概念格结点中一些属性集形成的内涵,用户并不都感兴趣,因而从中提取用户需求知识费时.为了降低概念格构造的时空复杂性,增强实用性和针对性,首先采用谓词逻辑描述用户感兴趣的背景知识,并将背景知识引入到概念格结构中,提出了一种新的概念格:约束概念格.在此基础上,提出了基于背景知识的约束概念格构造算法CCLA.理论分析表明,该算法能有效地减少概念格的存储空间和建格时间.最后,采用恒星天体光谱数据作为形式背景,实验验证了该算法的有效性.Concept lattice is an effective formal tool for data analysis and knowledge mining. However, with the increase of data volume, the node number of the constructed concept lattice from the original formal context usually increases enormously, and large storage is required accordingly. Meantime, users are not interested in all intensions of attributes set, and more computational time is unnecessarily consumed as a result. In order to reduce time and storage complexity and improve the utility and pertinence to the concept lattice construction, predicate logic is used to describe the user interested background knowledge, and a new concept lattice structure-constrained concept lattice is presented. Then based on the background knowledge, a construction algorithm (CCLA) is also provided. Through some theoretical analysis, it is shown that the proposed algorithm can reduce the storage and time complexity of concept lattice construction process. Finally, the experiments with celestial body spectra as the formal context validate the proposed algorithm.
关 键 词:数据挖掘 约束概念格 谓词逻辑 背景知识 恒星光谱数据
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.198