| 概念格的对象渐减更新算法 |
| |
| 引用本文： | 王静宇,郑雪岩.概念格的对象渐减更新算法[J].计算机应用与软件,2022,39(3):229-233. |
| |
| 作者姓名： | 王静宇 郑雪岩 |
| |
| 作者单位： | 内蒙古科技大学信息工程学院 内蒙古 包头014010 |
| |
| 基金项目： | 国家自然科学基金项目(61662056)； |
| |
| 摘 要： | 为解决访问控制中的删除某个对象后重新构造概念格耗时的问题,对概念进行了分类,深入研究了概念格中删除对象后各个概念以及边的变化,分析了概念之间及边之间的联系和规则,在此基础上提出一种概念格的对象渐减更新算法.该算法采用渐进式构造方法,不需要重新构造概念格,而且是在原概念格的基础上采用广度优先遍历的顺序对概念格进行调整,进...
|
| 关 键 词： | 访问控制 分类 渐进式 概念格 删除对象 |
AN OBJECT GRADUAL UPDATING ALGORITHM BASED ON CONCEPT LATTICE |
| |
| Wang Jingyu,Zheng Xueyan.AN OBJECT GRADUAL UPDATING ALGORITHM BASED ON CONCEPT LATTICE[J].Computer Applications and Software,2022,39(3):229-233. |
| |
| Authors: | Wang Jingyu Zheng Xueyan |
| |
| Affiliation: | (School of Information Engineering,Inner Mongolia University of Science and Technology,Baotou 014010,Inner Mongolia,China) |
| |
| Abstract: | In order to solve the problem that it takes time to reconstruct the concept lattice after deleting an object in access control,the concepts are classified,the changes of various concepts and edges after deleting objects in the concept lattice are studied in depth,and the relationship and rules between concepts and edges are analyzed.On this basis,an object gradual updating algorithm of concept lattice is proposed.This algorithm used a progressive construction method.It did not need to reconstruct the concept lattice.It used breadth-first traversal based on the original concept lattice.The concept lattice was adjusted to directly determine the type of the child concept according to the type of some parent concepts,without the need to determine the types of all concepts.The experiments show that the number of concepts to be adjusted accounts for a small proportion of the total number of concepts,and this algorithm reduces the time to construct the concept lattice. |
| |
| Keywords: | Access control Classification Progressive Concept lattice Delete object |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
