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

概念格的分层及逐层建格法
引用本文:谢润,李海霞,马骏,宋振明.概念格的分层及逐层建格法[J].西南交通大学学报,2005,40(6):837-841.
作者姓名:谢润  李海霞  马骏  宋振明
作者单位:1. 西南交通大学理学院,四川,成都,610031;宜宾学院数学系,四川,宜宾,644007
2. 西南交通大学理学院,四川,成都,610031
摘    要:给出了分层概念格重要性质:同层概念不可比和每个概念至少被1个上层的概念覆盖.得到了概念格上的对象映射和属性映射的一般计算公式和在对象化简过程中格结构不变的定理.由上述性质和定理,给出建格算法.此方法以概念格分层为基础,逐层建格.因为在建每层格的节点的过程中同时进行筛选,所以不会生成冗余重复的格节点.

关 键 词:概念格  算法  节点  对象  属性  映射  数据挖掘
文章编号:0258-2724(2005)06-0837-05
收稿时间:2004-11-27
修稿时间:2004-11-27

Hierarchic Construction of Concept Lattice
XIE Run,LI Hai-xia,MA Jun,SONG Zhen-ming.Hierarchic Construction of Concept Lattice[J].Journal of Southwest Jiaotong University,2005,40(6):837-841.
Authors:XIE Run  LI Hai-xia  MA Jun  SONG Zhen-ming
Institution:1. School of Science, Southwest Jiaotong University, Chengdu 610031, China; 2. Dept. of Mathematics, Yibin University, Yibin 644007, China
Abstract:Two important properties of hierarchical concept lattice were presented: the concepts in a same layer are incomparable and a concept is overlayed by at least one concept on the upper layer.The general formula for the object and atribute mapping was derived,and a theorem,which describes the structural invariability of objects during their construction,was obtained.A new algorithm was proposed to construct the concept lattice occording to the properties and theorem.The proposed algorithm constructs the lattice lay by lay based on the hierarchical structure of concept lattice.No abundant concept is created,because filtration is carried out during construction of concepts.
Keywords:concept lattice  algorithm  concept  object  atribute  mapping  data mining
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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