| 注册
首页|期刊导航|计算机工程与应用|基于属性的概念格渐进式构造原理与算法

基于属性的概念格渐进式构造原理与算法

智慧来 智东杰

计算机工程与应用2012,Vol.48Issue(26):17-21,5.
计算机工程与应用2012,Vol.48Issue(26):17-21,5.DOI:10.3778/j.issn.1002-8331.2012.26.004

基于属性的概念格渐进式构造原理与算法

Theory and algorithm of concept lattice incremental construction based on attributes

智慧来 1智东杰1

作者信息

  • 1. 河南理工大学 计算机科学与技术学院,河南焦作454150
  • 折叠

摘要

Abstract

In order to improve concept lattice construction efficiency, it proves that concept generation and inserting place only relate to newly generated concept instead of the entire concepts in the lattice. Accordingly, it presents the algorithm and carries out experiments, which show that new concepts are few and don't increase steadily with the growth of the lattice, and running time is reduced.

关键词

概念格/渐进式算法/最亲近子概念/新生概念/属性

Key words

concept lattice/ incremental algorithm/ most relative child concept/ newborn concept/ attribute

分类

信息技术与安全科学

引用本文复制引用

智慧来,智东杰..基于属性的概念格渐进式构造原理与算法[J].计算机工程与应用,2012,48(26):17-21,5.

基金项目

国家自然科学基金(No.60975033) (No.60975033)

河南理工大学博士基金(No.B2011-102). (No.B2011-102)

计算机工程与应用

OACSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文