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

基于剪枝的概念格渐进式构造
引用本文:胡立华,张继福,张素兰.基于剪枝的概念格渐进式构造[J].计算机应用,2006,26(7):1659-1661.
作者姓名:胡立华  张继福  张素兰
作者单位:太原科技大学,计算机科学与技术学院,山西,太原,030024
摘    要:概念格是形式概念分析中的核心数据结构。然而,随着需要分析处理的数据量日益剧增,概念格的构造效率成为一个关键问题。采用剪枝方法,消除了概念格构造过程中产生的冗余信息,提出了一种基于剪枝的概念格渐进式构造算法(Pruning based Concept Lattice,PCL),从而减少了概念格内涵的比较次数,提高了概念格的构造效率。采用恒星天体光谱数据作为形式背景,实验验证了算法PCL的正确性和有效性。

关 键 词:概念格  渐进式构造  剪枝  最小上界  天体光谱数据
文章编号:1001-9081(2006)07-1659-03
收稿时间:2006-01-10
修稿时间:2006-01-102006-03-22

Pruning based incremental construction of concept lattice
HU Li-hua,ZHANG Ji-fu,ZHANG Su-lan.Pruning based incremental construction of concept lattice[J].journal of Computer Applications,2006,26(7):1659-1661.
Authors:HU Li-hua  ZHANG Ji-fu  ZHANG Su-lan
Affiliation:School of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan Shanxi 0313024, China
Abstract:Concept lattice is the core data structure of formal concept analysis.However,with the sharp increasing of the data to deal with and analyze,its construction efficiency became the key problem.An incremental algorithm PCL of constructing concept lattice based on pruning was presented through eliminating the redundancy information in the construction process by pruning.It decreased the comparative amount of the intent of concept lattice and improved the efficiency of the concept lattice's construction.The experiment results prove the correctness and validity of PCL by taking the celestial spectrum data as the formal context.
Keywords:concept lattice  incremental construction  pruning  least supper bound supermum  celestial spectrum data
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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