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

基于剪枝的约束概念格的渐进式构造算法
引用本文:马洋,张继福,张素兰.基于剪枝的约束概念格的渐进式构造算法[J].计算机应用,2009,29(5):1397-1400.
作者姓名:马洋  张继福  张素兰
作者单位:太原科技大学,计算机科学与技术学院,太原,030024
摘    要:约束概念格是数据分析的一种有效工具,在其构造的过程中,大量的内涵之间比较操作是导致格的构造效率低下的主要原因之一。采用剪枝技术来消除构造过程中存在的冗余内涵比较,给出约束概念格渐进式构造算法PCCL。该算法利用父子节点内涵的严格单调关系,自顶向下扫描格节点,减少了新增对象属性集与原概念格节点内涵的比较次数,从而提高了约束概念格的构造效率。最后以天体光谱数据作为形式背景,实验验证了PCCL算法的正确性,且构造效率平均提高了15%以上。

关 键 词:概念格  冗余信息  剪枝  渐进式构造算法  concept  lattice  redundancy  information  pruning  incremental  construction  algorithm
收稿时间:2008-11-11
修稿时间:2009-01-01

Incremental construction algorithm of constrained concept lattice based on pruning
MA Yang,ZHANG Ji-fu,ZHANG Su-lan.Incremental construction algorithm of constrained concept lattice based on pruning[J].journal of Computer Applications,2009,29(5):1397-1400.
Authors:MA Yang  ZHANG Ji-fu  ZHANG Su-lan
Affiliation:School of Computer Science and Technology;Taiyuan University of Science and Technology;Taiyuan Shanxi 030024;China
Abstract:An incremental construction algorithm named PCCL of the constrained concept lattice was presented by using pruning technology that eliminated the redundant information in the construction process. By making use of the rigorous monotone relation between father concept's intent and child concept's intent, all nodes of the constrained concept lattice were scanned from top to down, and the comparative operations between the intents were decreased, thus the efficiency of constructing the constrained concept lattice was improved. Experimental results verify the correctness and validity of PCCL by taking the celestial spectrum data as the formal context.
Keywords:concept lattice  redundancy information  pruning  incremental construction algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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